Dear all linux-block developers,
Recently, I'm very interested in the principle of linux bcache(drivers\md\bcache) bset tree, but it's hard to understand. I have two questions.
1. What do the exponent and mantissa in bkey_bfloat structure meaning, and how to understand the process of mantissa's computation bfloat_mantissa.
2. Maybe I don't understand bkey_bfloat's construction, so I can't understand the function bset_search_tree. How to understand bset_search_tree function.
Can someone help me? Looking forward to your reply. Thanks!
---
Fushou Lin
