// Licensed to the Apache Software Foundation (ASF) under one // or more contributor license agreements. See the NOTICE file // distributed with this work for additional information // regarding copyright ownership. The ASF licenses this file // to you under the Apache License, Version 2.0 (the // "License"); you may not use this file except in compliance // with the License. You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, // software distributed under the License is distributed on an // "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY // KIND, either express or implied. See the License for the // specific language governing permissions and limitations // under the License. #include "olap/tablet.h" #include #include #include #include #include #include #include #include #include #include "olap/base_compaction.h" #include "olap/cumulative_compaction.h" #include "olap/olap_common.h" #include "olap/olap_define.h" #include "olap/reader.h" #include "olap/row_cursor.h" #include "olap/rowset/rowset_factory.h" #include "olap/rowset/rowset_meta_manager.h" #include "olap/storage_engine.h" #include "olap/tablet_meta_manager.h" #include "util/path_util.h" #include "util/pretty_printer.h" #include "util/scoped_cleanup.h" #include "util/time.h" #include "util/trace.h" namespace doris { using std::pair; using std::nothrow; using std::sort; using std::string; using std::vector; DEFINE_COUNTER_METRIC_PROTOTYPE_2ARG(flush_bytes, MetricUnit::BYTES); DEFINE_COUNTER_METRIC_PROTOTYPE_2ARG(flush_count, MetricUnit::OPERATIONS); TabletSharedPtr Tablet::create_tablet_from_meta(TabletMetaSharedPtr tablet_meta, DataDir* data_dir) { return std::make_shared(tablet_meta, data_dir); } Tablet::Tablet(TabletMetaSharedPtr tablet_meta, DataDir* data_dir, const std::string& cumulative_compaction_type) : BaseTablet(tablet_meta, data_dir), _is_bad(false), _last_cumu_compaction_failure_millis(0), _last_base_compaction_failure_millis(0), _last_cumu_compaction_success_millis(0), _last_base_compaction_success_millis(0), _cumulative_point(K_INVALID_CUMULATIVE_POINT), _cumulative_compaction_type(cumulative_compaction_type), _last_record_scan_count(0), _last_record_scan_count_timestamp(time(nullptr)), _is_clone_occurred(false) { // construct _timestamped_versioned_tracker from rs and stale rs meta _timestamped_version_tracker.construct_versioned_tracker(_tablet_meta->all_rs_metas(), _tablet_meta->all_stale_rs_metas()); INT_COUNTER_METRIC_REGISTER(_metric_entity, flush_bytes); INT_COUNTER_METRIC_REGISTER(_metric_entity, flush_count); } OLAPStatus Tablet::_init_once_action() { OLAPStatus res = OLAP_SUCCESS; VLOG(3) << "begin to load tablet. tablet=" << full_name() << ", version_size=" << _tablet_meta->version_count(); // init cumulative compaction policy by type _cumulative_compaction_policy = CumulativeCompactionPolicyFactory::create_cumulative_compaction_policy( _cumulative_compaction_type); for (const auto& rs_meta : _tablet_meta->all_rs_metas()) { Version version = rs_meta->version(); RowsetSharedPtr rowset; res = RowsetFactory::create_rowset(&_schema, _tablet_path, rs_meta, &rowset); if (res != OLAP_SUCCESS) { LOG(WARNING) << "fail to init rowset. tablet_id=" << tablet_id() << ", schema_hash=" << schema_hash() << ", version=" << version << ", res=" << res; return res; } _rs_version_map[version] = std::move(rowset); } // init incremental rowset for (auto& inc_rs_meta : _tablet_meta->all_inc_rs_metas()) { Version version = inc_rs_meta->version(); RowsetSharedPtr rowset = get_rowset_by_version(version); if (rowset == nullptr) { res = RowsetFactory::create_rowset(&_schema, _tablet_path, inc_rs_meta, &rowset); if (res != OLAP_SUCCESS) { LOG(WARNING) << "fail to init incremental rowset. tablet_id:" << tablet_id() << ", schema_hash:" << schema_hash() << ", version=" << version << ", res:" << res; return res; } } _inc_rs_version_map[version] = std::move(rowset); } // init stale rowset for (auto& stale_rs_meta : _tablet_meta->all_stale_rs_metas()) { Version version = stale_rs_meta->version(); RowsetSharedPtr rowset; res = RowsetFactory::create_rowset(&_schema, _tablet_path, stale_rs_meta, &rowset); if (res != OLAP_SUCCESS) { LOG(WARNING) << "fail to init stale rowset. tablet_id:" << tablet_id() << ", schema_hash:" << schema_hash() << ", version=" << version << ", res:" << res; return res; } _stale_rs_version_map[version] = std::move(rowset); } return res; } OLAPStatus Tablet::init() { return _init_once.call([this] { return _init_once_action(); }); } // should save tablet meta to remote meta store // if it's a primary replica void Tablet::save_meta() { auto res = _tablet_meta->save_meta(_data_dir); CHECK_EQ(res, OLAP_SUCCESS) << "fail to save tablet_meta. res=" << res << ", root=" << _data_dir->path(); // User could directly update tablet schema by _tablet_meta, // So we need to refetch schema again _schema = _tablet_meta->tablet_schema(); } OLAPStatus Tablet::revise_tablet_meta(const std::vector& rowsets_to_clone, const std::vector& versions_to_delete) { LOG(INFO) << "begin to clone data to tablet. tablet=" << full_name() << ", rowsets_to_clone=" << rowsets_to_clone.size() << ", versions_to_delete_size=" << versions_to_delete.size(); OLAPStatus res = OLAP_SUCCESS; do { // load new local tablet_meta to operate on TabletMetaSharedPtr new_tablet_meta(new (nothrow) TabletMeta()); generate_tablet_meta_copy_unlocked(new_tablet_meta); // delete versions from new local tablet_meta for (const Version& version : versions_to_delete) { new_tablet_meta->delete_rs_meta_by_version(version, nullptr); if (new_tablet_meta->version_for_delete_predicate(version)) { new_tablet_meta->remove_delete_predicate_by_version(version); } LOG(INFO) << "delete version from new local tablet_meta when clone. [table=" << full_name() << ", version=" << version << "]"; } for (auto& rs_meta : rowsets_to_clone) { new_tablet_meta->add_rs_meta(rs_meta); } VLOG(3) << "load rowsets successfully when clone. tablet=" << full_name() << ", added rowset size=" << rowsets_to_clone.size(); // save and reload tablet_meta res = new_tablet_meta->save_meta(_data_dir); if (res != OLAP_SUCCESS) { LOG(WARNING) << "failed to save new local tablet_meta when clone. res:" << res; break; } _tablet_meta = new_tablet_meta; } while (0); for (auto& version : versions_to_delete) { auto it = _rs_version_map.find(version); DCHECK(it != _rs_version_map.end()); StorageEngine::instance()->add_unused_rowset(it->second); _rs_version_map.erase(it); } for (auto& it : _inc_rs_version_map) { StorageEngine::instance()->add_unused_rowset(it.second); } _inc_rs_version_map.clear(); for (auto& rs_meta : rowsets_to_clone) { Version version = {rs_meta->start_version(), rs_meta->end_version()}; RowsetSharedPtr rowset; res = RowsetFactory::create_rowset(&_schema, _tablet_path, rs_meta, &rowset); if (res != OLAP_SUCCESS) { LOG(WARNING) << "fail to init rowset. version=" << version; return res; } _rs_version_map[version] = std::move(rowset); } // reconstruct from tablet meta _timestamped_version_tracker.construct_versioned_tracker(_tablet_meta->all_rs_metas()); LOG(INFO) << "finish to clone data to tablet. res=" << res << ", " << "table=" << full_name() << ", " << "rowsets_to_clone=" << rowsets_to_clone.size(); return res; } OLAPStatus Tablet::add_rowset(RowsetSharedPtr rowset, bool need_persist) { DCHECK(rowset != nullptr); WriteLock wrlock(&_meta_lock); // If the rowset already exist, just return directly. The rowset_id is an unique-id, // we can use it to check this situation. if (_contains_rowset(rowset->rowset_id())) { return OLAP_SUCCESS; } // Otherwise, the version should be not contained in any existing rowset. RETURN_NOT_OK(_contains_version(rowset->version())); RETURN_NOT_OK(_tablet_meta->add_rs_meta(rowset->rowset_meta())); _rs_version_map[rowset->version()] = rowset; _timestamped_version_tracker.add_version(rowset->version()); std::vector rowsets_to_delete; // yiguolei: temp code, should remove the rowset contains by this rowset // but it should be removed in multi path version for (auto& it : _rs_version_map) { if (rowset->version().contains(it.first) && rowset->version() != it.first) { CHECK(it.second != nullptr) << "there exist a version=" << it.first << " contains the input rs with version=" << rowset->version() << ", but the related rs is null"; rowsets_to_delete.push_back(it.second); } } modify_rowsets(std::vector(), rowsets_to_delete); if (need_persist) { RowsetMetaPB rowset_meta_pb; rowset->rowset_meta()->to_rowset_pb(&rowset_meta_pb); OLAPStatus res = RowsetMetaManager::save(data_dir()->get_meta(), tablet_uid(), rowset->rowset_id(), rowset_meta_pb); if (res != OLAP_SUCCESS) { LOG(FATAL) << "failed to save rowset to local meta store" << rowset->rowset_id(); } } ++_newly_created_rowset_num; return OLAP_SUCCESS; } void Tablet::modify_rowsets(const std::vector& to_add, const std::vector& to_delete) { // the compaction process allow to compact the single version, eg: version[4-4]. // this kind of "single version compaction" has same "input version" and "output version". // which means "to_add->version()" equals to "to_delete->version()". // So we should delete the "to_delete" before adding the "to_add", // otherwise, the "to_add" will be deleted from _rs_version_map, eventually. std::vector rs_metas_to_delete; for (auto& rs : to_delete) { rs_metas_to_delete.push_back(rs->rowset_meta()); _rs_version_map.erase(rs->version()); // put compaction rowsets in _stale_rs_version_map. _stale_rs_version_map[rs->version()] = rs; } std::vector rs_metas_to_add; for (auto& rs : to_add) { rs_metas_to_add.push_back(rs->rowset_meta()); _rs_version_map[rs->version()] = rs; _timestamped_version_tracker.add_version(rs->version()); ++_newly_created_rowset_num; } _tablet_meta->modify_rs_metas(rs_metas_to_add, rs_metas_to_delete); // add rs_metas_to_delete to tracker _timestamped_version_tracker.add_stale_path_version(rs_metas_to_delete); } // snapshot manager may call this api to check if version exists, so that // the version maybe not exist const RowsetSharedPtr Tablet::get_rowset_by_version(const Version& version) const { auto iter = _rs_version_map.find(version); if (iter == _rs_version_map.end()) { VLOG(3) << "no rowset for version:" << version << ", tablet: " << full_name(); return nullptr; } return iter->second; } const RowsetSharedPtr Tablet::get_stale_rowset_by_version(const Version& version) const { auto iter = _stale_rs_version_map.find(version); if (iter == _stale_rs_version_map.end()) { VLOG(3) << "no rowset for version:" << version << ", tablet: " << full_name(); return nullptr; } return iter->second; } // This function only be called by SnapshotManager to perform incremental clone. // It will be called under protected of _meta_lock(SnapshotManager will fetch it manually), // so it is no need to lock here. const RowsetSharedPtr Tablet::get_inc_rowset_by_version(const Version& version) const { auto iter = _inc_rs_version_map.find(version); if (iter == _inc_rs_version_map.end()) { VLOG(3) << "no rowset for version:" << version << ", tablet: " << full_name(); return nullptr; } return iter->second; } // Already under _meta_lock const RowsetSharedPtr Tablet::rowset_with_max_version() const { Version max_version = _tablet_meta->max_version(); if (max_version.first == -1) { return nullptr; } auto iter = _rs_version_map.find(max_version); if (iter == _rs_version_map.end()) { DCHECK(false) << "invalid version:" << max_version; return nullptr; } return iter->second; } RowsetSharedPtr Tablet::_rowset_with_largest_size() { RowsetSharedPtr largest_rowset = nullptr; for (auto& it : _rs_version_map) { if (it.second->empty() || it.second->zero_num_rows()) { continue; } if (largest_rowset == nullptr || it.second->rowset_meta()->index_disk_size() > largest_rowset->rowset_meta()->index_disk_size()) { largest_rowset = it.second; } } return largest_rowset; } // add inc rowset should not persist tablet meta, because it will be persisted when publish txn. OLAPStatus Tablet::add_inc_rowset(const RowsetSharedPtr& rowset) { DCHECK(rowset != nullptr); WriteLock wrlock(&_meta_lock); if (_contains_rowset(rowset->rowset_id())) { return OLAP_SUCCESS; } RETURN_NOT_OK(_contains_version(rowset->version())); RETURN_NOT_OK(_tablet_meta->add_rs_meta(rowset->rowset_meta())); _rs_version_map[rowset->version()] = rowset; _inc_rs_version_map[rowset->version()] = rowset; _timestamped_version_tracker.add_version(rowset->version()); RETURN_NOT_OK(_tablet_meta->add_inc_rs_meta(rowset->rowset_meta())); ++_newly_created_rowset_num; return OLAP_SUCCESS; } void Tablet::_delete_inc_rowset_by_version(const Version& version, const VersionHash& version_hash) { // delete incremental rowset from map _inc_rs_version_map.erase(version); RowsetMetaSharedPtr rowset_meta = _tablet_meta->acquire_inc_rs_meta_by_version(version); if (rowset_meta == nullptr) { return; } _tablet_meta->delete_inc_rs_meta_by_version(version); VLOG(3) << "delete incremental rowset. tablet=" << full_name() << ", version=" << version; } void Tablet::_delete_stale_rowset_by_version(const Version& version) { RowsetMetaSharedPtr rowset_meta = _tablet_meta->acquire_stale_rs_meta_by_version(version); if (rowset_meta == nullptr) { return; } _tablet_meta->delete_stale_rs_meta_by_version(version); VLOG(3) << "delete stale rowset. tablet=" << full_name() << ", version=" << version; } void Tablet::delete_expired_inc_rowsets() { int64_t now = UnixSeconds(); std::vector> expired_versions; WriteLock wrlock(&_meta_lock); for (auto& rs_meta : _tablet_meta->all_inc_rs_metas()) { double diff = ::difftime(now, rs_meta->creation_time()); if (diff >= config::inc_rowset_expired_sec) { Version version(rs_meta->version()); expired_versions.push_back(std::make_pair(version, rs_meta->version_hash())); VLOG(3) << "find expire incremental rowset. tablet=" << full_name() << ", version=" << version << ", version_hash=" << rs_meta->version_hash() << ", exist_sec=" << diff; } } if (expired_versions.empty()) { return; } for (auto& pair : expired_versions) { _delete_inc_rowset_by_version(pair.first, pair.second); VLOG(3) << "delete expire incremental data. tablet=" << full_name() << ", version=" << pair.first; } save_meta(); } void Tablet::delete_expired_stale_rowset() { int64_t now = UnixSeconds(); std::vector> expired_versions; WriteLock wrlock(&_meta_lock); // Compute the end time to delete rowsets, when a expired rowset createtime less then this time, it will be deleted. double expired_stale_sweep_endtime = ::difftime(now, config::tablet_rowset_stale_sweep_time_sec); std::vector path_id_vec; // capture the path version to delete _timestamped_version_tracker.capture_expired_paths( static_cast(expired_stale_sweep_endtime), &path_id_vec); if (path_id_vec.empty()) { return; } const RowsetSharedPtr lastest_delta = rowset_with_max_version(); if (lastest_delta == nullptr) { LOG(WARNING) << "lastest_delta is null " << tablet_id(); return; } // fetch missing version before delete std::vector missed_versions; calc_missed_versions_unlocked(lastest_delta->end_version(), &missed_versions); if (!missed_versions.empty()) { LOG(WARNING) << "tablet:" << full_name() << ", missed version for version:" << lastest_delta->end_version(); _print_missed_versions(missed_versions); return; } // do check consistent operation auto path_id_iter = path_id_vec.begin(); std::map stale_version_path_map; while (path_id_iter != path_id_vec.end()) { PathVersionListSharedPtr version_path = _timestamped_version_tracker.fetch_and_delete_path_by_id(*path_id_iter); Version test_version = Version(0, lastest_delta->end_version()); stale_version_path_map[*path_id_iter] = version_path; OLAPStatus status = capture_consistent_versions(test_version, nullptr); // 1. When there is no consistent versions, we must reconstruct the tracker. if (status != OLAP_SUCCESS) { // 2. fetch missing version after delete std::vector after_missed_versions; calc_missed_versions_unlocked(lastest_delta->end_version(), &after_missed_versions); // 2.1 check whether missed_versions and after_missed_versions are the same. // when they are the same, it means we can delete the path securely. bool is_missing = missed_versions.size() != after_missed_versions.size(); if (!is_missing) { for (int ver_index = 0; ver_index < missed_versions.size(); ver_index++) { if (missed_versions[ver_index] != after_missed_versions[ver_index]) { is_missing = true; break; } } } if (is_missing) { LOG(WARNING) << "The consistent version check fails, there are bugs. " << "Reconstruct the tracker to recover versions in tablet=" << tablet_id(); // 3. try to recover _timestamped_version_tracker.recover_versioned_tracker(stale_version_path_map); // 4. double check the consistent versions // fetch missing version after recover std::vector recover_missed_versions; calc_missed_versions_unlocked(lastest_delta->end_version(), &recover_missed_versions); // 4.1 check whether missed_versions and recover_missed_versions are the same. // when they are the same, it means we recover successfully. bool is_recover_missing = missed_versions.size() != recover_missed_versions.size(); if (!is_recover_missing) { for (int ver_index = 0; ver_index < missed_versions.size(); ver_index++) { if (missed_versions[ver_index] != recover_missed_versions[ver_index]) { is_recover_missing = true; break; } } } // 5. check recover fail, version is mission if (is_recover_missing) { if (!config::ignore_rowset_stale_unconsistent_delete) { LOG(FATAL) << "rowset stale unconsistent delete. tablet= " << tablet_id(); } else { LOG(WARNING) << "rowset stale unconsistent delete. tablet= " << tablet_id(); } } } return; } path_id_iter++; } auto old_size = _stale_rs_version_map.size(); auto old_meta_size = _tablet_meta->all_stale_rs_metas().size(); // do delete operation auto to_delete_iter = stale_version_path_map.begin(); while (to_delete_iter != stale_version_path_map.end()) { std::vector& to_delete_version = to_delete_iter->second->timestamped_versions(); for (auto& timestampedVersion : to_delete_version) { auto it = _stale_rs_version_map.find(timestampedVersion->version()); if (it != _stale_rs_version_map.end()) { // delete rowset StorageEngine::instance()->add_unused_rowset(it->second); _stale_rs_version_map.erase(it); LOG(INFO) << "delete stale rowset tablet=" << full_name() << " version[" << timestampedVersion->version().first << "," << timestampedVersion->version().second << "] move to unused_rowset success " << std::fixed << expired_stale_sweep_endtime; } else { LOG(WARNING) << "delete stale rowset tablet=" << full_name() << " version[" << timestampedVersion->version().first << "," << timestampedVersion->version().second << "] not find in stale rs version map"; } _delete_stale_rowset_by_version(timestampedVersion->version()); } to_delete_iter++; } LOG(INFO) << "delete stale rowset _stale_rs_version_map tablet=" << full_name() << " current_size=" << _stale_rs_version_map.size() << " old_size=" << old_size << " current_meta_size=" << _tablet_meta->all_stale_rs_metas().size() << " old_meta_size=" << old_meta_size << " sweep endtime " << std::fixed << expired_stale_sweep_endtime; #ifndef BE_TEST save_meta(); #endif } OLAPStatus Tablet::capture_consistent_versions(const Version& spec_version, std::vector* version_path) const { // OLAPStatus status = _rs_graph.capture_consistent_versions(spec_version, version_path); OLAPStatus status = _timestamped_version_tracker.capture_consistent_versions(spec_version, version_path); if (status != OLAP_SUCCESS) { std::vector missed_versions; calc_missed_versions_unlocked(spec_version.second, &missed_versions); if (missed_versions.empty()) { LOG(WARNING) << "tablet:" << full_name() << ", version already has been merged. spec_version: " << spec_version; status = OLAP_ERR_VERSION_ALREADY_MERGED; } else { LOG(WARNING) << "status:" << status << ", tablet:" << full_name() << ", missed version for version:" << spec_version; _print_missed_versions(missed_versions); } } return status; } OLAPStatus Tablet::check_version_integrity(const Version& version) { ReadLock rdlock(&_meta_lock); return capture_consistent_versions(version, nullptr); } // If any rowset contains the specific version, it means the version already exist bool Tablet::check_version_exist(const Version& version) const { for (auto& it : _rs_version_map) { if (it.first.contains(version)) { return true; } } return false; } void Tablet::list_versions(vector* versions) const { DCHECK(versions != nullptr && versions->empty()); versions->reserve(_rs_version_map.size()); // versions vector is not sorted. for (const auto& it : _rs_version_map) { versions->push_back(it.first); } } OLAPStatus Tablet::capture_consistent_rowsets(const Version& spec_version, std::vector* rowsets) const { std::vector version_path; RETURN_NOT_OK(capture_consistent_versions(spec_version, &version_path)); RETURN_NOT_OK(_capture_consistent_rowsets_unlocked(version_path, rowsets)); return OLAP_SUCCESS; } OLAPStatus Tablet::_capture_consistent_rowsets_unlocked( const std::vector& version_path, std::vector* rowsets) const { DCHECK(rowsets != nullptr && rowsets->empty()); rowsets->reserve(version_path.size()); for (auto& version : version_path) { bool is_find = false; do { auto it = _rs_version_map.find(version); if (it != _rs_version_map.end()) { is_find = true; rowsets->push_back(it->second); break; } auto it_expired = _stale_rs_version_map.find(version); if (it_expired != _stale_rs_version_map.end()) { is_find = true; rowsets->push_back(it_expired->second); break; } } while (0); if (!is_find) { LOG(WARNING) << "fail to find Rowset for version. tablet=" << full_name() << ", version='" << version; return OLAP_ERR_CAPTURE_ROWSET_ERROR; } } return OLAP_SUCCESS; } OLAPStatus Tablet::capture_rs_readers(const Version& spec_version, std::vector* rs_readers) const { std::vector version_path; RETURN_NOT_OK(capture_consistent_versions(spec_version, &version_path)); RETURN_NOT_OK(capture_rs_readers(version_path, rs_readers)); return OLAP_SUCCESS; } OLAPStatus Tablet::capture_rs_readers(const std::vector& version_path, std::vector* rs_readers) const { DCHECK(rs_readers != nullptr && rs_readers->empty()); for (auto version : version_path) { auto it = _rs_version_map.find(version); if (it == _rs_version_map.end()) { VLOG(3) << "fail to find Rowset in rs_version for version. tablet=" << full_name() << ", version='" << version.first << "-" << version.second; it = _stale_rs_version_map.find(version); if (it == _rs_version_map.end()) { LOG(WARNING) << "fail to find Rowset in stale_rs_version for version. tablet=" << full_name() << ", version='" << version.first << "-" << version.second; return OLAP_ERR_CAPTURE_ROWSET_READER_ERROR; } } RowsetReaderSharedPtr rs_reader; auto res = it->second->create_reader(&rs_reader); if (res != OLAP_SUCCESS) { LOG(WARNING) << "failed to create reader for rowset:" << it->second->rowset_id(); return OLAP_ERR_CAPTURE_ROWSET_READER_ERROR; } rs_readers->push_back(std::move(rs_reader)); } return OLAP_SUCCESS; } void Tablet::add_delete_predicate(const DeletePredicatePB& delete_predicate, int64_t version) { _tablet_meta->add_delete_predicate(delete_predicate, version); } // TODO(lingbin): what is the difference between version_for_delete_predicate() and // version_for_load_deletion()? should at least leave a comment bool Tablet::version_for_delete_predicate(const Version& version) { return _tablet_meta->version_for_delete_predicate(version); } bool Tablet::version_for_load_deletion(const Version& version) { RowsetSharedPtr rowset = _rs_version_map.at(version); return rowset->delete_flag(); } AlterTabletTaskSharedPtr Tablet::alter_task() { return _tablet_meta->alter_task(); } void Tablet::add_alter_task(int64_t related_tablet_id, int32_t related_schema_hash, const std::vector& versions_to_alter, const AlterTabletType alter_type) { AlterTabletTask alter_task; alter_task.set_alter_state(ALTER_RUNNING); alter_task.set_related_tablet_id(related_tablet_id); alter_task.set_related_schema_hash(related_schema_hash); alter_task.set_alter_type(alter_type); _tablet_meta->add_alter_task(alter_task); LOG(INFO) << "successfully add alter task for tablet_id:" << this->tablet_id() << ", schema_hash:" << this->schema_hash() << ", related_tablet_id " << related_tablet_id << ", related_schema_hash " << related_schema_hash << ", alter_type " << alter_type; } void Tablet::delete_alter_task() { LOG(INFO) << "delete alter task from table. tablet=" << full_name(); _tablet_meta->delete_alter_task(); } OLAPStatus Tablet::set_alter_state(AlterTabletState state) { return _tablet_meta->set_alter_state(state); } bool Tablet::can_do_compaction() { // 如果table正在做schema change,则通过选路判断数据是否转换完成 // 如果选路成功,则转换完成,可以进行compaction // 如果选路失败,则转换未完成,不能进行compaction ReadLock rdlock(&_meta_lock); const RowsetSharedPtr lastest_delta = rowset_with_max_version(); if (lastest_delta == nullptr) { return false; } Version test_version = Version(0, lastest_delta->end_version()); if (OLAP_SUCCESS != capture_consistent_versions(test_version, nullptr)) { return false; } return true; } const uint32_t Tablet::calc_compaction_score(CompactionType compaction_type) const { // Need meta lock, because it will iterator "all_rs_metas" of tablet meta. ReadLock rdlock(&_meta_lock); if (compaction_type == CompactionType::CUMULATIVE_COMPACTION) { return _calc_cumulative_compaction_score(); } else { DCHECK_EQ(compaction_type, CompactionType::BASE_COMPACTION); return _calc_base_compaction_score(); } } const uint32_t Tablet::_calc_cumulative_compaction_score() const { uint32_t score = 0; _cumulative_compaction_policy->calc_cumulative_compaction_score( _tablet_meta->all_rs_metas(), cumulative_layer_point(), &score); return score; } const uint32_t Tablet::_calc_base_compaction_score() const { uint32_t score = 0; const int64_t point = cumulative_layer_point(); bool base_rowset_exist = false; for (auto& rs_meta : _tablet_meta->all_rs_metas()) { if (rs_meta->start_version() == 0) { base_rowset_exist = true; } if (rs_meta->start_version() >= point) { // all_rs_metas() is not sorted, so we use _continue_ other than _break_ here. continue; } score += rs_meta->get_compaction_score(); } // base不存在可能是tablet正在做alter table,先不选它,设score=0 return base_rowset_exist ? score : 0; } void Tablet::compute_version_hash_from_rowsets(const std::vector& rowsets, VersionHash* version_hash) { DCHECK(version_hash != nullptr) << "invalid parameter, version_hash is nullptr"; int64_t v_hash = 0; // version hash is useless since Doris version 0.11 // but for compatibility, we set version hash as the last rowset's version hash. // this can also enable us to do the compaction for last one rowset. v_hash = rowsets.back()->version_hash(); *version_hash = v_hash; } void Tablet::calc_missed_versions(int64_t spec_version, std::vector* missed_versions) { ReadLock rdlock(&_meta_lock); calc_missed_versions_unlocked(spec_version, missed_versions); } // TODO(lingbin): there may be a bug here, should check it. // for example: // [0-4][5-5][8-8][9-9] // if spec_version = 6, we still return {6, 7} other than {7} void Tablet::calc_missed_versions_unlocked(int64_t spec_version, std::vector* missed_versions) const { DCHECK(spec_version > 0) << "invalid spec_version: " << spec_version; std::list existing_versions; for (auto& rs : _tablet_meta->all_rs_metas()) { existing_versions.emplace_back(rs->version()); } // sort the existing versions in ascending order existing_versions.sort([](const Version& a, const Version& b) { // simple because 2 versions are certainly not overlapping return a.first < b.first; }); // From the first version(=0), find the missing version until spec_version int64_t last_version = -1; for (const Version& version : existing_versions) { if (version.first > last_version + 1) { for (int64_t i = last_version + 1; i < version.first; ++i) { missed_versions->emplace_back(Version(i, i)); } } last_version = version.second; if (last_version >= spec_version) { break; } } for (int64_t i = last_version + 1; i <= spec_version; ++i) { missed_versions->emplace_back(Version(i, i)); } } void Tablet::max_continuous_version_from_beginning(Version* version, VersionHash* v_hash) { ReadLock rdlock(&_meta_lock); _max_continuous_version_from_beginning_unlocked(version, v_hash); } void Tablet::_max_continuous_version_from_beginning_unlocked(Version* version, VersionHash* v_hash) const { std::vector> existing_versions; for (auto& rs : _tablet_meta->all_rs_metas()) { existing_versions.emplace_back(rs->version(), rs->version_hash()); } // sort the existing versions in ascending order std::sort(existing_versions.begin(), existing_versions.end(), [](const pair& left, const pair& right) { // simple because 2 versions are certainly not overlapping return left.first.first < right.first.first; }); Version max_continuous_version = {-1, 0}; VersionHash max_continuous_version_hash = 0; for (int i = 0; i < existing_versions.size(); ++i) { if (existing_versions[i].first.first > max_continuous_version.second + 1) { break; } max_continuous_version = existing_versions[i].first; max_continuous_version_hash = existing_versions[i].second; } *version = max_continuous_version; *v_hash = max_continuous_version_hash; } void Tablet::calculate_cumulative_point() { WriteLock wrlock(&_meta_lock); int64_t ret_cumulative_point; _cumulative_compaction_policy->calculate_cumulative_point( this, _tablet_meta->all_rs_metas(), _cumulative_point, &ret_cumulative_point); if (ret_cumulative_point == K_INVALID_CUMULATIVE_POINT) { return; } _cumulative_point = ret_cumulative_point; } OLAPStatus Tablet::split_range(const OlapTuple& start_key_strings, const OlapTuple& end_key_strings, uint64_t request_block_row_count, std::vector* ranges) { DCHECK(ranges != nullptr); RowCursor start_key; // 如果有startkey,用startkey初始化;反之则用minkey初始化 if (start_key_strings.size() > 0) { if (start_key.init_scan_key(_schema, start_key_strings.values()) != OLAP_SUCCESS) { LOG(WARNING) << "fail to initial key strings with RowCursor type."; return OLAP_ERR_INIT_FAILED; } if (start_key.from_tuple(start_key_strings) != OLAP_SUCCESS) { LOG(WARNING) << "init end key failed"; return OLAP_ERR_INVALID_SCHEMA; } } else { if (start_key.init(_schema, num_short_key_columns()) != OLAP_SUCCESS) { LOG(WARNING) << "fail to initial key strings with RowCursor type."; return OLAP_ERR_INIT_FAILED; } start_key.allocate_memory_for_string_type(_schema); start_key.build_min_key(); } RowCursor end_key; // 和startkey一样处理,没有则用maxkey初始化 if (end_key_strings.size() > 0) { if (OLAP_SUCCESS != end_key.init_scan_key(_schema, end_key_strings.values())) { LOG(WARNING) << "fail to parse strings to key with RowCursor type."; return OLAP_ERR_INVALID_SCHEMA; } if (end_key.from_tuple(end_key_strings) != OLAP_SUCCESS) { LOG(WARNING) << "init end key failed"; return OLAP_ERR_INVALID_SCHEMA; } } else { if (end_key.init(_schema, num_short_key_columns()) != OLAP_SUCCESS) { LOG(WARNING) << "fail to initial key strings with RowCursor type."; return OLAP_ERR_INIT_FAILED; } end_key.allocate_memory_for_string_type(_schema); end_key.build_max_key(); } ReadLock rdlock(&_meta_lock); RowsetSharedPtr rowset = _rowset_with_largest_size(); // 如果找不到合适的rowset,就直接返回startkey,endkey if (rowset == nullptr) { VLOG(3) << "there is no base file now, may be tablet is empty."; // it may be right if the tablet is empty, so we return success. ranges->emplace_back(start_key.to_tuple()); ranges->emplace_back(end_key.to_tuple()); return OLAP_SUCCESS; } return rowset->split_range(start_key, end_key, request_block_row_count, ranges); } // NOTE: only used when create_table, so it is sure that there is no concurrent reader and writer. void Tablet::delete_all_files() { // Release resources like memory and disk space. // we have to call list_versions first, or else error occurs when // removing hash_map item and iterating hash_map concurrently. ReadLock rdlock(&_meta_lock); for (auto it : _rs_version_map) { it.second->remove(); } _rs_version_map.clear(); for (auto it : _inc_rs_version_map) { it.second->remove(); } _inc_rs_version_map.clear(); _stale_rs_version_map.clear(); } bool Tablet::check_path(const std::string& path_to_check) const { ReadLock rdlock(&_meta_lock); if (path_to_check == _tablet_path) { return true; } std::string tablet_id_dir = path_util::dir_name(_tablet_path); if (path_to_check == tablet_id_dir) { return true; } for (auto& version_rowset : _rs_version_map) { bool ret = version_rowset.second->check_path(path_to_check); if (ret) { return true; } } for (auto& inc_version_rowset : _inc_rs_version_map) { bool ret = inc_version_rowset.second->check_path(path_to_check); if (ret) { return true; } } for (auto& stale_version_rowset : _stale_rs_version_map) { bool ret = stale_version_rowset.second->check_path(path_to_check); if (ret) { return true; } } return false; } // check rowset id in tablet-meta and in rowset-meta atomicly // for example, during publish version stage, it will first add rowset meta to tablet meta and then // remove it from rowset meta manager. If we check tablet meta first and then check rowset meta using 2 step unlocked // the sequence maybe: 1. check in tablet meta [return false] 2. add to tablet meta 3. remove from rowset meta manager // 4. check in rowset meta manager return false. so that the rowset maybe checked return false it means it is useless and // will be treated as a garbage. bool Tablet::check_rowset_id(const RowsetId& rowset_id) { ReadLock rdlock(&_meta_lock); if (StorageEngine::instance()->rowset_id_in_use(rowset_id)) { return true; } for (auto& version_rowset : _rs_version_map) { if (version_rowset.second->rowset_id() == rowset_id) { return true; } } for (auto& inc_version_rowset : _inc_rs_version_map) { if (inc_version_rowset.second->rowset_id() == rowset_id) { return true; } } for (auto& stale_version_rowset : _stale_rs_version_map) { if (stale_version_rowset.second->rowset_id() == rowset_id) { return true; } } if (RowsetMetaManager::check_rowset_meta(_data_dir->get_meta(), tablet_uid(), rowset_id)) { return true; } return false; } void Tablet::_print_missed_versions(const std::vector& missed_versions) const { std::stringstream ss; ss << full_name() << " has " << missed_versions.size() << " missed version:"; // print at most 10 version for (int i = 0; i < 10 && i < missed_versions.size(); ++i) { ss << missed_versions[i] << ","; } LOG(WARNING) << ss.str(); } OLAPStatus Tablet::_contains_version(const Version& version) { // check if there exist a rowset contains the added rowset for (auto& it : _rs_version_map) { if (it.first.contains(version)) { // TODO(lingbin): Is this check unnecessary? // because the value type is std::shared_ptr, when will it be nullptr? // In addition, in this class, there are many places that do not make this judgment // when access _rs_version_map's value. CHECK(it.second != nullptr) << "there exist a version=" << it.first << " contains the input rs with version=" << version << ", but the related rs is null"; return OLAP_ERR_PUSH_VERSION_ALREADY_EXIST; } } return OLAP_SUCCESS; } OLAPStatus Tablet::set_partition_id(int64_t partition_id) { return _tablet_meta->set_partition_id(partition_id); } TabletInfo Tablet::get_tablet_info() const { return TabletInfo(tablet_id(), schema_hash(), tablet_uid()); } void Tablet::pick_candidate_rowsets_to_cumulative_compaction( int64_t skip_window_sec, std::vector* candidate_rowsets) { ReadLock rdlock(&_meta_lock); _cumulative_compaction_policy->pick_candidate_rowsets(skip_window_sec, _rs_version_map, _cumulative_point, candidate_rowsets); } void Tablet::pick_candidate_rowsets_to_base_compaction(vector* candidate_rowsets) { ReadLock rdlock(&_meta_lock); for (auto& it : _rs_version_map) { if (it.first.first < _cumulative_point) { candidate_rowsets->push_back(it.second); } } } // For http compaction action void Tablet::get_compaction_status(std::string* json_result) { rapidjson::Document root; root.SetObject(); rapidjson::Document path_arr; path_arr.SetArray(); std::vector rowsets; std::vector delete_flags; { ReadLock rdlock(&_meta_lock); rowsets.reserve(_rs_version_map.size()); for (auto& it : _rs_version_map) { rowsets.push_back(it.second); } std::sort(rowsets.begin(), rowsets.end(), Rowset::comparator); delete_flags.reserve(rowsets.size()); for (auto& rs : rowsets) { delete_flags.push_back(version_for_delete_predicate(rs->version())); } // get snapshot version path json_doc _timestamped_version_tracker.get_stale_version_path_json_doc(path_arr); } rapidjson::Value cumulative_policy_type; std::string policy_type_str = _cumulative_compaction_policy->name(); cumulative_policy_type.SetString(policy_type_str.c_str(), policy_type_str.length(), root.GetAllocator()); root.AddMember("cumulative policy type", cumulative_policy_type, root.GetAllocator()); root.AddMember("cumulative point", _cumulative_point.load(), root.GetAllocator()); rapidjson::Value cumu_value; std::string format_str = ToStringFromUnixMillis(_last_cumu_compaction_failure_millis.load()); cumu_value.SetString(format_str.c_str(), format_str.length(), root.GetAllocator()); root.AddMember("last cumulative failure time", cumu_value, root.GetAllocator()); rapidjson::Value base_value; format_str = ToStringFromUnixMillis(_last_base_compaction_failure_millis.load()); base_value.SetString(format_str.c_str(), format_str.length(), root.GetAllocator()); root.AddMember("last base failure time", base_value, root.GetAllocator()); rapidjson::Value cumu_success_value; format_str = ToStringFromUnixMillis(_last_cumu_compaction_success_millis.load()); cumu_success_value.SetString(format_str.c_str(), format_str.length(), root.GetAllocator()); root.AddMember("last cumulative success time", cumu_success_value, root.GetAllocator()); rapidjson::Value base_success_value; format_str = ToStringFromUnixMillis(_last_base_compaction_success_millis.load()); base_success_value.SetString(format_str.c_str(), format_str.length(), root.GetAllocator()); root.AddMember("last base success time", base_success_value, root.GetAllocator()); // print all rowsets' version as an array rapidjson::Document versions_arr; versions_arr.SetArray(); for (int i = 0; i < rowsets.size(); ++i) { const Version& ver = rowsets[i]->version(); rapidjson::Value value; std::string disk_size = PrettyPrinter::print(rowsets[i]->rowset_meta()->total_disk_size(), TUnit::BYTES); std::string version_str = strings::Substitute( "[$0-$1] $2 $3 $4 $5", ver.first, ver.second, rowsets[i]->num_segments(), (delete_flags[i] ? "DELETE" : "DATA"), SegmentsOverlapPB_Name(rowsets[i]->rowset_meta()->segments_overlap()), disk_size); value.SetString(version_str.c_str(), version_str.length(), versions_arr.GetAllocator()); versions_arr.PushBack(value, versions_arr.GetAllocator()); } root.AddMember("rowsets", versions_arr, root.GetAllocator()); // add stale version rowsets root.AddMember("stale version path", path_arr, root.GetAllocator()); // to json string rapidjson::StringBuffer strbuf; rapidjson::PrettyWriter writer(strbuf); root.Accept(writer); *json_result = std::string(strbuf.GetString()); } void Tablet::do_tablet_meta_checkpoint() { WriteLock store_lock(&_meta_store_lock); if (_newly_created_rowset_num == 0) { return; } if (UnixMillis() - _last_checkpoint_time < config::tablet_meta_checkpoint_min_interval_secs * 1000 && _newly_created_rowset_num < config::tablet_meta_checkpoint_min_new_rowsets_num) { return; } // hold read-lock other than write-lock, because it will not modify meta structure ReadLock rdlock(&_meta_lock); if (tablet_state() != TABLET_RUNNING) { LOG(INFO) << "tablet is under state=" << tablet_state() << ", not running, skip do checkpoint" << ", tablet=" << full_name(); return; } LOG(INFO) << "start to do tablet meta checkpoint, tablet=" << full_name(); save_meta(); // if save meta successfully, then should remove the rowset meta existing in tablet // meta from rowset meta store for (auto& rs_meta : _tablet_meta->all_rs_metas()) { // If we delete it from rowset manager's meta explicitly in previous checkpoint, just skip. if (rs_meta->is_remove_from_rowset_meta()) { continue; } if (RowsetMetaManager::check_rowset_meta(_data_dir->get_meta(), tablet_uid(), rs_meta->rowset_id())) { RowsetMetaManager::remove(_data_dir->get_meta(), tablet_uid(), rs_meta->rowset_id()); LOG(INFO) << "remove rowset id from meta store because it is already persistent with " "tablet meta" << ", rowset_id=" << rs_meta->rowset_id(); } rs_meta->set_remove_from_rowset_meta(); } // check _stale_rs_version_map to remove meta from rowset meta store for (auto& rs_meta : _tablet_meta->all_stale_rs_metas()) { // If we delete it from rowset manager's meta explicitly in previous checkpoint, just skip. if (rs_meta->is_remove_from_rowset_meta()) { continue; } if (RowsetMetaManager::check_rowset_meta(_data_dir->get_meta(), tablet_uid(), rs_meta->rowset_id())) { RowsetMetaManager::remove(_data_dir->get_meta(), tablet_uid(), rs_meta->rowset_id()); LOG(INFO) << "remove rowset id from meta store because it is already persistent with " "tablet meta" << ", rowset_id=" << rs_meta->rowset_id(); } rs_meta->set_remove_from_rowset_meta(); } _newly_created_rowset_num = 0; _last_checkpoint_time = UnixMillis(); } bool Tablet::rowset_meta_is_useful(RowsetMetaSharedPtr rowset_meta) { ReadLock rdlock(&_meta_lock); bool find_version = false; for (auto& version_rowset : _rs_version_map) { if (version_rowset.second->rowset_id() == rowset_meta->rowset_id()) { return true; } if (version_rowset.second->contains_version(rowset_meta->version())) { find_version = true; } } for (auto& inc_version_rowset : _inc_rs_version_map) { if (inc_version_rowset.second->rowset_id() == rowset_meta->rowset_id()) { return true; } if (inc_version_rowset.second->contains_version(rowset_meta->version())) { find_version = true; } } for (auto& stale_version_rowset : _stale_rs_version_map) { if (stale_version_rowset.second->rowset_id() == rowset_meta->rowset_id()) { return true; } if (stale_version_rowset.second->contains_version(rowset_meta->version())) { find_version = true; } } return !find_version; } bool Tablet::_contains_rowset(const RowsetId rowset_id) { for (auto& version_rowset : _rs_version_map) { if (version_rowset.second->rowset_id() == rowset_id) { return true; } } for (auto& inc_version_rowset : _inc_rs_version_map) { if (inc_version_rowset.second->rowset_id() == rowset_id) { return true; } } return false; } void Tablet::build_tablet_report_info(TTabletInfo* tablet_info) { ReadLock rdlock(&_meta_lock); tablet_info->tablet_id = _tablet_meta->tablet_id(); tablet_info->schema_hash = _tablet_meta->schema_hash(); tablet_info->row_count = _tablet_meta->num_rows(); tablet_info->data_size = _tablet_meta->tablet_footprint(); Version version = {-1, 0}; VersionHash v_hash = 0; _max_continuous_version_from_beginning_unlocked(&version, &v_hash); auto max_rowset = rowset_with_max_version(); if (max_rowset != nullptr) { if (max_rowset->version() != version) { tablet_info->__set_version_miss(true); } } else { // If the tablet is in running state, it must not be doing schema-change. so if we can not // access its rowsets, it means that the tablet is bad and needs to be reported to the FE // for subsequent repairs (through the cloning task) if (tablet_state() == TABLET_RUNNING) { tablet_info->__set_used(false); } // For other states, FE knows that the tablet is in a certain change process, so here // still sets the state to normal when reporting. Note that every task has an timeout, // so if the task corresponding to this change hangs, when the task timeout, FE will know // and perform state modification operations. } tablet_info->version = version.second; tablet_info->version_hash = v_hash; tablet_info->__set_partition_id(_tablet_meta->partition_id()); tablet_info->__set_storage_medium(_data_dir->storage_medium()); tablet_info->__set_version_count(_tablet_meta->version_count()); tablet_info->__set_path_hash(_data_dir->path_hash()); tablet_info->__set_is_in_memory(_tablet_meta->tablet_schema().is_in_memory()); } // should use this method to get a copy of current tablet meta // there are some rowset meta in local meta store and in in-memory tablet meta // but not in tablet meta in local meta store void Tablet::generate_tablet_meta_copy(TabletMetaSharedPtr new_tablet_meta) const { TabletMetaPB tablet_meta_pb; { ReadLock rdlock(&_meta_lock); _tablet_meta->to_meta_pb(&tablet_meta_pb); } new_tablet_meta->init_from_pb(tablet_meta_pb); } // this is a unlocked version of generate_tablet_meta_copy() // some method already hold the _meta_lock before calling this, // such as EngineCloneTask::_finish_clone -> tablet->revise_tablet_meta void Tablet::generate_tablet_meta_copy_unlocked(TabletMetaSharedPtr new_tablet_meta) const { TabletMetaPB tablet_meta_pb; _tablet_meta->to_meta_pb(&tablet_meta_pb); new_tablet_meta->init_from_pb(tablet_meta_pb); } double Tablet::calculate_scan_frequency() { time_t now = time(nullptr); int64_t current_count = query_scan_count->value(); double interval = difftime(now, _last_record_scan_count_timestamp); double scan_frequency = (current_count - _last_record_scan_count) * 60 / interval; if (interval >= config::tablet_scan_frequency_time_node_interval_second) { _last_record_scan_count = current_count; _last_record_scan_count_timestamp = now; } return scan_frequency; } int64_t Tablet::prepare_compaction_and_calculate_permits(CompactionType compaction_type, TabletSharedPtr tablet) { std::vector compaction_rowsets; if (compaction_type == CompactionType::CUMULATIVE_COMPACTION) { scoped_refptr trace(new Trace); MonotonicStopWatch watch; watch.start(); SCOPED_CLEANUP({ if (watch.elapsed_time() / 1e9 > config::cumulative_compaction_trace_threshold) { LOG(WARNING) << "Trace:" << std::endl << trace->DumpToString(Trace::INCLUDE_ALL); } }); ADOPT_TRACE(trace.get()); TRACE("create cumulative compaction"); StorageEngine::instance()->create_cumulative_compaction(tablet, _cumulative_compaction); DorisMetrics::instance()->cumulative_compaction_request_total->increment(1); OLAPStatus res = _cumulative_compaction->prepare_compact(); if (res != OLAP_SUCCESS) { return 0; } compaction_rowsets = _cumulative_compaction->get_input_rowsets(); } else { DCHECK_EQ(compaction_type, CompactionType::BASE_COMPACTION); scoped_refptr trace(new Trace); MonotonicStopWatch watch; watch.start(); SCOPED_CLEANUP({ if (watch.elapsed_time() / 1e9 > config::base_compaction_trace_threshold) { LOG(WARNING) << "Trace:" << std::endl << trace->DumpToString(Trace::INCLUDE_ALL); } }); ADOPT_TRACE(trace.get()); TRACE("create base compaction"); StorageEngine::instance()->create_base_compaction(tablet, _base_compaction); DorisMetrics::instance()->base_compaction_request_total->increment(1); OLAPStatus res = _base_compaction->prepare_compact(); if (res != OLAP_SUCCESS) { set_last_base_compaction_failure_time(UnixMillis()); DorisMetrics::instance()->base_compaction_request_failed->increment(1); if (res != OLAP_ERR_BE_NO_SUITABLE_VERSION) { LOG(WARNING) << "failed to pick rowsets for base compaction. res=" << res << ", tablet=" << full_name(); } return 0; } compaction_rowsets = _base_compaction->get_input_rowsets(); } int64_t permits = 0; for (auto rowset : compaction_rowsets) { permits += rowset->rowset_meta()->get_compaction_score(); } return permits; } void Tablet::execute_compaction(CompactionType compaction_type) { if (compaction_type == CompactionType::CUMULATIVE_COMPACTION) { scoped_refptr trace(new Trace); MonotonicStopWatch watch; watch.start(); SCOPED_CLEANUP({ if (watch.elapsed_time() / 1e9 > config::cumulative_compaction_trace_threshold) { LOG(WARNING) << "Trace:" << std::endl << trace->DumpToString(Trace::INCLUDE_ALL); } }); ADOPT_TRACE(trace.get()); TRACE("execute cumulative compaction"); OLAPStatus res = _cumulative_compaction->execute_compact(); if (res != OLAP_SUCCESS) { set_last_cumu_compaction_failure_time(UnixMillis()); DorisMetrics::instance()->cumulative_compaction_request_failed->increment(1); LOG(WARNING) << "failed to do cumulative compaction. res=" << res << ", tablet=" << full_name(); return; } set_last_cumu_compaction_failure_time(0); } else { DCHECK_EQ(compaction_type, CompactionType::BASE_COMPACTION); scoped_refptr trace(new Trace); MonotonicStopWatch watch; watch.start(); SCOPED_CLEANUP({ if (watch.elapsed_time() / 1e9 > config::base_compaction_trace_threshold) { LOG(WARNING) << "Trace:" << std::endl << trace->DumpToString(Trace::INCLUDE_ALL); } }); ADOPT_TRACE(trace.get()); TRACE("create base compaction"); OLAPStatus res = _base_compaction->execute_compact(); if (res != OLAP_SUCCESS) { set_last_base_compaction_failure_time(UnixMillis()); DorisMetrics::instance()->base_compaction_request_failed->increment(1); LOG(WARNING) << "failed to do base compaction. res=" << res << ", tablet=" << full_name(); return; } set_last_base_compaction_failure_time(0); } } } // namespace doris