Searched hist:"125966 e8" (Results 1 – 8 of 8) sorted by relevance
| /dragonfly/sbin/hammer2/ |
| H A D | hammer2.8 | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| /dragonfly/sys/vfs/hammer2/ |
| H A D | hammer2_bulkfree.c | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| H A D | hammer2_strategy.c | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| H A D | hammer2_flush.c | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| H A D | hammer2_chain.c | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| H A D | hammer2_vfsops.c | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| H A D | hammer2.h | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|
| /dragonfly/sbin/hammer/ |
| H A D | hammer.8 | diff 125966e8 Sun Aug 30 21:17:35 GMT 2015 Matthew Dillon <dillon@apollo.backplane.com> hammer2 - Refactor bulkfree
* Change the bulkfree scan from breadth-first to depth-first. This
improves disk performance significantly (~2x) and is also needed for the
duplicate-detection feature.
* Create an 8-way set-associative hash table similar to what the live
dedup code uses. Record the data_off for elements we have processed
and detect if a duplicate is encountered so we do not have to re-process
the duplicate subtree.
Also prioritize the table based on the aggregate bottom-up inode count
to reduce the chance that a top-level duplicate (aka snapshot) will get
kicked out of the hash table.
* Clean up the hammer2_chain_scan() API, making it more bref-centric
which allows us to avoid instantiating chain structures for leaf
entities. This significantly improves performance and increases
flexibility.
* Manual page adjustments for kern.maxvnodes settings suggestions.
|