@ -8,23 +8,14 @@ Asymmetric COroutine & Arkenstone is the reason why it's been named `aco`.
Support Sys V ABI of Intel386 and x86-64 currently.
Support Sys V ABI of Intel386 and x86-64 currently.
Here is a brief summary of this project:
Issues and PRs are welcome 🎉🎉🎉
- Along with the implementation of a production-ready C coroutine library, here is a detailed documentation about how to implement a *fastest* and *correct* coroutine library and also with a strict mathematical proof;
- It has no more than 900 LOC but has the full function you may want from a coroutine library;
- The [benchmark](#benchmark) part shows that one time of the context switching between coroutines only takes about *10 ns* (for the case of standalone stack) on the AWS c5d.large machine;
- User could choose to create a new coroutine with a *standalone stack* or with a *share stack* (could be shared with others);
- It is extremely memory efficient: *10,000,000* amount of co simultaneously to run only cost *2.8 GB* physical memory (run with tcmalloc, each co has a *120B* copy-stack size configuration).
The phrase "*fastest*" in above means the fastest context switching implementation which complies to the Sys V ABI of Intel386 or AMD64.
Note: Please use [releases][github-release] instead of the `master` to build the final binary.
[![Build Status Travis](https://img.shields.io/travis/hnes/libaco.svg?style=flat-square&&branch=master)](https://travis-ci.org/hnes/libaco)
[![Build Status Travis](https://img.shields.io/travis/hnes/libaco.svg?style=flat-square&&branch=master)](https://travis-ci.org/hnes/libaco)
- Along with the implementation of a production-ready C coroutine library, here is a detailed documentation about how to implement a *fastest* and *correct* coroutine library and also with a strict mathematical proof;
- It has no more than 900 LOC but has the full function you may want from a coroutine library;
- The [benchmark](#benchmark) part shows that one time of the context switching between coroutines only takes about *10 ns* (for the case of standalone stack) on the AWS c5d.large machine;
- User could choose to create a new coroutine with a *standalone stack* or with a *share stack* (could be shared with others);
- It is extremely memory efficient: *10,000,000* amount of co simultaneously to run only cost *2.8 GB* physical memory (run with tcmalloc, each co has a *120B* copy-stack size configuration).
The phrase "*fastest*" in above means the fastest context switching implementation which complies to the Sys V ABI of Intel386 or AMD64.
A "Hello libaco" code example:
```c
```c
#include "aco.h"
#include "aco.h"
#include<stdio.h>
#include<stdio.h>
@ -895,7 +898,9 @@ void co_fp1() {
New ideas are welcome!
New ideas are welcome!
- [ ] Support other platforms (especially arm & arm64).
* Add a new API `aco_reset` to support the reusability of the coroutine objects.
* Support other platforms (especially arm & arm64).