-
Notifications
You must be signed in to change notification settings - Fork 105
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
3ec203b
commit d668561
Showing
8 changed files
with
1,165 additions
and
22 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,222 @@ | ||
| // Copyright 2023 The Native Link Authors. All rights reserved. | ||
| // | ||
| // 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. | ||
|
|
||
| use std::collections::VecDeque; | ||
| use std::pin::Pin; | ||
| use std::sync::atomic::{AtomicBool, Ordering}; | ||
| use std::sync::Arc; | ||
|
|
||
| use async_trait::async_trait; | ||
| use error::{make_input_err, Error, ResultExt}; | ||
| use futures::future::BoxFuture; | ||
| use futures::stream::{FuturesUnordered, StreamExt}; | ||
| use futures::{FutureExt, TryFutureExt}; | ||
| use hashbrown::HashSet; | ||
| use native_link_util::buf_channel::{DropCloserReadHalf, DropCloserWriteHalf}; | ||
| use native_link_util::common::DigestInfo; | ||
| use native_link_util::store_trait::{Store, UploadSizeInfo}; | ||
| use proto::build::bazel::remote::execution::v2::{ActionResult as ProtoActionResult, Tree as ProtoTree}; | ||
|
|
||
| use crate::ac_utils::{get_and_decode_digest, get_size_and_decode_digest}; | ||
|
|
||
| pub struct CompletenessCheckingStore { | ||
| cas_store: Arc<dyn Store>, | ||
| ac_store: Arc<dyn Store>, | ||
| } | ||
|
|
||
| impl CompletenessCheckingStore { | ||
| pub fn new(ac_store: Arc<dyn Store>, cas_store: Arc<dyn Store>) -> Self { | ||
| CompletenessCheckingStore { cas_store, ac_store } | ||
| } | ||
|
|
||
| fn pin_cas(&self) -> Pin<&dyn Store> { | ||
| Pin::new(self.cas_store.as_ref()) | ||
| } | ||
|
|
||
| fn pin_ac(&self) -> Pin<&dyn Store> { | ||
| Pin::new(self.ac_store.as_ref()) | ||
| } | ||
| } | ||
|
|
||
| #[async_trait] | ||
| impl Store for CompletenessCheckingStore { | ||
| async fn has_with_results( | ||
| self: Pin<&Self>, | ||
| action_result_digests: &[DigestInfo], | ||
| results: &mut [Option<usize>], | ||
| ) -> Result<(), Error> { | ||
| enum FutureResult<'a> { | ||
| AddFuturesAndDigests((Vec<BoxFuture<'a, FutureResult<'a>>>, Vec<(DigestInfo, usize)>)), | ||
| Err(usize), | ||
| } | ||
|
|
||
| let mut futures = FuturesUnordered::new(); | ||
|
|
||
| for (i, digest) in action_result_digests.iter().enumerate() { | ||
| futures.push( | ||
| get_size_and_decode_digest::<ProtoActionResult>(self.pin_cas(), digest) | ||
| .and_then(move |(action_result, _size)| async move { | ||
| // We need to add 2 because stderr and stdout digests. | ||
| const NUM_ADDTIONAL_DIGESTS: usize = 2; | ||
| let mut digest_infos = | ||
| Vec::with_capacity(action_result.output_files.len() + NUM_ADDTIONAL_DIGESTS); | ||
| let maybe_digests = action_result | ||
| .stderr_digest | ||
| .map(DigestInfo::try_from) | ||
| .into_iter() | ||
| .chain(action_result.stdout_digest.map(DigestInfo::try_from).into_iter()) | ||
| .chain( | ||
| action_result | ||
| .output_files | ||
| .into_iter() | ||
| .filter_map(|file| file.digest.map(DigestInfo::try_from)), | ||
| ); | ||
| for maybe_digest in maybe_digests { | ||
| match maybe_digest { | ||
| Ok(digest) => digest_infos.push((digest, i)), | ||
| Err(_) => return Err(make_input_err!("")), | ||
| } | ||
| } | ||
|
|
||
| let v = action_result | ||
| .output_directories | ||
| .into_iter() | ||
| .map(move |output_directory| { | ||
| { | ||
| async move { | ||
| let Ok(tree_digest) = output_directory | ||
| .tree_digest | ||
| .err_tip(|| "Could not decode tree digest completeness_checking_store::has_with_results") | ||
| .and_then(DigestInfo::try_from) | ||
| else { | ||
| return FutureResult::Err(i); | ||
| }; | ||
| get_and_decode_digest::<ProtoTree>(self.pin_cas(), &tree_digest) | ||
| .map_ok(|tree| { | ||
| let digest_count = | ||
| tree.children.iter().chain(&tree.root).fold(0, |acc, directory| { | ||
| acc + directory.files.len() + directory.directories.len() | ||
| }); | ||
| let mut digest_infos = Vec::with_capacity(digest_count); | ||
| for directory in tree.children.into_iter().chain(tree.root) { | ||
| let maybe_digests = directory | ||
| .files | ||
| .into_iter() | ||
| .filter_map(|file| file.digest.map(DigestInfo::try_from)) | ||
| .chain(directory.directories.into_iter().filter_map( | ||
| |directory| directory.digest.map(DigestInfo::try_from), | ||
| )) | ||
| .collect::<Vec<_>>(); | ||
| for maybe_digest in maybe_digests { | ||
| match maybe_digest { | ||
| Ok(digest) => digest_infos.push((digest, i)), | ||
| Err(_) => return FutureResult::Err(i), | ||
| } | ||
| } | ||
| } | ||
| FutureResult::AddFuturesAndDigests((vec![], digest_infos)) | ||
| }) | ||
| .map(move |result| match result { | ||
| Ok(v) => v, | ||
| Err(_) => FutureResult::Err(i), | ||
| }) | ||
| .await | ||
| } | ||
| } | ||
| .boxed() | ||
| }) | ||
| .collect::<Vec<_>>(); | ||
|
|
||
| Ok(FutureResult::AddFuturesAndDigests((v, digest_infos))) | ||
| }) | ||
| .map(move |v| v.unwrap_or_else(|_| FutureResult::Err(i))) | ||
| .boxed(), | ||
| ); | ||
| } | ||
|
|
||
| let mut digest_deque = VecDeque::new(); | ||
| let has_request_outstanding = Arc::new(AtomicBool::new(false)); | ||
| let mut none_found: HashSet<usize> = HashSet::new(); | ||
| const INDEX_ZERO: usize = 0; | ||
|
|
||
| while let Some(future_result) = futures.next().await { | ||
| match future_result { | ||
| FutureResult::Err(i) => { | ||
| results[i] = None; | ||
| } | ||
| FutureResult::AddFuturesAndDigests((futures_to_add, digest_infos)) => { | ||
| futures.extend(futures_to_add.into_iter()); | ||
| digest_deque.extend(digest_infos.into_iter()); | ||
| if !digest_deque.is_empty() && !has_request_outstanding.load(Ordering::Acquire) { | ||
| let has_request_outstanding = has_request_outstanding.clone(); | ||
| has_request_outstanding.store(true, Ordering::Release); | ||
|
|
||
| let (digests, indexes): (Vec<_>, Vec<_>) = digest_deque.drain(..).unzip(); | ||
|
|
||
| // Optimization: every batch of digests above comes in with the | ||
| // same indices so by cross-referencing the first index in indexes for a previous missing digest found | ||
| // this becomes far more efficient. | ||
| if !none_found.contains(&indexes[INDEX_ZERO]) { | ||
| let res_list = self.pin_cas().has_many(&digests).await?; | ||
|
|
||
| for (i, result) in res_list.iter().enumerate() { | ||
| if result.is_none() { | ||
| results[indexes[i]] = None; | ||
| none_found.insert(indexes[i]); | ||
| break; | ||
| } else { | ||
| results[indexes[i]] = *result; | ||
| } | ||
| } | ||
|
|
||
| futures.push( | ||
| async move { | ||
| has_request_outstanding.store(false, Ordering::Release); | ||
| FutureResult::AddFuturesAndDigests((vec![], vec![])) | ||
| } | ||
| .boxed(), | ||
| ); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| Ok(()) | ||
| } | ||
|
|
||
| async fn update( | ||
| self: Pin<&Self>, | ||
| digest: DigestInfo, | ||
| reader: DropCloserReadHalf, | ||
| size_info: UploadSizeInfo, | ||
| ) -> Result<(), Error> { | ||
| self.pin_ac().update(digest, reader, size_info).await | ||
| } | ||
|
|
||
| async fn get_part_ref( | ||
| self: Pin<&Self>, | ||
| digest: DigestInfo, | ||
| writer: &mut DropCloserWriteHalf, | ||
| offset: usize, | ||
| length: Option<usize>, | ||
| ) -> Result<(), Error> { | ||
| let pin_ac = self.pin_ac(); | ||
| pin_ac.get_part_ref(digest, writer, offset, length).await | ||
| } | ||
|
|
||
| fn as_any(self: Arc<Self>) -> Box<dyn std::any::Any + Send> { | ||
| Box::new(self) | ||
| } | ||
| } |
Oops, something went wrong.