mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
001f187ed6
We use COROUTINE_LIMITED_ADDRESS_SPACE to select platforms where address space is 32-bits or less. Fiber pool implementation enables more book keeping, and reduces upper limits, in order to minimise address space utilisation.
53 lines
1.5 KiB
C
53 lines
1.5 KiB
C
/*
|
|
* This file is part of the "Coroutine" project and released under the MIT License.
|
|
*
|
|
* Created by Samuel Williams on 3/11/2018.
|
|
* Copyright, 2018, by Samuel Williams. All rights reserved.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
|
|
#define COROUTINE __attribute__((noreturn, fastcall)) void
|
|
#define COROUTINE_LIMITED_ADDRESS_SPACE
|
|
|
|
enum {COROUTINE_REGISTERS = 4};
|
|
|
|
struct coroutine_context
|
|
{
|
|
void **stack_pointer;
|
|
};
|
|
|
|
typedef COROUTINE(* coroutine_start)(struct coroutine_context *from, struct coroutine_context *self) __attribute__((fastcall));
|
|
|
|
static inline void coroutine_initialize_main(struct coroutine_context * context) {
|
|
context->stack_pointer = NULL;
|
|
}
|
|
|
|
static inline void coroutine_initialize(
|
|
struct coroutine_context *context,
|
|
coroutine_start start,
|
|
void *stack,
|
|
size_t size
|
|
) {
|
|
assert(start && stack && size >= 1024);
|
|
|
|
// Stack grows down. Force 16-byte alignment.
|
|
char * top = (char*)stack + size;
|
|
context->stack_pointer = (void**)((uintptr_t)top & ~0xF);
|
|
|
|
*--context->stack_pointer = NULL;
|
|
*--context->stack_pointer = (void*)start;
|
|
|
|
context->stack_pointer -= COROUTINE_REGISTERS;
|
|
memset(context->stack_pointer, 0, sizeof(void*) * COROUTINE_REGISTERS);
|
|
}
|
|
|
|
struct coroutine_context * coroutine_transfer(struct coroutine_context * current, struct coroutine_context * target) __attribute__((fastcall));
|
|
|
|
static inline void coroutine_destroy(struct coroutine_context * context)
|
|
{
|
|
context->stack_pointer = NULL;
|
|
}
|