{
dout(30) << __func__ << " 0x" << std::hex << offset << "~" << length
<< std::dec << dendl;
- faulted = true;
auto p = seek_shard(offset);
auto last = seek_shard(offset + length);
while (p != shards.end()) {
{
dout(30) << __func__ << " 0x" << std::hex << offset << "~" << length
<< std::dec << dendl;
- assert(faulted);
if (shards.empty()) {
dout(20) << __func__ << " mark inline shard dirty" << dendl;
inline_bl.clear();
BlueStore::extent_map_t::iterator BlueStore::ExtentMap::find_lextent(
uint64_t offset)
{
- assert(faulted);
Extent dummy(offset);
auto fp = extent_map.lower_bound(dummy);
if (fp != extent_map.begin()) {
BlueStore::extent_map_t::iterator BlueStore::ExtentMap::seek_lextent(
uint64_t offset)
{
- assert(faulted);
Extent dummy(offset);
auto fp = extent_map.lower_bound(dummy);
if (fp != extent_map.begin()) {
bool BlueStore::ExtentMap::has_any_lextents(uint64_t offset, uint64_t length)
{
- assert(faulted);
Extent dummy(offset);
auto fp = extent_map.lower_bound(dummy);
if (fp != extent_map.begin()) {
extent_map_t extent_map; ///< map of Extents to Blobs
blob_map_t spanning_blob_map; ///< blobs that span shards
- bool faulted = false; ///< for debug only
-
struct Shard {
string key; ///< kv key
uint32_t offset; ///< starting logical offset