Tasks

One of Mill’s core abstractions is its Task Graph: this is how Mill defines, orders and caches work it needs to do, and exists independently of any support for building Java, Kotlin, or Scala.

Mill task graphs are primarily built using methods and macros defined on mill.define.Task, aliased as T for conciseness:

Task Cheat Sheet

The following table might help you make sense of the small collection of different Task types:

Target Command Source/Input Anonymous Task Persistent Task Worker

Cached to Disk

X

X

JSON Writable

X

X

X

X

JSON Readable

X

X

CLI Runnable

X

X

X

Takes Arguments

X

X

Cached In-Memory

X

The following is a simple self-contained example using Mill to compile Java, making use of the Task.Source and Task types to define a simple build graph with some input source files and intermediate build steps:

build.mill (download, browse)
package build
import mill._

def mainClass: T[Option[String]] = Some("foo.Foo")

def sources = Task.Source(millSourcePath / "src")
def resources = Task.Source(millSourcePath / "resources")

def compile = Task {
  val allSources = os.walk(sources().path)
  os.proc("javac", allSources, "-d", Task.dest).call()
  PathRef(Task.dest)
}

def assembly = Task {
  for (p <- Seq(compile(), resources())) os.copy(p.path, Task.dest, mergeFolders = true)

  val mainFlags = mainClass().toSeq.flatMap(Seq("-e", _))
  os.proc("jar", "-c", mainFlags, "-f", Task.dest / "assembly.jar", ".")
    .call(cwd = Task.dest)

  PathRef(Task.dest / "assembly.jar")
}

This code defines the following task graph, with the boxes being the tasks and the arrows representing the data-flow between them:

G sources sources compile compile sources->compile assembly assembly compile->assembly resources resources resources->assembly mainClass mainClass mainClass->assembly

This example does not use any of Mill’s builtin support for building Java or Scala projects, and instead builds a pipeline "from scratch" using Mill tasks and javac/jar/java subprocesses. We define Task.Source folders, plain T{…​} tasks that depend on them, and a Task.Command.

> ./mill show assembly
".../out/assembly.dest/assembly.jar"

> java -jar out/assembly.dest/assembly.jar i am cow
Foo.value: 31337
args: i am cow

> unzip -p out/assembly.dest/assembly.jar foo.txt
My Example Text

When you first evaluate assembly (e.g. via mill assembly at the command line), it will evaluate all the defined tasks: mainClass, sources, compile, and assembly.

Subsequent invocations of mill assembly will evaluate only as much as is necessary, depending on what input sources changed:

  • If the files in sources change, it will re-evaluate compile, and assembly (red)

G sources sources compile compile sources->compile assembly assembly compile->assembly resources resources resources->assembly mainClass mainClass mainClass->assembly
  • If the files in resources change, it will only re-evaluate assembly (red) and use the cached output of compile (green)

G sources sources compile compile sources->compile assembly assembly compile->assembly resources resources resources->assembly mainClass mainClass mainClass->assembly

Primary Tasks

There are three primary kinds of Tasks that you should care about:

Sources

build.mill (download, browse)
package build

import mill.{Module, T, _}

def sources = Task.Source { millSourcePath / "src" }
def resources = Task.Source { millSourcePath / "resources" }

Sources are defined using Task.Source{…​} taking one os.Path, or Task.Sources{…​}, taking multiple os.Paths as arguments. A Source's: its build signature/hashCode depends not just on the path it refers to (e.g. foo/bar/baz) but also the MD5 hash of the filesystem tree under that path.

Task.Source and Task.Sources are most common inputs in any Mill build: they watch source files and folders and cause downstream tasks to re-compute if a change is detected.

Cached Tasks

def allSources = Task {
  os.walk(sources().path)
    .filter(_.ext == "java")
    .map(PathRef(_))
}

