| commit | ad7e4e3f5b60cae3ae5335fb7ce0254184069330 | [log] [tgz] |
|---|---|---|
| author | ichern <ichern@google.com> | Tue Feb 11 06:40:02 2020 -0800 |
| committer | Copybara-Service <copybara-worker@google.com> | Tue Feb 11 06:41:48 2020 -0800 |
| tree | 823bc0f5d0b6f4b63ca6b78288b7377e3fbba25b | |
| parent | 38a7a70b335725bc01433e30c3c7ee18d9be17a8 [diff] |
Fix algorithm for finding non-phony inputs for all phony targets for DAG Before, it worked correctly only for tree cases and did not take into account possible dependencies between current target's inputs, queueing them in the "random" order. Use DFS with two passes instead of BFS. Add a test that would fail with the previous algorithm. Closes #10751. PiperOrigin-RevId: 294427359
{Fast, Correct} - Choose two
Build and test software of any size, quickly and reliably.
Speed up your builds and tests: Bazel rebuilds only what is necessary. With advanced local and distributed caching, optimized dependency analysis and parallel execution, you get fast and incremental builds.
One tool, multiple languages: Build and test Java, C++, Android, iOS, Go, and a wide variety of other language platforms. Bazel runs on Windows, macOS, and Linux.
Scalable: Bazel helps you scale your organization, codebase, and continuous integration solution. It handles codebases of any size, in multiple repositories or a huge monorepo.
Extensible to your needs: Easily add support for new languages and platforms with Bazel's familiar extension language. Share and re-use language rules written by the growing Bazel community.
Follow our tutorials:
See CONTRIBUTING.md
