| /dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/ |
| H A D | uniques.cc | 279 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
284 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
289 if (n_full_trees) in get_use_cost()
290 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
294 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
297 if (!n_full_trees) in get_use_cost()
305 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
310 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/ |
| H A D | uniques.cc | 279 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
284 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
289 if (n_full_trees) in get_use_cost()
290 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
294 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
297 if (!n_full_trees) in get_use_cost()
305 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
310 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/ |
| H A D | uniques.cc | 279 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
284 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
289 if (n_full_trees) in get_use_cost()
290 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
294 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
297 if (!n_full_trees) in get_use_cost()
305 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
310 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/ |
| H A D | uniques.cc | 279 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
284 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
289 if (n_full_trees) in get_use_cost()
290 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
294 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
297 if (!n_full_trees) in get_use_cost()
305 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
310 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/mysql56-client/mysql-5.6.51/sql/ |
| H A D | uniques.cc | 279 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
284 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
289 if (n_full_trees) in get_use_cost()
290 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
294 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
297 if (!n_full_trees) in get_use_cost()
305 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
310 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/mysql55-client/mysql-5.5.62/sql/ |
| H A D | uniques.cc | 272 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
278 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
283 if (n_full_trees) in get_use_cost()
284 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
288 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
291 if (!n_full_trees) in get_use_cost()
299 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
304 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/sql/ |
| H A D | uniques.cc | 311 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
316 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
321 if (n_full_trees) in get_use_cost()
322 n_compares+= n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
326 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
329 if (!n_full_trees) in get_use_cost()
337 result+= cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
343 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/sql/ |
| H A D | uniques.cc | 311 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
316 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
321 if (n_full_trees) in get_use_cost()
322 n_compares+= n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
326 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
329 if (!n_full_trees) in get_use_cost()
337 result+= cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
343 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/sql/ |
| H A D | uniques.cc | 309 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
314 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
319 if (n_full_trees) in get_use_cost()
320 n_compares+= n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
324 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
327 if (!n_full_trees) in get_use_cost()
335 result+= cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
341 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/sql/ |
| H A D | uniques.cc | 311 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
316 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
321 if (n_full_trees) in get_use_cost()
322 n_compares+= n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
326 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
329 if (!n_full_trees) in get_use_cost()
337 result+= cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
343 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/xtrabackup/percona-xtrabackup-2.4.21/sql/ |
| H A D | uniques.cc | 309 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
314 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
319 if (n_full_trees) in get_use_cost()
320 n_compares+= n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
324 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
327 if (!n_full_trees) in get_use_cost()
335 result+= cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
341 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/mysql57-client/mysql-5.7.36/sql/ |
| H A D | uniques.cc | 309 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
314 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
319 if (n_full_trees) in get_use_cost()
320 n_compares+= n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
324 n_full_trees, n_full_trees?max_elements_in_tree:0, in get_use_cost()
327 if (!n_full_trees) in get_use_cost()
335 result+= cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
341 double merge_cost= get_merge_many_buffs_cost(buffer, n_full_trees, in get_use_cost()
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/sql/ |
| H A D | uniques.cc | 314 size_t n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
323 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
328 if (n_full_trees) in get_use_cost()
329 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
333 (uint)n_full_trees, in get_use_cost()
334 (uint)(n_full_trees?max_elements_in_tree:0), in get_use_cost()
338 *in_memory= !n_full_trees; in get_use_cost()
340 if (!n_full_trees) in get_use_cost()
348 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
355 double merge_cost= get_merge_many_buffs_cost(buffer, (uint)n_full_trees, in get_use_cost()
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/sql/ |
| H A D | uniques.cc | 315 size_t n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
324 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
329 if (n_full_trees) in get_use_cost()
330 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
334 (uint)n_full_trees, in get_use_cost()
335 (uint)(n_full_trees?max_elements_in_tree:0), in get_use_cost()
339 *in_memory= !n_full_trees; in get_use_cost()
341 if (!n_full_trees) in get_use_cost()
349 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
356 double merge_cost= get_merge_many_buffs_cost(buffer, (uint)n_full_trees, in get_use_cost()
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/sql/ |
| H A D | uniques.cc | 315 size_t n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
324 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
329 if (n_full_trees) in get_use_cost()
330 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
334 (uint)n_full_trees, in get_use_cost()
335 (uint)(n_full_trees?max_elements_in_tree:0), in get_use_cost()
339 *in_memory= !n_full_trees; in get_use_cost()
341 if (!n_full_trees) in get_use_cost()
349 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
356 double merge_cost= get_merge_many_buffs_cost(buffer, (uint)n_full_trees, in get_use_cost()
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/sql/ |
| H A D | uniques.cc | 315 size_t n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
324 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
329 if (n_full_trees) in get_use_cost()
330 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
334 (uint)n_full_trees, in get_use_cost()
335 (uint)(n_full_trees?max_elements_in_tree:0), in get_use_cost()
339 *in_memory= !n_full_trees; in get_use_cost()
341 if (!n_full_trees) in get_use_cost()
349 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
356 double merge_cost= get_merge_many_buffs_cost(buffer, (uint)n_full_trees, in get_use_cost()
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/sql/ |
| H A D | uniques.cc | 315 size_t n_full_trees; /* number of trees in unique - 1 */
324 n_full_trees= nkeys / max_elements_in_tree;
329 if (n_full_trees)
330 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0);
334 (uint)n_full_trees,
335 (uint)(n_full_trees?max_elements_in_tree:0),
339 *in_memory= !n_full_trees;
341 if (!n_full_trees)
349 result += DISK_SEEK_BASE_COST * n_full_trees *
356 double merge_cost= get_merge_many_buffs_cost(buffer, (uint)n_full_trees,
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/sql/ |
| H A D | uniques.cc | 314 size_t n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
323 n_full_trees= nkeys / max_elements_in_tree; in get_use_cost()
328 if (n_full_trees) in get_use_cost()
329 result+= n_full_trees * log2_n_fact(max_elements_in_tree + 1.0); in get_use_cost()
333 (uint)n_full_trees, in get_use_cost()
334 (uint)(n_full_trees?max_elements_in_tree:0), in get_use_cost()
338 *in_memory= !n_full_trees; in get_use_cost()
340 if (!n_full_trees) in get_use_cost()
348 result += DISK_SEEK_BASE_COST * n_full_trees * in get_use_cost()
355 double merge_cost= get_merge_many_buffs_cost(buffer, (uint)n_full_trees, in get_use_cost()
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/sql/ |
| H A D | uniques.cc | 577 int n_full_trees; /* number of trees in unique - 1 */ in get_use_cost() local
582 n_full_trees = nkeys / max_elements_in_tree; in get_use_cost()
587 if (n_full_trees) in get_use_cost()
588 n_compares += n_full_trees * log2_n_fact(max_elements_in_tree + 1); in get_use_cost()
592 ("unique trees sizes: %u=%u*%lu + %lu", nkeys, n_full_trees, in get_use_cost()
593 n_full_trees ? max_elements_in_tree : 0, last_tree_elems)); in get_use_cost()
595 if (!n_full_trees) return result; in get_use_cost()
602 result += cost_model->disk_seek_base_cost() * n_full_trees * in get_use_cost()
609 get_merge_many_buffs_cost(buffer, n_full_trees, max_elements_in_tree, in get_use_cost()
|