Turtle

Clone of the Ninja build system written in Rust

Goals

• Safe (no unsafe) and fast implementation of the Ninja build system in Rust
• Improved frontend support (WIP)
  • Full output from build rules and no output from Turtle by default
  • More customizable build/rule/progress/error output

Turtle is originally written for the Pen programming language. Therefore, we support only dynamic dependencies but not C/C++ header dependencies currently. Your contribution is welcome! 😄

Install

sh cargo install turtle-build

Usage

sh turtle

For more information, see turtle --help.

Compatibility

Turtle aims to support full syntax of the Ninja build files. It also supports basic command line arguments but is not going to implement all the original options (e.g. -t option.)

Syntax

• [x] build statement
  • [x] Explicit outputs
  • [x] Explicit inputs
  • [x] Implicit outputs
  • [x] Implicit inputs
  • [x] Order-only inputs
  • [x] phony rule
• [x] rule statement
• [x] default statement
• [x] include statement
• [x] subninja statement
• [ ] pool statement
• [x] Global variables
• [x] Build-local variables
• [x] in and out special variable

Command line arguments

• [x] -f custom build file option
• [x] -j job limit option
• [ ] -k keep-going option
• [x] -C change-directory option

Others

• [x] Circular build dependency detection
• [x] Circular build file dependency detection
• [x] builddir special variable
• [x] Dynamic dependencies
  • [x] Implicit inputs
  • [ ] Implicit outputs
  • [x] Circular build dependency detection
• [ ] C/C++ header dependencies
  • [ ] depfile option
  • [ ] deps option
• [ ] Windows support

Technical notes

Something different from the traditional build systems and notable in Turtle is that it solves parallel builds similar to parallel graph reduction naturally, where you modify graph structures in parallel and reduce it into a solution, thanks to an ecosystem of futures and stackless coroutines in Rust.

Here is how parallel builds work in Turtle:

1. Turtle spawns futures for all builds of default targets.
2. Depending on builds' configuration, they spawn more futures or resolve their futures.
   • If they require some input targets to be built first, they spawn those builds for input targets all in parallel.
3. Those futures are scheduled and run in parallel by an asynchronous runtime in Rust.
4. Builds complete when all the futures are resolved.

Currently, Turtle uses a topological sort algorithm only to detect dependency cycles but not for execution of build graphs.

Turtle is powered by the following neat projects and others!

• tokio: Asynchronous runtime for Rust
• sled: Embedded database in Rust
• petgraph: Graph algorithms in Rust

Similar projects

• ninja-rs/ninja-rs
• nikhilm/ninja-rs

License

Dual-licensed under MIT and Apache 2.0.