| /dports/sysutils/fusefs-s3backer/s3backer-1.5.4/ |
| H A D | hash.c | 55 u_int maxkeys; /* max capacity */ member
67 s3b_hash_create(struct s3b_hash **hashp, u_int maxkeys) in s3b_hash_create() argument
72 if (maxkeys >= (u_int)(UINT_MAX * LOAD_FACTOR) - 1) in s3b_hash_create()
74 alen = (u_int)(maxkeys / LOAD_FACTOR) + 1; in s3b_hash_create()
77 hash->maxkeys = maxkeys; in s3b_hash_create()
132 assert(hash->numkeys < hash->maxkeys); in s3b_hash_put()
154 assert(hash->numkeys < hash->maxkeys); in s3b_hash_put_new()
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /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 | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout];
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]);
123 int k = maxkeys[childnum-1]; // use the max of the left tree
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]);
131 *maxkey = maxkeys[0];
135 if (memcmp(maxkey, &maxkeys[i], sizeof maxkeys[i]) < 0)
136 *maxkey = maxkeys[i];
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/tokudb/PerconaFT/ft/tests/ |
| H A D | verify-bad-msn.cc | 133 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
135 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
139 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
144 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|
| H A D | verify-misrouted-msgs.cc | 117 int minkeys[fanout], maxkeys[fanout]; in make_tree() local
119 …ODE child = make_tree(ft, height-1, fanout, nperleaf, seq, &minkeys[childnum], &maxkeys[childnum]); in make_tree()
123 int k = maxkeys[childnum-1]; // use the max of the left tree in make_tree()
128 insert_into_child_buffer(ft, node, childnum, minkeys[childnum], maxkeys[childnum]); 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()
|