| commit | 2e1dbd79ae73753a7a14ddc991fa0b374bbf8605 | [log] [tgz] |
|---|---|---|
| author | Googler <noreply@google.com> | Wed Jul 20 19:06:20 2016 +0000 |
| committer | John Cater <jcater@google.com> | Wed Jul 20 19:54:37 2016 +0000 |
| tree | c48764f6a07324664b67473ce376f221347fa3bd | |
| parent | ebf601d340c570d2666a1293a144975938a063f2 [diff] |
Use byte[] rather than ByteString for file digests. ActionInputFileCache: Change getDigest() to return the underlying byte[16] owned by each FileArtifactValue. Remove throws clause from getInputFromDigest(); this should be an in-memory operation, and no implementation actually throws. PerActionFileCache: Invert mapping from artifact to digest only if needed. Remove interner, as it was used only for the reverse map keys, not the returned values. This should be a significant cpu savings as eagerly constructing the reverse maps was a noticeable hotspot. -- MOS_MIGRATED_REVID=127972359
{Fast, Correct} - Choose two
Bazel is a build tool that builds code quickly and reliably. It is used to build the majority of Google‘s software, and thus it has been designed to handle build problems present in Google’s development environment, including:
A massive, shared code repository, in which all software is built from source. Bazel has been built for speed, using both caching and parallelism to achieve this. Bazel is critical to Google's ability to continue to scale its software development practices as the company grows.
An emphasis on automated testing and releases. Bazel has been built for correctness and reproducibility, meaning that a build performed on a continuous build machine or in a release pipeline will generate bitwise-identical outputs to those generated on a developer's machine.
Language and platform diversity. Bazel's architecture is general enough to support many different programming languages within Google, and can be used to build both client and server software targeting multiple architectures from the same underlying codebase.
Find more background about Bazel in our FAQ.