{
unsigned num_unfound_before = missing_loc.num_unfound();
bool found_missing = missing_loc.add_source_info(
- from, oinfo, omissing, get_sort_bitwise(), ctx->handle);
+ from, oinfo, omissing, ctx->handle);
if (found_missing && num_unfound_before != missing_loc.num_unfound())
publish_stats_to_osd();
if (found_missing &&
pg_shard_t fromosd,
const pg_info_t &oinfo,
const pg_missing_t &omissing,
- bool sort_bitwise,
ThreadPool::TPHandle* handle)
{
bool found_missing = false;
continue;
}
if (!oinfo.last_backfill.is_max() &&
- oinfo.last_backfill_bitwise != sort_bitwise) {
+ !oinfo.last_backfill_bitwise) {
ldout(pg->cct, 10) << "search_for_missing " << soid << " " << need
<< " also missing on osd." << fromosd
<< " (last_backfill " << oinfo.last_backfill
missing_loc.add_batch_sources_info(complete_shards, ctx->handle);
} else {
missing_loc.add_source_info(pg_whoami, info, pg_log.get_missing(),
- get_sort_bitwise(), ctx->handle);
+ ctx->handle);
for (set<pg_shard_t>::iterator i = actingbackfill.begin();
i != actingbackfill.end();
++i) {
*i,
peer_info[*i],
peer_missing[*i],
- get_sort_bitwise(),
ctx->handle);
}
}
pg_shard_t source, ///< [in] source
const pg_info_t &oinfo, ///< [in] info
const pg_missing_t &omissing, ///< [in] (optional) missing
- bool sort_bitwise, ///< [in] local sort bitwise (vs nibblewise)
ThreadPool::TPHandle* handle ///< [in] ThreadPool handle
); ///< @return whether a new object location was discovered