121462b129
Schedules I/O chains in the same order as they arrive providing a fixed amount of concurrency. The low memory cost comes at the cost of some computational cost that is likely to be acceptable with small amounts of concurrency. The code cost is about 4x higher than the simple linear executor which isn't entirely unexpected as the logic requirements are quite a bit more than doing the next thing in the queue. Signed-off-by: Tom Burdick <thomas.burdick@intel.com>
20 lines
366 B
CMake
20 lines
366 B
CMake
# Copyright (c) 2022 Intel Corporation
|
|
# SPDX-License-Identifier: Apache-2.0
|
|
|
|
if(CONFIG_RTIO)
|
|
zephyr_library()
|
|
|
|
zephyr_include_directories(${ZEPHYR_BASE}/subsys/rtio)
|
|
|
|
zephyr_library_sources_ifdef(
|
|
CONFIG_RTIO_EXECUTOR_SIMPLE
|
|
rtio_executor_simple.c
|
|
)
|
|
|
|
zephyr_library_sources_ifdef(
|
|
CONFIG_RTIO_EXECUTOR_CONCURRENT
|
|
rtio_executor_concurrent.c
|
|
)
|
|
|
|
endif()
|