Coroutine

Coroutinesarecomputer programcomponents that allow execution to be suspended and resumed, generalizingsubroutinesforcooperative multitasking.Coroutines are well-suited for implementing familiar program components such ascooperative tasks,exceptions,event loops,iterators,infinite listsandpipes.

They have been described as "functions whose execution you can pause".

Melvin Conwaycoined the termcoroutinein 1958 when he applied it to the construction of anassembly program.The first published explanation of the coroutine appeared later, in 1963.

Definition and types

There is no single precise definition of coroutine. In 1980 Christopher D. Marlinsummarized two widely-acknowledged fundamental characteristics of a coroutine:

1. the values of data local to a coroutine persist between successive calls;
2. the execution of a coroutine is suspended as control leaves it, only to carry on where it left off when control re-enters the coroutine at some later stage.

Besides that, a coroutine implementation has 3 features:

1. the control-transfer mechanism.asymmetric coroutinesusually provide keywords likeyieldandresume.Programmers cannot freely choose which frame to yield to. The runtime only yields to the nearest caller of the current coroutine. On the other hand, insymmetric coroutines,programmers must specify a yield destination.
2. whether coroutines are provided in the language asfirst-class objects,which can be freely manipulated by the programmer, or as constrained constructs;
3. whether a coroutine is able to suspend its execution from within nested function calls. Such a coroutine is astackful coroutine.One to the contrary is calledstackless coroutines,where unless marked as coroutine, a regular function can't use the keywordyield.

The paper "Revisiting Coroutines"published in 2009 proposed termfull coroutineto denote one that supports first-class coroutine and is stackful. Full Coroutines deserve their own name in that they have the sameexpressive poweras one-shotcontinuationsand delimited continuations. Full coroutines are either symmetric or asymmetric. Importantly, whether a coroutine is symmetric or asymmetric has no bearing on how expressive it can be as they are equally as expressive, though full coroutines are more expressive than non-full coroutines. While their expressive power is the same, asymmetrical coroutines more closely resemble routine based control structures in the sense that control is always passed back to the invoker, which programmers may find more familiar.

Comparison with

Subroutines

Subroutines are special cases of coroutines.When subroutines are invoked, execution begins at the start, and once a subroutine exits, it is finished; an instance of a subroutine only returns once, and does not hold state between invocations. By contrast, coroutines can exit by calling other coroutines, which may later return to the point where they were invoked in the original coroutine; from the coroutine's point of view, it is not exiting but calling another coroutine.Thus, a coroutine instance holds state, and varies between invocations; there can be multiple instances of a given coroutine at once. The difference between calling another coroutine by means of"yielding"to it and simply calling another routine (which then, also, would return to the original point), is that the relationship between two coroutines which yield to each other is not that of caller-callee, but instead symmetric.

Any subroutine can be translated to a coroutine which does not callyield.

Here is a simple example of how coroutines can be useful. Suppose you have a consumer-producer relationship where one routine creates items and adds them to a queue and another removes items from the queue and uses them. For reasons of efficiency, you want to add and remove several items at once. The code might look like this:

varq:= new queue

coroutineproduce
loop
whileq is not full
create some new items
add the items to q
yieldto consume

coroutineconsume
loop
whileq is not empty
remove some items from q
use the items
yieldto produce

callproduce

The queue is then completely filled or emptied before yielding control to the other coroutine using theyieldcommand. The further coroutines calls are starting right after theyield,in the outer coroutine loop.

Although this example is often used as an introduction tomultithreading,two threads are not needed for this: theyieldstatement can be implemented by a jump directly from one routine into the other.

Threads

Coroutines are very similar tothreads.However, coroutines arecooperatively multitasked,whereas threads are typicallypreemptively multitasked.Coroutines provideconcurrency,because they allow tasks to be performed out of order or in a changeable order, without changing the overall outcome, but they do not provideparallelism,because they do not execute multiple tasks simultaneously. The advantages of coroutines over threads are that they may be used in ahard-realtimecontext (switchingbetween coroutines need not involve anysystem callsor anyblockingcalls whatsoever), there is no need for synchronization primitives such asmutexes,semaphores, etc. in order to guardcritical sections,and there is no need for support from the operating system.

It is possible to implement coroutines using preemptively-scheduled threads, in a way that will be transparent to the calling code, but some of the advantages (particularly the suitability for hard-realtime operation and relative cheapness of switching between them) will be lost.

