Coroutine implementation method and apparatus

Abstract

Embodiments of the present invention provide a coroutine implementation method and apparatus. The method comprises: determining a target memory space required by a function call stack corresponding toa coroutine according to a script language byte code of a function corresponding to the coroutine, wherein one coroutine is corresponding to one function call stack; allocating an independent memoryspace corresponding to the target memory space for the function call stack, wherein the memory space of the function call stack corresponding to each coroutine does not interfere with each other; in the independent memory space, filling each structure of the function call stack with the content; preprocessing the function call stack before execution of the coroutine; and directing the execution state of the virtual machine to the function call stack so as to execute the coroutine. Further, the embodiments of the present invention can also implement coroutine switching. According to the embodiments of the present invention, the efficiency of the coroutine implementation can be improved.

Description

technical field [0001] The invention relates to the technical field of programs, in particular to a method and device for implementing a coroutine. Background technique [0002] As a reentrant subroutine in user mode, coroutines are widely used in computer programs and data processing; currently, the framework for integrating coroutine capabilities is generally realized through the function reentrant capability provided by Generator (iterator), that is, a Generator As a coroutine, it implements a coroutine scheduler at the application level. [0003] However, to implement a coroutine based on a Generator, the yield keyword of the Generator must be used (yield represents a renunciation and transfer of control rights); once the function corresponding to the coroutine uses the yield keyword, the upper-level calls of the function must use yield to call Sub-functions, and at the same time define the function call and function return semantics of the yield keyword; it can be seen...

AI Technical Summary

Problems solved by technology

[0003] However, to implement a coroutine based on a Generator, the yield keyword of the Generator must be used (yield represents a renunciation and transfer of control); once the function corresponding to the coroutine uses the yield keyword, the upper-level calls of the function must use yield to call sub-function, and at the same time define the function call and function return semantics of the yield keyword; it can be seen that based on the Generator, using the yield keyword to implement the coroutine will bring in the complex problem of the yield keyword itself, resulting in the coroutine The implementation is more complicated and cumbersome, which reduces the efficiency of the implementation of the coroutine

Images