| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | make-tree.cc | 95 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
102 *maxkey = htonl(seq + n - 1); in populate_leaf()
106 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
107 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
118 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
122 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
140 *maxkey = maxkeys[0]; in make_tree()
144 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
145 *maxkey = maxkeys[i]; in make_tree()
178 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) {
92 *maxkey = htonl(seq + n - 1);
97 int k = htonl(maxkey);
98 maxkey = htonl(k+1);
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) {
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey);
131 *maxkey = maxkeys[0];
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0)
136 *maxkey = maxkeys[i];
166 int seq = 0, minkey, maxkey;
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 85 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
92 *maxkey = htonl(seq + n - 1); in populate_leaf()
97 int k = htonl(maxkey); in insert_into_child_buffer()
98 maxkey = htonl(k+1); in insert_into_child_buffer()
99 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
113 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
131 *maxkey = maxkeys[0]; in make_tree()
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
136 *maxkey = maxkeys[i]; in make_tree()
166 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|
| H A D | verify-bad-msn.cc | 100 populate_leaf(FTNODE leafnode, int seq, int n, int *minkey, int *maxkey) { in populate_leaf() argument
107 *maxkey = htonl(seq + n - 1); in populate_leaf()
111 insert_into_child_buffer(FT_HANDLE ft, FTNODE node, int childnum, int minkey, int maxkey) { in insert_into_child_buffer() argument
112 for (unsigned int val = htonl(minkey); val <= htonl(maxkey); val++) { in insert_into_child_buffer()
125 make_tree(FT_HANDLE ft, int height, int fanout, int nperleaf, int *seq, int *minkey, int *maxkey) { in make_tree() argument
129 populate_leaf(node, *seq, nperleaf, minkey, maxkey); in make_tree()
147 *maxkey = maxkeys[0]; in make_tree()
151 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0) in make_tree()
152 *maxkey = maxkeys[i]; in make_tree()
182 int seq = 0, minkey, maxkey; in test_make_tree() local
[all …]
|