Generators

Main article:Generator (computer programming)

Generators, also known as semicoroutines,are a subset of coroutines. Specifically, while both can yield multiple times, suspending their execution and allowing re-entry at multiple entry points, they differ in coroutines' ability to control where execution continues immediately after they yield, while generators cannot, instead transferring control back to the generator's caller.That is, since generators are primarily used to simplify the writing ofiterators,theyieldstatement in a generator does not specify a coroutine to jump to, but rather passes a value back to a parent routine.

However, it is still possible to implement coroutines on top of a generator facility, with the aid of a top-level dispatcher routine (atrampoline,essentially) that passes control explicitly to child generators identified by tokens passed back from the generators:

varq:= new queue

generatorproduce
loop
whileq is not full
create some new items
add the items to q
yield

generatorconsume
loop
whileq is not empty
remove some items from q
use the items
yield

subroutinedispatcher
vard:= new dictionary(generator→iterator)
d[produce]:=startproduce
d[consume]:=startconsume
varcurrent:= produce
loop
callcurrent
current:=nextd[current]

calldispatcher

A number of implementations of coroutines for languages with generator support but no native coroutines (e.g. Pythonbefore 2.5) use this or a similar model.

Mutual recursion

Further information:Mutual recursion

Using coroutines for state machines or concurrency is similar to usingmutual recursionwithtail calls,as in both cases the control changes to a different one of a set of routines. However, coroutines are more flexible and generally more efficient. Since coroutines yield rather than return, and then resume execution rather than restarting from the beginning, they are able to hold state, both variables (as in a closure) and execution point, and yields are not limited to being in tail position; mutually recursive subroutines must either use shared variables or pass state as parameters. Further, each mutually recursive call of a subroutine requires a new stack frame (unlesstail call eliminationis implemented), while passing control between coroutines uses the existing contexts and can be implemented simply by a jump.

Common uses

Coroutines are useful to implement the following:

• State machineswithin a single subroutine, where the state is determined by the current entry/exit point of the procedure; this can result in more readable code compared to use ofgoto,and may also be implemented viamutual recursionwithtail calls.
• Actor modelof concurrency, for instance invideo games.Each actor has its own procedures (this again logically separates the code), but they voluntarily give up control to central scheduler, which executes them sequentially (this is a form ofcooperative multitasking).
• Generators,and these are useful forstreams– particularly input/output – and for generic traversal of data structures.
• Communicating sequential processeswhere each sub-process is a coroutine. Channel inputs/outputs and blocking operations yield coroutines and a scheduler unblocks them on completion events. Alternatively, each sub-process may be the parent of the one following it in the data pipeline (or preceding it, in which case the pattern can be expressed as nested generators).
• Reverse communication, commonly used in mathematical software, wherein a procedure such as a solver, integral evaluator,... needs the using process to make a computation, such as evaluating an equation or integrand.

Native support

Coroutines originated as anassembly languagemethod, but are supported in somehigh-level programming languages.

