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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
// Copyright 2024 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/cas_utils.hpp"
#include "fmt/core.h"
#include "src/buildtool/file_system/file_system_manager.hpp"
static auto ToGrpc(LargeObjectError&& error) noexcept -> grpc::Status {
switch (error.Code()) {
case LargeObjectErrorCode::Internal:
return grpc::Status{grpc::StatusCode::INTERNAL,
std::move(error).Message()};
case LargeObjectErrorCode::FileNotFound:
return grpc::Status{grpc::StatusCode::NOT_FOUND,
std::move(error).Message()};
case LargeObjectErrorCode::InvalidResult:
case LargeObjectErrorCode::InvalidTree:
return grpc::Status{grpc::StatusCode::FAILED_PRECONDITION,
std::move(error).Message()};
}
return grpc::Status{grpc::StatusCode::INTERNAL, "an unknown error"};
}
auto CASUtils::EnsureTreeInvariant(bazel_re::Digest const& digest,
std::string const& tree_data,
Storage const& storage) noexcept
-> std::optional<std::string> {
auto const a_digest = static_cast<ArtifactDigest>(digest);
auto error = storage.CAS().CheckTreeInvariant(a_digest, tree_data);
if (error) {
return std::move(*error).Message();
}
return std::nullopt;
}
auto CASUtils::SplitBlobIdentity(bazel_re::Digest const& blob_digest,
Storage const& storage) noexcept
-> expected<std::vector<bazel_re::Digest>, grpc::Status> {
// Check blob existence.
auto const a_digest = static_cast<ArtifactDigest>(blob_digest);
auto path = a_digest.IsTree() ? storage.CAS().TreePath(a_digest)
: storage.CAS().BlobPath(a_digest, false);
if (not path) {
return unexpected{
grpc::Status{grpc::StatusCode::NOT_FOUND,
fmt::format("blob not found {}", blob_digest.hash())}};
}
// The split protocol states that each chunk that is returned by the
// operation is stored in (file) CAS. This means for the native mode, if we
// return the identity of a tree, we need to put the tree data in file CAS
// and return the resulting digest.
auto chunk_digests = std::vector<bazel_re::Digest>{};
if (a_digest.IsTree()) {
auto tree_data = FileSystemManager::ReadFile(*path);
if (not tree_data) {
return unexpected{grpc::Status{
grpc::StatusCode::INTERNAL,
fmt::format("could read tree data {}", blob_digest.hash())}};
}
auto digest = storage.CAS().StoreBlob(*tree_data, false);
if (not digest) {
return unexpected{
grpc::Status{grpc::StatusCode::INTERNAL,
fmt::format("could not store tree as blob {}",
blob_digest.hash())}};
}
chunk_digests.emplace_back(*digest);
return chunk_digests;
}
chunk_digests.emplace_back(blob_digest);
return chunk_digests;
}
auto CASUtils::SplitBlobFastCDC(bazel_re::Digest const& blob_digest,
Storage const& storage) noexcept
-> expected<std::vector<bazel_re::Digest>, grpc::Status> {
// Split blob into chunks:
auto const a_digest = static_cast<ArtifactDigest>(blob_digest);
auto split = a_digest.IsTree() ? storage.CAS().SplitTree(a_digest)
: storage.CAS().SplitBlob(a_digest);
// Process result:
if (split) {
std::vector<bazel_re::Digest> result;
result.reserve(split->size());
std::transform(split->begin(),
split->end(),
std::back_inserter(result),
[](ArtifactDigest const& digest) {
return static_cast<bazel_re::Digest>(digest);
});
return result;
}
// Process errors
return unexpected{ToGrpc(std::move(split).error())};
}
auto CASUtils::SpliceBlob(bazel_re::Digest const& blob_digest,
std::vector<bazel_re::Digest> const& chunk_digests,
Storage const& storage) noexcept
-> expected<bazel_re::Digest, grpc::Status> {
auto const a_digest = static_cast<ArtifactDigest>(blob_digest);
std::vector<ArtifactDigest> a_parts;
a_parts.reserve(chunk_digests.size());
std::transform(chunk_digests.begin(),
chunk_digests.end(),
std::back_inserter(a_parts),
[](auto const& digest) { return ArtifactDigest{digest}; });
// Splice blob from chunks:
auto splice = a_digest.IsTree()
? storage.CAS().SpliceTree(a_digest, a_parts)
: storage.CAS().SpliceBlob(a_digest, a_parts, false);
// Process result:
if (splice) {
return static_cast<bazel_re::Digest>(*splice);
}
return unexpected{ToGrpc(std::move(splice).error())};
}
|