def lineCount: T[Int] = Task {
  println("Computing line count")
  allSources()
    .map(p => os.read.lines(p.path).size)
    .sum
}
G sources sources allSources allSources sources->allSources lineCount lineCount allSources->lineCount

Cached Taskss are defined using the def foo = Task {…​} syntax, and dependencies on other tasks are defined using foo() to extract the value from them. Apart from the foo() calls, the Task {…​} block contains arbitrary code that does some work and returns a result. Note that tasks cannot have circular dependencies between each other.

The os.walk and os.read.lines statements above are from the OS-Lib library, which provides all common filesystem and subprocess operations for Mill builds. You can see the OS-Lib library documentation for more details:

If a cached task’s inputs change but its output does not, e.g. someone changes a comment within the source files that doesn’t affect the classfiles, then downstream tasks do not re-evaluate. This is determined using the .hashCode of the cached task’s return value.

> ./mill show lineCount
Computing line count
16

> ./mill show lineCount # line count already cached, doesn't need to be computed
16

Furthermore, when code changes occur, cached tasks only invalidate if the code change may directly or indirectly affect it. e.g. adding a comment to lineCount will not cause it to recompute:

 def lineCount: T[Int] = Task {
  println("Computing line count")
+  // Hello World
  allSources()
    .map(p => os.read.lines(p.path).size)
    .sum

But changing the code of the cached task or any upstream helper method will cause the old value to be invalidated and a new value re-computed (with a new println) next time it is invoked:

  def lineCount: T[Int] = Task {
-  println("Computing line count")
+  println("Computing line count!!!")
  allSources()
    .map(p => os.read.lines(p.path).size)
    .sum

For more information on how the bytecode analysis necessary for invalidating cached tasks based on code-changes work, see PR#2417 that implemented it.

The return-value of cached tasks has to be JSON-serializable via uPickle. You can run cached tasks directly from the command line, or use show if you want to see the JSON content or pipe it to external tools. See the uPickle library documentation for more details:

Task.dest

Each task is assigned a unique Task.dest folder on disk (e.g. classFiles is given out/classFiles.dest/). Task.dest is reset every time a task is recomputed, and can be used as scratch space or to store the task’s output files. Any metadata returned from the task is automatically JSON-serialized and stored at out/classFiles.json adjacent to it’s .dest folder. If you want to return a file or a set of files as the result of a Task, write them to disk within your Task.dest folder and return a PathRef() that referencing the files or folders you want to return:

def classFiles = Task {
  println("Generating classfiles")

  os.proc("javac", allSources().map(_.path), "-d", Task.dest)
    .call(cwd = Task.dest)

  PathRef(Task.dest)
}

def jar = Task {
  println("Generating jar")
  os.copy(classFiles().path, Task.dest, mergeFolders = true)
  os.copy(resources().path, Task.dest, mergeFolders = true)

  os.proc("jar", "-cfe", Task.dest / "foo.jar", "foo.Foo", ".").call(cwd = Task.dest)

  PathRef(Task.dest / "foo.jar")
}
G allSources allSources classFiles classFiles allSources->classFiles jar jar classFiles->jar resources resources resources->jar
> ./mill jar
Generating classfiles
Generating jar

> ./mill show jar
".../out/jar.dest/foo.jar"
os.pwd of the Mill process is set to an empty sandbox/ folder by default. This is to stop you from accidentally reading and writing files to the base repository root, which would cause problems with Mill’s caches not invalidating properly or files from different tasks colliding and causing issues. You should never use os.pwd or rely on the process working directory, and always explicitly use Task.dest or the .path of upstream PathRefs when accessing files. In the rare case where you truly need the Mill project root folder, you can access it via Task.workspace

Dependent Tasks

Tasks can depend on other tasks via the foo() syntax.

def largeFile = Task {
  println("Finding Largest File")
  allSources()
    .map(_.path)
    .filter(_.ext == "java")
    .maxBy(os.read.lines(_).size)
}

def hugeFileName = Task {
  if (lineCount() > 999) largeFile().last
  else "<no-huge-file>"
}
G allSources allSources largeFile largeFile allSources->largeFile hugeFileName hugeFileName largeFile->hugeFileName
The graph of inter-dependent tasks is evaluated in topological order; that means that the body of a task will not even begin to evaluate if one of its upstream dependencies has failed. Similar, even if the upstream tasks is not used in one branch of an if condition, it will get computed regardless before the if condition is even considered.

The output below demonstrates this behavior, with the println defined in def largeFile above running even though the largeFile() branch of the if conditional does not get used:

> ./mill show lineCount
16

> ./mill show hugeFileName # This still runs `largestFile` even though `lineCount() < 999`
Finding Largest File
"<no-huge-file>"

Custom Types

uPickle comes with built-in support for most Scala primitive types and builtin data structures: tuples, collections, PathRefs, etc. can be returned and automatically serialized/de-serialized as necessary. One notable exception is case classes: if you want return your own case class, you must mark it JSON-serializable by adding the following implicit to its companion object:

case class ClassFileData(totalFileSize: Long, largestFile: String)
object ClassFileData {
  implicit val rw: upickle.default.ReadWriter[ClassFileData] = upickle.default.macroRW
}

def summarizeClassFileStats = Task {
  val files = os.walk(classFiles().path)
  ClassFileData(
    totalFileSize = files.map(os.size(_)).sum,
    largestFile = files.maxBy(os.size(_)).last
  )
}
G classFiles classFiles summarizedClassFileStats summarizedClassFileStats classFiles->summarizedClassFileStats
> ./mill show summarizeClassFileStats
{
  "totalFileSize": ...,
  "largestFile": "..."
}

For more details on how to use uPickle, check out the uPickle library documentation

Commands

def run(mainClass: String, args: String*) = Task.Command {
  os.proc(
    "java",
    "-cp",
    s"${classFiles().path}:${resources().path}",
    mainClass,
    args
  )
    .call(stdout = os.Inherit)
}
G classFiles classFiles run run classFiles->run resources resources resources->run

Defined using Task.Command {…​} syntax, Commands can run arbitrary code, with dependencies declared using the same foo() syntax (e.g. classFiles() above). Commands can be parametrized, but their output is not cached, so they will re-evaluate every time even if none of their inputs have changed. A command with no parameter is defined as def myCommand() = Task.Command {…​}. It is a compile error if () is missing.

Tasks can take command line params, parsed by the MainArgs library. Thus the signature def run(mainClass: String, args: String*) takes params of the form --main-class <str> <arg1> <arg2> …​ <argn>:

> ./mill run --main-class foo.Foo hello world
Foo.value: 31337
args: hello world
foo.txt resource: My Example Text

Command line arguments can take most primitive types: String, Int, Boolean, etc., along with Option[T] representing optional values and Seq[T] representing repeatable values, and mainargs.Flag representing flags and mainargs.Leftover[T] representing any command line arguments not parsed earlier. Default values for command line arguments are also supported. See the mainargs documentation for more details:

By default, all command parameters need to be named, except for variadic parameters of type T* or mainargs.Leftover[T], or those marked as @arg(positional = true). You can use also the flag --allow-positional-command-args to globally allow arguments to be passed positionally, as shown below:

> ./mill run foo.Foo hello world # this raises an error because `--main-class` is not given
error: Missing argument: --mainClass <str>
Expected Signature: run
  --mainClass <str>
  args <str>...
...

> ./mill --allow-positional run foo.Foo hello world # this succeeds due to --allow-positional
Foo.value: 31337
args: hello world
foo.txt resource: My Example Text

Like Cached Tasks, a command only evaluates after all its upstream dependencies have completed, and will not begin to run if any upstream dependency has failed.

Commands are assigned the same scratch/output folder out/run.dest/ as Tasks are, and its returned metadata stored at the same out/run.json path for consumption by external tools.

Commands can only be defined directly within a Module body.

Overrides

Tasks can be overriden, with the overriden task callable via super. You can also override a task with a different type of task, e.g. below we override sourceRoots which is a Task.Sources with a cached Task{} that depends on the original via super:

trait Foo extends Module {
  def sourceRoots = Task.Sources(millSourcePath / "src")
  def sourceContents = Task {
    sourceRoots()
      .flatMap(pref => os.walk(pref.path))
      .filter(_.ext == "txt")
      .sorted
      .map(os.read(_))
  }
}

trait Bar extends Foo {
  def additionalSources = Task.Sources(millSourcePath / "src2")
  def sourceRoots = Task { super.sourceRoots() ++ additionalSources() }
}

object bar extends Bar
G bar.sourceRoots.super bar.sourceRoots.super bar.sourceRoots bar.sourceRoots bar.sourceRoots.super->bar.sourceRoots bar.sourceContents bar.sourceContents bar.sourceRoots->bar.sourceContents bar.additionalSources bar.additionalSources bar.additionalSources->bar.sourceRoots
> ./mill show bar.sourceContents # includes both source folders
[
  "File Data From src/",
  "File Data From src2/"
]

Other Tasks

Anonymous Tasks

build.mill (download, browse)
package build
import mill._, define.Task

def data = Task.Source(millSourcePath / "data")

def anonTask(fileName: String): Task[String] = Task.Anon {
  os.read(data().path / fileName)
}

def helloFileData = Task { anonTask("hello.txt")() }
def printFileData(fileName: String) = Task.Command {
  println(anonTask(fileName)())
}

You can define anonymous tasks using the Task.Anon {…​} syntax. These are not runnable from the command-line, but can be used to share common code you find yourself repeating in Tasks and Commands.

Anonymous task’s output does not need to be JSON-serializable, their output is not cached, and they can be defined with or without arguments. Unlike Cached Tasks or Commands, anonymous tasks can be defined anywhere and passed around any way you want, until you finally make use of them within a downstream task or command.

While an anonymous task foo's own output is not cached, if it is used in a downstream task baz and the upstream task bar hasn’t changed, baz's cached output will be used and foo's evaluation will be skipped altogether.

> ./mill show helloFileData
"Hello"

> ./mill printFileData --file-name hello.txt
Hello

> ./mill printFileData --file-name world.txt
World!

Inputs

build.mill (download, browse)
package build
import mill._

def myInput = Task.Input {
  os.proc("git", "rev-parse", "HEAD").call(cwd = Task.workspace)
    .out
    .text()
    .trim()
}

A generalization of Sources, Task.Inputs are tasks that re-evaluate every time (unlike Anonymous Tasks), containing an arbitrary block of code.

Inputs can be used to force re-evaluation of some external property that may affect your build. For example, if I have a cached task bar that calls out to git to compute the latest commit hash and message directly, that target does not have any Task inputs and so will never re-compute even if the external git status changes:

def gitStatusTask = Task {
  "version-" +
    os.proc("git", "log", "-1", "--pretty=format:%h-%B ")
      .call(cwd = Task.workspace)
      .out
      .text()
      .trim()
}
> git init .
> git commit --allow-empty -m "Initial-Commit"

> ./mill show gitStatusTask
"version-...-Initial-Commit"

> git commit --allow-empty -m "Second-Commit"

> ./mill show gitStatusTask # Mill didn't pick up the git change!
"version-...-Initial-Commit"

gitStatusTask will not know that git rev-parse can change, and will not know to re-evaluate when your git log does change. This means gitStatusTask will continue to use any previously cached value, and gitStatusTask's output will be out of date!

To fix this, you can wrap your git log in a Task.Input:

def gitStatusInput = Task.Input {
  os.proc("git", "log", "-1", "--pretty=format:%h-%B ")
    .call(cwd = Task.workspace)
    .out
    .text()
    .trim()
}
def gitStatusTask2 = Task { "version-" + gitStatusInput() }

This makes gitStatusInput to always re-evaluate every build, and only if the output of gitStatusInput changes will gitStatusTask2 re-compute

> git commit --allow-empty -m "Initial-Commit"

> ./mill show gitStatusTask2
"version-...-Initial-Commit"

> git commit --allow-empty -m "Second-Commit"

> ./mill show gitStatusTask2 # Mill picked up git change
"version-...-Second-Commit"

Note that because Task.Inputs re-evaluate every time, you should ensure that the code you put in Task.Input runs quickly. Ideally it should just be a simple check "did anything change?" and any heavy-lifting should be delegated to downstream tasks where it can be cached if possible.

System Properties Inputs

One major use case of Input tasks is to make your build configurable via JVM system properties of environment variables. If you directly access sys.props or sys.env inside a cached Task{}, the cached value will be used even if the property or environment variable changes in subsequent runs, when you really want it to be re-evaluated. Thus, accessing system properties should be done in a Task.Input, and usage of the property should be done downstream in a cached task:

def myPropertyInput = Task.Input {
  sys.props("my-property")
}
def myPropertyTask = Task {
  "Hello Prop " + myPropertyInput()
}
> ./mill show myPropertyTask
"Hello Prop null"

> ./mill -Dmy-property=world show myPropertyTask # Task is correctly invalidated when prop is added
"Hello Prop world"

> ./mill show myPropertyTask # Task is correctly invalidated when prop is removed
"Hello Prop null"

Again, Task.Input runs every time, and thus you should only do the bare minimum in your Task.Input that is necessary to detect changes. Any further processing should be done in downstreak cached tasks to allow for proper caching and re-use

Environment Variable Inputs

Like system properties, environment variables should be referenced in Task.Inputs. Unlike system properties, you need to use the special API Task.env to access the environment, due to JVM limitations:

def myEnvInput = Task.Input {
  Task.env.getOrElse("MY_ENV", null)
}

def myEnvTask = Task {
  "Hello Env " + myEnvInput()
}
> ./mill show myEnvTask
"Hello Env null"

> MY_ENV=world ./mill show myEnvTask # Task is correctly invalidated when env is added
"Hello Env world"

> ./mill show myEnvTask # Task is correctly invalidated when env is removed
"Hello Env null"

Persistent Tasks

Persistent tasks defined using Task(persistent = true) are similar to normal cached Tasks, except their Task.dest folder is not cleared before every evaluation. This makes them useful for caching things on disk in a more fine-grained manner than Mill’s own Task-level caching: the task can maintain a cache of one or more files on disk, and decide itself which files (or parts of which files!) need to invalidate, rather than having all generated files wiped out every time (which is the default behavior for normal Tasks).

Below is a semi-realistic example of using Task(persistent = true) to compress files in an input folder, and re-use previously-compressed files if a file in the input folder did not change:

build.mill (download, browse)
package build
import mill._, scalalib._
import java.util.Arrays
import java.io.ByteArrayOutputStream
import java.util.zip.GZIPOutputStream

def data = Task.Source(millSourcePath / "data")

def compressedData = Task(persistent = true) {
  println("Evaluating compressedData")
  os.makeDir.all(Task.dest / "cache")
  os.remove.all(Task.dest / "compressed")

  for (p <- os.list(data().path)) {
    val compressedPath = Task.dest / "compressed" / s"${p.last}.gz"
    val bytes = os.read.bytes(p)
    val hash = Arrays.hashCode(bytes)
    val cachedPath = Task.dest / "cache" / hash.toHexString
    if (!os.exists(cachedPath)) {
      println("Compressing: " + p.last)
      os.write(cachedPath, compressBytes(bytes))
    } else {
      println("Reading Cached from disk: " + p.last)
    }
    os.copy(cachedPath, compressedPath, createFolders = true)
  }

  os.list(Task.dest / "compressed").map(PathRef(_))
}

def compressBytes(input: Array[Byte]) = {
  val bos = new ByteArrayOutputStream(input.length)
  val gzip = new GZIPOutputStream(bos)
  gzip.write(input)
  gzip.close()
  bos.toByteArray
}

In this example, we implement a compressedData task that takes a folder of files in data and compresses them, while maintaining a cache of compressed contents for each file. That means that if the data folder is modified, but some files remain unchanged, those files would not be unnecessarily re-compressed when compressedData evaluates.

Since persistent tasks have long-lived state on disk that lives beyond a single evaluation, this raises the possibility of the disk contents getting into a bad state and causing all future evaluations to fail. It is left up to user of Task(persistent = true) to ensure their implementation is eventually consistent. You can also use mill clean to manually purge the disk contents to start fresh.

> ./mill show compressedData
Evaluating compressedData
Compressing: hello.txt
Compressing: world.txt
[
  ".../hello.txt.gz",
  ".../world.txt.gz"
]

> ./mill compressedData # when no input changes, compressedData does not evaluate at all

> sed -i.bak 's/Hello/HELLO/g' data/hello.txt

> ./mill compressedData # when one input file changes, only that file is re-compressed
Compressing: hello.txt
Reading Cached from disk: world.txt

> ./mill clean compressedData

> ./mill compressedData
Evaluating compressedData
Compressing: hello.txt
Compressing: world.txt

Workers

Mill workers defined using Task.Worker are long-lived in-memory objects that can persistent across multiple evaluations. These are similar to persistent tasks in that they let you cache things, but the fact that they let you cache the worker object in-memory allows for greater performance and flexibility: you are no longer limited to caching only serializable data and paying the cost of serializing it to disk every evaluation. This example uses a Worker to provide simple in-memory caching for compressed files.

build.mill (download, browse)
package build
import mill._, scalalib._
import java.util.Arrays
import java.io.ByteArrayOutputStream
import java.util.zip.GZIPOutputStream

def data = Task.Source(millSourcePath / "data")

def compressWorker = Task.Worker { new CompressWorker(Task.dest) }

def compressedData = Task {
  println("Evaluating compressedData")
  for (p <- os.list(data().path)) {
    os.write(
      Task.dest / s"${p.last}.gz",
      compressWorker().compress(p.last, os.read.bytes(p))
    )
  }
  os.list(Task.dest).map(PathRef(_))
}

class CompressWorker(dest: os.Path) {
  val cache = collection.mutable.Map.empty[Int, Array[Byte]]
  def compress(name: String, bytes: Array[Byte]): Array[Byte] = {
    val hash = Arrays.hashCode(bytes)
    if (!cache.contains(hash)) {
      val cachedPath = dest / hash.toHexString
      if (!os.exists(cachedPath)) {
        println("Compressing: " + name)
        cache(hash) = compressBytes(bytes)
        os.write(cachedPath, cache(hash))
      } else {
        println("Cached from disk: " + name)
        cache(hash) = os.read.bytes(cachedPath)
      }
    } else {
      println("Cached from memory: " + name)
    }
    cache(hash)
  }
}

def compressBytes(input: Array[Byte]) = {
  val bos = new ByteArrayOutputStream(input.length)
  val gzip = new GZIPOutputStream(bos)
  gzip.write(input)
  gzip.close()
  bos.toByteArray
}

Common things to put in workers include:

  1. References to third-party daemon processes, e.g. Webpack or wkhtmltopdf, which perform their own in-memory caching

  2. Classloaders containing plugin code, to avoid classpath conflicts while also avoiding classloading cost every time the code is executed

The initialization of a Task.Worker’s value is single threaded, but usage of the worker’s value may be done concurrently. The user of `Task.Worker is responsible for ensuring it’s value is safe to use in a multi-threaded environment via techniques like locks, atomics, or concurrent data structures

Workers live as long as the Mill process. By default, consecutive mill commands in the same folder will re-use the same Mill process and workers, unless --no-server is passed which will terminate the Mill process and workers after every command. Commands run repeatedly using --watch will also preserve the workers between them.

Workers can also make use of their Task.dest folder as a cache that persist when the worker shuts down, as a second layer of caching. The example usage below demonstrates how using the --no-server flag will make the worker read from its disk cache, where it would have normally read from its in-memory cache

> ./mill show compressedData
Evaluating compressedData
Compressing: hello.txt
Compressing: world.txt
[
  ".../hello.txt.gz",
  "...world.txt.gz"
]

> ./mill compressedData # when no input changes, compressedData does not evaluate at all

> sed -i.bak 's/Hello/HELLO/g' data/hello.txt

> ./mill compressedData # not --no-server, we read the data from memory
Compressing: hello.txt
Cached from memory: world.txt

> ./mill compressedData # --no-server, we read the data from disk
Compressing: hello.txt
Cached from disk: world.txt

Mill uses workers to manage long-lived instances of the Zinc Incremental Scala Compiler and the Scala.js Optimizer. This lets us keep them in-memory with warm caches and fast incremental execution.

Autoclosable Workers

As Workers may also hold limited resources, it may be necessary to free up these resources once a worker is no longer needed. This is especially the case, when your worker tasks depends on other tasks and these tasks change, as Mill will then also create a new worker instance.

To implement resource cleanup, your worker can implement java.lang.AutoCloseable. Once the worker is no longer needed, Mill will call the close() method on it before any newer version of this worker is created.

import mill._
import java.lang.AutoCloseable

class MyWorker() extends AutoCloseable {
  // ...
  override def close() = { /* cleanup and free resources */ }
}

def myWorker = Task.Worker { new MyWorker() }

(Experimental) Forking Concurrent Futures within Tasks

Mill provides the T.fork.async and T.fork.await APIs for spawning async futures within a task and aggregating their results later. This API is used by Mill to support parallelizing test classes, but can be used in your own tasks as well:

build.mill (download, browse)
package build

import mill._

def taskSpawningFutures = Task {
  val f1 = T.fork.async(dest = T.dest / "future-1", key = "1", message = "First Future") {
    println("Running First Future inside " + os.pwd)
    Thread.sleep(3000)
    val res = 1
    println("Finished First Future")
    res
  }
  val f2 = T.fork.async(dest = T.dest / "future-2", key = "2", message = "Second Future") {
    println("Running Second Future inside " + os.pwd)
    Thread.sleep(3000)
    val res = 2
    println("Finished Second Future")
    res
  }

  T.fork.await(f1) + T.fork.await(f2)
}
> ./mill show taskSpawningFutures
[1] Running First Future inside .../out/taskSpawningFutures.dest/future-1
[2] Running Second Future inside .../out/taskSpawningFutures.dest/future-2
[1] Finished First Future
[2] Finished Second Future
3

T.fork.async takes several parameters in addition to the code block to be run:

  • dest is a folder for which the async future is to be run, overriding os.pwd for the duration of the future

  • key is a short prefix prepended to log lines to let you easily identify the future’s log lines and distinguish them from logs of other futures and tasks running concurrently

  • message is a one-line description of what the future is doing

Futures spawned by T.fork.async count towards Mill’s -j/--jobs concurrency limit (which defaults to one-per-core), so you can freely use T.fork.async without worrying about spawning too many concurrent threads and causing CPU or memory contention. T.fork uses Java’s built in ForkJoinPool and ManagedBlocker infrastructure under the hood to effectively manage the number of running threads.

While scala.concurrent and java.util.concurrent can also be used to spawn thread pools and run async futures, T.fork provides a way to do so that integrates with Mill’s existing concurrency, sandboxing and logging systems. Thus you should always prefer to run async futures on T.fork whenever possible.