• Aikido
• AngelScript
• Ballerina
• BCPL
• Pascal(BorlandTurbo Pascal7.0 with uThreads module)
• BETA
• BLISS
• C++(Since C++20)
• C#(Since 2.0)
• Chapel
• ChucK
• CLU
• D
• Dynamic C
• Erlang
• F#
• Factor
• GameMonkey Script
• GDScript(Godot's scripting language)
• Go
• Haskell
• High Level Assembly
• Icon
• Io
• JavaScript(since 1.7, standardized in ECMAScript 6)ECMAScript 2017 also includesawaitsupport.
• Julia
• Kotlin(since 1.1)
• Limbo
• Lua
• Lucid
• μC++
• Modula-2
• Nemerle
• Perl 5(using theCoro module)
• PHP(withHipHop,native since PHP 5.5)
• Picolisp
• Prolog
• Python(since 2.5,with improved support since 3.3 and with explicit syntax since 3.5)
• Racket (programming language)
• Raku
• Ruby
• Sather
• Scheme
• Self
• Simula67
• Smalltalk
• Squirrel
• Stackless Python
• SuperCollider
• Tcl(since 8.6)
• urbiscript

Sincecontinuationscan be used to implement coroutines, programming languages that support them can also quite easily support coroutines.

Implementations

As of 2003,many of the most popular programming languages, including C and its derivatives, do not have built-in support for coroutines within the language or their standard libraries. This is, in large part, due to the limitations ofstack-basedsubroutine implementation. An exception is the C++ libraryBoost.Context,part ofboost libraries,which supports context swapping on ARM, MIPS, PowerPC, SPARC and x86 on POSIX, Mac OS X and Windows. Coroutines can be built upon Boost.Context.

In situations where a coroutine would be the natural implementation of a mechanism, but is not available, the typical response is to use aclosure– a subroutine with state variables (static variables,often boolean flags) to maintain an internal state between calls, and to transfer control to the correct point. Conditionals within the code result in the execution of different code paths on successive calls, based on the values of the state variables. Another typical response is to implement an explicit state machine in the form of a large and complexswitch statementor via agotostatement, particularly acomputed goto.Such implementations are considered difficult to understand and maintain, and a motivation for coroutine support.

Threads,and to a lesser extentfibers,are an alternative to coroutines in mainstream programming environments today. Threads provide facilities for managing the real-time cooperative interaction ofsimultaneouslyexecuting pieces of code. Threads are widely available in environments that support C (and are supported natively in many other modern languages), are familiar to many programmers, and are usually well-implemented, well-documented and well-supported. However, as they solve a large and difficult problem they include many powerful and complex facilities and have a correspondingly difficult learning curve. As such, when a coroutine is all that is needed, using a thread can be overkill.

One important difference between threads and coroutines is that threads are typically preemptively scheduled while coroutines are not. Because threads can be rescheduled at any instant and can execute concurrently, programs using threads must be careful aboutlocking.In contrast, because coroutines can only be rescheduled at specific points in the program and do not execute concurrently, programs using coroutines can often avoid locking entirely. This property is also cited as a benefit ofevent-drivenor asynchronous programming.

Since fibers are cooperatively scheduled, they provide an ideal base for implementing coroutines above.However, system support for fibers is often lacking compared to that for threads.

C

In order to implement general-purpose coroutines, a secondcall stackmust be obtained, which is a feature not directly supported by theClanguage. A reliable (albeit platform-specific) way to achieve this is to use a small amount ofinline assemblyto explicitly manipulate the stack pointer during initial creation of the coroutine. This is the approach recommended byTom Duffin a discussion on its relative merits vs. the method used byProtothreads.On platforms which provide thePOSIXsigaltstacksystem call, a second call stack can be obtained by calling a springboard function from within a signal handlerto achieve the same goal in portable C, at the cost of some extra complexity. C libraries complying toPOSIXor theSingle Unix Specification(SUSv3) provided such routines asgetcontext, setcontext, makecontext and swapcontext,but these functions were declared obsolete in POSIX 1.2008.

Once a second call stack has been obtained with one of the methods listed above, thesetjmp and longjmpfunctions in thestandard C librarycan then be used to implement the switches between coroutines. These functions save and restore, respectively, thestack pointer,program counter,callee-savedregisters,and any other internal state as required by theABI,such that returning to a coroutine after having yielded restores all the state that would be restored upon returning from a function call. Minimalist implementations, which do not piggyback off the setjmp and longjmp functions, may achieve the same result via a small block ofinline assemblywhich swaps merely the stack pointer and program counter, andclobbersall other registers. This can be significantly faster, as setjmp and longjmp must conservatively store all registers which may be in use according to the ABI, whereas the clobber method allows the compiler to store (by spilling to the stack) only what it knows is actually in use.

Due to the lack of direct language support, many authors have written their own libraries for coroutines which hide the above details. Russ Cox's libtask libraryis a good example of this genre. It uses the context functions if they are provided by the native C library; otherwise it provides its own implementations for ARM, PowerPC, Sparc, and x86. Other notable implementations include libpcl,coro,lthread,libCoroutine,libconcurrency,libcoro,ribs2,libdill.,libaco,and libco.

In addition to the general approach above, several attempts have been made to approximate coroutines in C with combinations of subroutines and macros.Simon Tatham's contribution,based onDuff's device,is a notable example of the genre, and is the basis forProtothreadsand similar implementations.In addition to Duff's objections,Tatham's own comments provide a frank evaluation of the limitations of this approach: "As far as I know, this is the worst piece of C hackery ever seen in serious production code."The main shortcomings of this approximation are that, in not maintaining a separate stack frame for each coroutine, local variables are not preserved across yields from the function, it is not possible to have multiple entries to the function, and control can only be yielded from the top-level routine.

C++

• C++20introduced standardized coroutines as stackless functions that can be suspended in the middle of execution and resumed at a later point. The suspended state of a coroutine is stored on the heap.Implementation of this standard is ongoing, with the G++ and MSVC compilers currently fully supporting standard coroutines in recent versions.
• concurrencpp- a C++20 library which provides third-party support for C++20 coroutines, in the form of awaitable-tasks and executors that run them.
• Boost.Coroutine- created by Oliver Kowalke, is the official released portable coroutine library ofboostsince version 1.53. The library relies onBoost.Contextand supports ARM, MIPS, PowerPC, SPARC and X86 on POSIX, Mac OS X and Windows.
• Boost.Coroutine2- also created by Oliver Kowalke, is a modernized portable coroutine library since boost version 1.59. It takes advantage of C++11 features, but removes the support for symmetric coroutines.
• Mordor- In 2010,Mozyopen sourced a C++ library implementing coroutines, with an emphasis on using them to abstractasynchronous I/Ointo a more familiar sequential model.
• CO2- stackless coroutine based on C++preprocessortricks, providing await/yield emulation.
• ScummVM- TheScummVMproject implements a light-weight version of stackless coroutines based onSimon Tatham's article.
• tonbit::coroutine- C++11 single.h asymmetric coroutine implementation via ucontext / fiber
• Coroutines landed inClangin May 2017, with libc++ implementation ongoing.
• elleby Docker
• oatpp-coroutines- stackless coroutines with scheduling designed for high-concurrency level I/O operations. Used in the5-million WebSocket connectionsexperiment by Oat++. Part of theOat++web framework.

C#

C# 2.0added semi-coroutine (generator) functionality through the iterator pattern andyieldkeyword.C# 5.0includesawaitsyntax support. In addition:

• TheMindTouch DreamREST framework provides an implementation of coroutines based on the C# 2.0 iterator pattern.
• TheCaliburn(Archived2013-01-19 atarchive.today) screen patterns framework for WPF uses C# 2.0 iterators to ease UI programming, particularly in asynchronous scenarios.
• ThePower Threading Library(Archived2010-03-24 at theWayback Machine) byJeffrey Richterimplements an AsyncEnumerator that provides simplified Asynchronous Programming Model using iterator-based coroutines.
• TheUnitygame engine implements coroutines.
• TheServelat Piecesproject byYevhen Bobrovprovides transparent asynchrony for Silverlight WCF services and ability to asynchronously call any synchronous method. The implementation is based on Caliburn's Coroutines iterator and C# iterator blocks.
• StreamThreadsis an open-source, light-weight C# co-routine library based on iterator extension methods. It supports error handling and return values.

Clojure

Cloroutineis a third-party library providing support for stackless coroutines inClojure.It's implemented as a macro, statically splitting an arbitrary code block on arbitrary var calls and emitting the coroutine as a stateful function.

D

Dimplements coroutines as its standard library classFiberAgeneratormakes it trivial to expose a fiber function as aninput range,making any fiber compatible with existing range algorithms.

Go

Gohas a built-in concept of "goroutines",which are lightweight, independent processes managed by the Go runtime. A new goroutine can be started using the" go "keyword. Each goroutine has a variable-size stack which can be expanded as needed. Goroutines generally communicate using Go's built-in channels.

Java

There are several implementations for coroutines inJava.Despite the constraints imposed by Java's abstractions, the JVM does not preclude the possibility.There are four general methods used, but two break bytecode portability among standards-compliant JVMs.

• Modified JVMs. It is possible to build a patched JVM to support coroutines more natively. TheDa Vinci JVMhas had patches created.
• Modified bytecode. Coroutine functionality is possible by rewriting regular Java bytecode, either on the fly or at compile time. Toolkits includeJavaflow,Java Coroutines,andCoroutines.
• Platform-specific JNI mechanisms. These use JNI methods implemented in the OS or C libraries to provide the functionality to the JVM.
• Thread abstractions. Coroutine libraries which are implemented using threads may be heavyweight, though performance will vary based on the JVM's thread implementation.

JavaScript

• node-fibers
  • Fibjs- fibjs is a JavaScript runtime built on Chrome's V8 JavaScript engine. fibjs usesfibers-switch,sync style, and non-blocking I/O model to build scalable systems.
• SinceECMAScript 2015,stackless coroutine functionality through "generators" and yield expressions is provided.

Kotlin

Kotlinimplements coroutines as part of a first-party library.

Lua

Luahas supported first-class stackful asymmetric coroutines since version 5.0 (2003),in the standard librarycoroutine.

Modula-2

Modula-2as defined byWirthimplements coroutines as part of the standard SYSTEM library.

The procedure NEWPROCESS() fills in a context given a code block and space for a stack as parameters, and the procedure TRANSFER() transfers control to a coroutine given the coroutine's context as its parameter.

Mono

TheMonoCommon Language Runtime has support for continuations,from which coroutines can be built.

.NET Framework

During the development of the.NET Framework2.0, Microsoft extended the design of theCommon Language Runtime(CLR) hosting APIs to handle fiber-based scheduling with an eye towards its use in fiber-mode for SQL server.Before release, support for the task switching hook ICLRTask::SwitchOut was removed due to time constraints.Consequently, the use of the fiber API to switch tasks is currently not a viable option in the.NET Framework.

OCaml

OCaml supports coroutines through itsThreadmodule.These coroutines provide concurrency without parallelism, and are scheduled preemptively on a single operating system thread. Since OCaml 5.0,green threadsare also available; provided by different modules.

Perl

• Coro

Coroutines are natively implemented in allRakubackends.

PHP

• Fibersnative since PHP 8.1
• Amphp
• Open Swoole
• Coroutineimplemented in a way that resemblesPythonfunctions, and someGo,manyexamplesshowing there code converted with same number of lines and behavior.

Python

• Python2.5 implements better support for coroutine-like functionality, based on extended generators (PEP 342)
• Python3.3 improves this ability, by supporting delegating to a subgenerator (PEP 380)
• Python3.4 introduces a comprehensive asynchronous I/O framework as standardized inPEP 3156,which includes coroutines that leverage subgenerator delegation
• Python3.5 introduces explicit support for coroutines with async/awaitsyntax (PEP 0492).
• SincePython3.7, async/await have become reserved keywords.
• Eventlet
• Greenlet
• gevent
• stackless Python

Racket

Racketprovides native continuations, with a trivial implementation of coroutines provided in the official package catalog.Implementation by S. De Gabrielle

Ruby

• Ruby1.9 supports coroutines natively which are implemented asfibers,which are semi-coroutines.
• An implementation by Marc De Scheemaecker
• Ruby2.5 and higher supports coroutines natively which are implemented asfibers
• An implementation by Thomas W Branson

Scheme

SinceSchemeprovides full support for continuations, implementing coroutines is nearly trivial, requiring only that a queue of continuations be maintained.

Smalltalk

Since, in mostSmalltalkenvironments, the execution stack is a first-class citizen, coroutines can be implemented without additional library or VM support.

Tool Command Language (Tcl)

Since version 8.6, the Tool Command Language supports coroutines in the core language.

Vala

Valaimplements native support for coroutines. They are designed to be used with a Gtk Main Loop, but can be used alone if care is taken to ensure that the end callback will never have to be called before doing, at least, one yield.

Assembly languages

Machine-dependentassembly languagesoften provide direct methods for coroutine execution. For example, inMACRO-11,the assembly language of thePDP-11family of minicomputers, the "classic" coroutine switch is effected by the instruction "JSR PC,@(SP)+", which jumps to the address popped from the stack and pushes the current (i.ethat of thenext) instruction address onto the stack. OnVAXen(inVAX MACRO) the comparable instruction is "JSB @(SP)+". Even on aMotorola 6809there is the instruction "JSR [,S++]"; note the "++", as 2 bytes (of address) are popped from the stack. This instruction is much used in the (standard) 'monitor'Assist09.

See also

• Async/await
• Pipeline,a kind of coroutine used for communicating between programs
• Protothreads,a stackless lightweight thread implementation using a coroutine like mechanism

Further reading

• Ana Lucia de Moura; Roberto Ierusalimschy (2004). "Revisiting Coroutines".ACM Transactions on Programming Languages and Systems.31(2): 1–31.CiteSeerX10.1.1.58.4017.doi:10.1145/1462166.1462167.S2CID9918449.

External links

• Simon Tatham's C orientedcomprehensive introduction to coroutines
• Softpanorama coroutine page– contains extensive assembler coroutines links