blob: 1502016e18f4ea6d28d69e701cc6089de3929403 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
// Copyright 2023 Huawei Cloud Computing Technology Co., Ltd.
//
// Licensed 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 "src/buildtool/execution_api/execution_service/operation_cache.hpp"
#include <algorithm>
#include "google/protobuf/timestamp.pb.h"
void OperationCache::GarbageCollection() {
if (cache_.size() > (threshold_ << 1U)) {
std::vector<std::pair<std::string, ::google::longrunning::Operation>>
tmp;
tmp.reserve(cache_.size());
std::copy(cache_.begin(), cache_.end(), std::back_insert_iterator(tmp));
std::sort(tmp.begin(), tmp.end(), [](auto const& x, auto const& y) {
::google::protobuf::Timestamp tx;
::google::protobuf::Timestamp ty;
x.second.metadata().UnpackTo(&tx);
y.second.metadata().UnpackTo(&ty);
return tx.seconds() < ty.seconds();
});
std::size_t deleted = 0;
for (auto const& [key, op] : tmp) {
if (op.done()) {
DropInternal(key);
++deleted;
}
if (deleted == threshold_) {
break;
}
}
}
}
|