@@ -1238,7 +1238,7 @@ void DeleteBitmap::add_to_remove_queue(
1238
1238
// val: vector of [tablet_id, {rowset_id, seg_id, start_version}, {rowset_id, seg_id, end_version}]
1239
1239
// note that the end version is the end version of input rowsets
1240
1240
_stale_delete_bitmap.emplace (version_str, vector);
1241
- LOG (INFO) << " sout: tablet_id=" << _tablet_id << " , add key=" << version_str
1241
+ LOG (INFO) << " sout: add_to_remove_queue. tablet_id=" << _tablet_id << " , key=" << version_str
1242
1242
<< " , stale dm size=" << _stale_delete_bitmap.size ();
1243
1243
}
1244
1244
@@ -1253,13 +1253,20 @@ void DeleteBitmap::remove_stale_delete_bitmap_from_queue(const std::vector<std::
1253
1253
for (auto & version_str : vector) {
1254
1254
auto it = _stale_delete_bitmap.find (version_str);
1255
1255
if (it != _stale_delete_bitmap.end ()) {
1256
+ LOG (INFO) << " sout: remove_stale_delete_bitmap_from_queue. tablet_id=" << _tablet_id
1257
+ << " , key=" << version_str << " , stale dm size=" << it->second .size ();
1256
1258
for (auto & delete_bitmap_tuple : it->second ) {
1257
1259
// {rowset_id, seg_id, start_version}
1258
1260
if (tablet_id < 0 ) {
1259
1261
tablet_id = std::get<0 >(delete_bitmap_tuple);
1260
1262
}
1261
1263
auto start_bmk = std::get<1 >(delete_bitmap_tuple);
1262
1264
auto end_bmk = std::get<2 >(delete_bitmap_tuple);
1265
+ LOG (INFO) << " sout: remove stale dm, tablet_id=" << tablet_id
1266
+ << " , rowset=" << std::get<0 >(start_bmk).to_string ()
1267
+ << " , seg_id=" << std::get<1 >(start_bmk)
1268
+ << " , start_version=" << std::get<2 >(start_bmk)
1269
+ << " , end_version=" << std::get<2 >(end_bmk);
1263
1270
// the key range of to be removed is [start_bmk,end_bmk),
1264
1271
// due to the different definitions of the right boundary,
1265
1272
// so use end_bmk as right boundary when removing local delete bitmap,
0 commit comments