| /Zephyr-Core-3.4.0/tests/bluetooth/addr/src/ |
| D | test_bt_addr_le_eq.c | 12 bt_addr_le_t a = {.type = 0, .a = {{0, 0, 0, 0, 0, 0}}}; in ZTEST() local
13 bt_addr_le_t b = a; in ZTEST()
15 zassert_true(bt_addr_le_eq(&a, &b)); in ZTEST()
20 bt_addr_le_t a = {.type = 1, .a = {{1, 2, 3, 4, 5, 6}}}; in ZTEST() local
21 bt_addr_le_t b = a; in ZTEST()
23 zassert_true(bt_addr_le_eq(&a, &b)); in ZTEST()
28 bt_addr_le_t a = {.type = 0, .a = {{1, 2, 3, 4, 5, 6}}}; in ZTEST() local
29 bt_addr_le_t b = a; in ZTEST()
31 zassume_true(bt_addr_le_eq(&a, &b)); in ZTEST()
32 a.type = 1; in ZTEST()
[all …]
|
| D | test_bt_addr_from_str.c | 13 bt_addr_t a; in ZTEST() local
15 zassert_equal(bt_addr_from_str(addr_str, &a), -EINVAL); in ZTEST()
21 bt_addr_t a; in ZTEST() local
23 zassert_equal(bt_addr_from_str(addr_str, &a), -EINVAL); in ZTEST()
29 bt_addr_t a; in ZTEST() local
31 zassert_equal(bt_addr_from_str(addr_str, &a), -EINVAL); in ZTEST()
37 bt_addr_t a; in ZTEST() local
39 zassert_equal(bt_addr_from_str(addr_str, &a), -EINVAL); in ZTEST()
45 bt_addr_t a; in ZTEST() local
47 zassert_equal(bt_addr_from_str(addr_str, &a), -EINVAL); in ZTEST()
[all …]
|
| /Zephyr-Core-3.4.0/modules/littlefs/ |
| D | zephyr_lfs_config.h | 74 /* toolchain-specific implementations. LFS_NO_INTRINSICS falls back to a more */
78 static inline uint32_t lfs_max(uint32_t a, uint32_t b) in lfs_max() argument
80 return (a > b) ? a : b; in lfs_max()
83 static inline uint32_t lfs_min(uint32_t a, uint32_t b) in lfs_min() argument
85 return (a < b) ? a : b; in lfs_min()
88 /* Align to nearest multiple of a size */
89 static inline uint32_t lfs_aligndown(uint32_t a, uint32_t alignment) in lfs_aligndown() argument
91 return a - (a % alignment); in lfs_aligndown()
94 static inline uint32_t lfs_alignup(uint32_t a, uint32_t alignment) in lfs_alignup() argument
96 return lfs_aligndown(a + alignment-1, alignment); in lfs_alignup()
[all …]
|
| /Zephyr-Core-3.4.0/tests/posix/common/src/ |
| D | fnmatch.c | 20 zassert_equal(fnmatch("*.a", "foo.c", 0), FNM_NOMATCH); in ZTEST()
24 zassert_equal(fnmatch("a\\*.c", "a*.c", FNM_NOESCAPE), FNM_NOMATCH); in ZTEST()
25 zassert_equal(fnmatch("a\\*.c", "ax.c", 0), FNM_NOMATCH); in ZTEST()
26 zassert_ok(fnmatch("a[xy].c", "ax.c", 0)); in ZTEST()
27 zassert_ok(fnmatch("a[!y].c", "ax.c", 0)); in ZTEST()
28 zassert_equal(fnmatch("a[a/z]*.c", "a/x.c", FNM_PATHNAME), FNM_NOMATCH); in ZTEST()
29 zassert_ok(fnmatch("a/*.c", "a/x.c", FNM_PATHNAME)); in ZTEST()
30 zassert_equal(fnmatch("a*.c", "a/x.c", FNM_PATHNAME), FNM_NOMATCH); in ZTEST()
35 zassert_ok(fnmatch("[!]a-]", "b", 0)); in ZTEST()
40 /* zassert_ok(fnmatch("a[/]b", "a/b", 0)); */ in ZTEST()
[all …]
|
| /Zephyr-Core-3.4.0/include/zephyr/sys/ |
| D | atomic_builtin.h | 27 * This routine performs an atomic compare-and-set on @a target. If the current
28 * value of @a target equals @a old_value, @a target is set to @a new_value.
29 * If the current value of @a target does not equal @a old_value, @a target
32 * @note As for all atomic APIs, includes a
38 * @return true if @a new_value is written, false otherwise.
51 * This routine performs an atomic compare-and-set on @a target. If the current
52 * value of @a target equals @a old_value, @a target is set to @a new_value.
53 * If the current value of @a target does not equal @a old_value, @a target
56 * @note As for all atomic APIs, includes a
62 * @return true if @a new_value is written, false otherwise.
[all …]
|
| D | math_extras_impl.h | 32 static inline bool u16_add_overflow(uint16_t a, uint16_t b, uint16_t *result) in u16_add_overflow() argument
34 return __builtin_add_overflow(a, b, result); in u16_add_overflow()
37 static inline bool u32_add_overflow(uint32_t a, uint32_t b, uint32_t *result) in u32_add_overflow() argument
39 return __builtin_add_overflow(a, b, result); in u32_add_overflow()
42 static inline bool u64_add_overflow(uint64_t a, uint64_t b, uint64_t *result) in u64_add_overflow() argument
44 return __builtin_add_overflow(a, b, result); in u64_add_overflow()
47 static inline bool size_add_overflow(size_t a, size_t b, size_t *result) in size_add_overflow() argument
49 return __builtin_add_overflow(a, b, result); in size_add_overflow()
52 static inline bool u16_add_overflow(uint16_t a, uint16_t b, uint16_t *result) in u16_add_overflow() argument
54 uint16_t c = a + b; in u16_add_overflow()
[all …]
|
| D | slist.h | 13 * This API is not thread safe, and thus if a list is used across threads,
49 * @brief Provide the primitive to iterate on a list
60 * @param __sl A pointer on a sys_slist_t to iterate on
61 * @param __sn A sys_snode_t pointer to peek each node of the list
67 * @brief Provide the primitive to iterate on a list, from a node in the list
76 * Like SYS_SLIST_FOR_EACH_NODE(), but __dn already contains a node in the list
82 * @param __sl A pointer on a sys_slist_t to iterate on
83 * @param __sn A sys_snode_t pointer to peek each node of the list
90 * @brief Provide the primitive to safely iterate on a list
101 * @param __sl A pointer on a sys_slist_t to iterate on
[all …]
|
| D | sflist.h | 13 * This API is not thread safe, and thus if a list is used across threads,
55 * @brief Provide the primitive to iterate on a list
66 * @param __sl A pointer on a sys_sflist_t to iterate on
67 * @param __sn A sys_sfnode_t pointer to peek each node of the list
73 * @brief Provide the primitive to iterate on a list, from a node in the list
82 * Like SYS_SFLIST_FOR_EACH_NODE(), but __dn already contains a node in the list
88 * @param __sl A pointer on a sys_sflist_t to iterate on
89 * @param __sn A sys_sfnode_t pointer to peek each node of the list
96 * @brief Provide the primitive to safely iterate on a list
107 * @param __sl A pointer on a sys_sflist_t to iterate on
[all …]
|
| /Zephyr-Core-3.4.0/arch/x86/core/ia32/ |
| D | soft_float_stubs.c | 22 __weak void __addtf3(long double a, long double b) in __addtf3() argument
27 __weak void __addxf3(long double a, long double b) in __addxf3() argument
32 __weak void __subtf3(long double a, long double b) in __subtf3() argument
37 __weak void __subxf3(long double a, long double b) in __subxf3() argument
42 __weak void __multf3(long double a, long double b) in __multf3() argument
47 __weak void __mulxf3(long double a, long double b) in __mulxf3() argument
52 __weak void __divtf3(long double a, long double b) in __divtf3() argument
57 __weak void __divxf3(long double a, long double b) in __divxf3() argument
62 __weak void __negtf2(long double a) in __negtf2() argument
67 __weak void __negxf2(long double a) in __negxf2() argument
[all …]
|
| /Zephyr-Core-3.4.0/doc/kernel/services/data_passing/ |
| D | fifos.rst | 6 A :dfn:`FIFO` is a kernel object that implements a traditional
20 A FIFO has the following key properties:
22 * A **queue** of data items that have been added but not yet removed.
23 The queue is implemented as a simple linked list.
25 A FIFO must be initialized before it can be used. This sets its queue to empty.
27 FIFO data items must be aligned on a word boundary, as the kernel reserves
28 the first word of an item for use as a pointer to the next data item in
29 the queue. Consequently, a data item that holds N bytes of application
37 data queues. Any attempt to re-add a FIFO data item to a queue before
41 A data item may be **added** to a FIFO by a thread or an ISR.
[all …]
|
| D | stacks.rst | 6 A :dfn:`stack` is a kernel object that implements a traditional
8 to add and remove a limited number of integer data values.
20 A stack has the following key properties:
22 * A **queue** of integer data values that have been added but not yet removed.
24 and must be aligned on a native word boundary.
28 * A **maximum quantity** of data values that can be queued in the array.
30 A stack must be initialized before it can be used. This sets its queue to empty.
32 A data value can be **added** to a stack by a thread or an ISR.
33 The value is given directly to a waiting thread, if one exists;
38 and prevent attempts to add a data value to a stack that has already reached
[all …]
|
| D | mailboxes.rst | 6 A :dfn:`mailbox` is a kernel object that provides enhanced message queue
7 capabilities that go beyond the capabilities of a message queue object.
8 A mailbox allows threads to send and receive messages of any size
21 A mailbox has the following key properties:
23 * A **send queue** of messages that have been sent but not yet received.
25 * A **receive queue** of threads that are waiting to receive a message.
27 A mailbox must be initialized before it can be used. This sets both of its
30 A mailbox allows threads, but not ISRs, to exchange messages.
31 A thread that sends a message is known as the **sending thread**,
32 while a thread that receives the message is known as the **receiving thread**.
[all …]
|
| D | lifos.rst | 6 A :dfn:`LIFO` is a kernel object that implements a traditional
20 A LIFO has the following key properties:
22 * A **queue** of data items that have been added but not yet removed.
23 The queue is implemented as a simple linked list.
25 A LIFO must be initialized before it can be used. This sets its queue to empty.
27 LIFO data items must be aligned on a word boundary, as the kernel reserves
28 the first word of an item for use as a pointer to the next data item in the
29 queue. Consequently, a data item that holds N bytes of application data
37 data queues. Any attempt to re-add a LIFO data item to a queue before
41 A data item may be **added** to a LIFO by a thread or an ISR.
[all …]
|
| /Zephyr-Core-3.4.0/doc/kernel/data_structures/ |
| D | rbtree.rst | 7 a list becomes problematic due to algorithmic costs of searching it.
8 For these situations, Zephyr provides a balanced tree implementation
10 O(log2(N)) for a tree of size N. This is implemented using a
13 The :c:struct:`rbtree` tracking struct for a rbtree may be initialized
18 Unlike a list, where position is explicit, the ordering of nodes
19 within an rbtree must be provided as a predicate function by the user.
20 A function of type :c:func:`rb_lessthan_t` should be assigned to the
23 return a boolean True value if the first node argument is "less than"
25 not allowed, nodes within a tree must have a single fixed order for
29 represented as a :c:struct:`rbnode` structure which exists in
[all …]
|
| /Zephyr-Core-3.4.0/subsys/testsuite/ztest/include/zephyr/ |
| D | ztest_assert.h | 159 * @brief Fail the test, if @a cond is false
169 * @param default_msg Message to print if @a cond is false
170 * @param msg Optional, can be NULL. Message to print if @a cond is false.
192 * @brief Skip the test, if @a cond is false
201 * would otherwise fail due to a zassert on some other dependent behavior that is *not* under test,
202 * thus reducing what could be tens to hundreds of assertion failures to investigate down to a few
206 * @param default_msg Message to print if @a cond is false
207 * @param msg Optional, can be NULL. Message to print if @a cond is false.
229 * @brief If @a cond is false, fail the test but continue its execution.
235 * @param default_msg Message to print if @a cond is false
[all …]
|
| /Zephyr-Core-3.4.0/doc/project/ |
| D | proposals.rst | 10 Changes to existing features that are not considered a bug and would not
11 block a release. This is an incremental enhancement to a feature that already
15 A request for the implementation or inclusion of a new unit of functionality
20 A committed and planned unit of functionality with a detailed design and
22 and must be vetted and discussed in the TSC before a target milestone is set.
25 A request or plan to port an existing feature or enhancement to a particular
26 hardware platform. This ranges from porting Zephyr itself to a new
27 architecture, SoC or board to adding an implementation of a peripheral driver
31 A label to group other GitHub issues that are part of a single feature or unit
36 This is the formal way for asking for a new feature in Zephyr and indicating its
[all …]
|
| /Zephyr-Core-3.4.0/doc/kernel/services/timing/ |
| D | timers.rst | 6 A :dfn:`timer` is a kernel object that measures the passage of time
7 using the kernel's system clock. When a timer's specified time limit
22 A timer has the following key properties:
24 * A **duration** specifying the time interval before the timer
25 expires for the first time. This is a ``k_timeout_t`` value that
28 * A **period** specifying the time interval between all timer
29 expirations after the first one, also a ``k_timeout_t``. It must be
30 non-negative. A period of ``K_NO_WAIT`` (i.e. zero) or
31 ``K_FOREVER`` means that the timer is a one shot timer that stops
32 after a single expiration. (For example then, if a timer is started
[all …]
|
| /Zephyr-Core-3.4.0/include/zephyr/bluetooth/ |
| D | addr.h | 40 /** Length in bytes of a standard Bluetooth address */
55 bt_addr_t a; member
64 /** Bluetooth device "any" address, not a valid address */
66 /** Bluetooth device "none" address, not a valid address */
68 /** Bluetooth LE device "any" address, not a valid address */
70 /** Bluetooth LE device "none" address, not a valid address */
75 * @param a First Bluetooth device address to compare
78 * @return negative value if @a a < @a b, 0 if @a a == @a b, else positive
80 static inline int bt_addr_cmp(const bt_addr_t *a, const bt_addr_t *b) in bt_addr_cmp() argument
82 return memcmp(a, b, sizeof(*a)); in bt_addr_cmp()
[all …]
|
| /Zephyr-Core-3.4.0/doc/kernel/services/synchronization/ |
| D | semaphores.rst | 6 A :dfn:`semaphore` is a kernel object that implements a traditional
19 A semaphore has the following key properties:
21 * A **count** that indicates the number of times the semaphore can be taken.
22 A count of zero indicates that the semaphore is unavailable.
24 * A **limit** that indicates the maximum value the semaphore's count
27 A semaphore must be initialized before it can be used. Its count must be set
28 to a non-negative value that is less than or equal to its limit.
30 A semaphore may be **given** by a thread or an ISR. Giving the semaphore
33 A semaphore may be **taken** by a thread. Taking the semaphore
35 When a semaphore is unavailable a thread may choose to wait for it to be given.
[all …]
|
| /Zephyr-Core-3.4.0/subsys/rtio/ |
| D | Kconfig | 10 bool "A simple executor for RTIO"
13 An simple RTIO executor that will execute a queue of requested I/O
14 operations as if they are a single chain of submission queue entries. This
18 bool "A low cost concurrent executor for RTIO"
21 A low memory cost RTIO executor that will execute a queue of requested I/O
22 with a fixed amount of concurrency using minimal memory overhead.
25 bool "Use a semaphore when waiting for completions in rtio_submit"
27 When calling rtio_submit a semaphore is available to sleep the calling
29 adds a small RAM overhead for a single semaphore. By default wait_for will
30 use polling on the completion queue with a k_yield() in between iterations.
[all …]
|
| /Zephyr-Core-3.4.0/doc/kernel/services/threads/ |
| D | workqueue.rst | 10 A :dfn:`workqueue` is a kernel object that uses a dedicated thread to process
11 work items in a first in, first out manner. Each work item is processed by
12 calling the function specified by the work item. A workqueue is typically
13 used by an ISR or a high-priority thread to offload non-urgent processing
14 to a lower-priority thread so it does not impact time-sensitive processing.
19 A workqueue has the following key properties:
21 * A **queue** of work items that have been added, but not yet processed.
23 * A **thread** that processes the work items in the queue. The priority of the
28 between each submitted work item, to prevent a cooperative workqueue from
31 A workqueue must be initialized before it can be used. This sets its queue to
[all …]
|
| /Zephyr-Core-3.4.0/doc/ |
| D | glossary.rst | 12 (Application Program Interface) A defined set of routines and protocols for
17 to build an application image for a specified board configuration.
21 to create a custom kernel that makes efficient use of the board's
28 A binary file that is loaded and executed by the board for which
31 Zephyr kernel code needed to support it. They are compiled as a single,
33 Once an application image is loaded onto a board, the image takes control
36 within a single shared address space.
39 A target system with a defined set of devices and capabilities,
41 hardware system or a simulated system running under QEMU.
42 The Zephyr kernel supports a :ref:`variety of boards <boards>`.
[all …]
|
| /Zephyr-Core-3.4.0/doc/kernel/memory_management/ |
| D | slabs.rst | 6 A :dfn:`memory slab` is a kernel object that allows memory blocks
7 to be dynamically allocated from a designated memory region.
8 All memory blocks in a memory slab have a single fixed size,
22 A memory slab has the following key properties:
30 * A **buffer** that provides the memory for the memory slab's blocks.
34 N is a power of 2 larger than 2 (i.e. 4, 8, 16, ...). To ensure that
36 the block size must also be a multiple of N.
38 A memory slab must be initialized before it can be used. This marks all of
41 A thread that needs to use a memory block simply allocates it from a memory
42 slab. When the thread finishes with a memory block,
[all …]
|
| /Zephyr-Core-3.4.0/include/zephyr/dt-bindings/gpio/ |
| D | digilent-pmod.h | 38 * @brief IO[n] signal on a Pmod GPIO nexus node following
39 * Pmod Interface Type 1 or 1A (GPIO or expanded GPIO)
48 * @brief SPI CS signal index on a Pmod GPIO nexus node.
54 * @brief SPI MOSI signal index on a Pmod GPIO nexus node.
60 * @brief SPI MISO signal index on a Pmod GPIO nexus node.
66 * @brief SPI SCK signal index on a Pmod GPIO nexus node.
74 * @brief SPI CS signal index on a Pmod GPIO nexus node.
75 * Used with Pmod Interface Type 2A (expanded SPI) peripherals.
80 * @brief SPI MOSI signal index on a Pmod GPIO nexus node.
81 * Used with Pmod Interface Type 2A (expanded SPI) peripherals.
[all …]
|
| /Zephyr-Core-3.4.0/samples/drivers/ipm/ipm_esp32/ |
| D | README.rst | 11 ESP32 has two CPU named APP and PRO, in this simple example PRO send a
41 PRO_CPU is sending a fake request, waiting remote response...
42 PRO_CPU received a message from APP_CPU : APP_CPU: This is a response
43 PRO_CPU is sending a fake request, waiting remote response...
44 PRO_CPU received a message from APP_CPU : APP_CPU: This is a response
45 PRO_CPU is sending a fake request, waiting remote response...
46 PRO_CPU received a message from APP_CPU : APP_CPU: This is a response
47 PRO_CPU is sending a fake request, waiting remote response...
48 PRO_CPU received a message from APP_CPU : APP_CPU: This is a response
49 PRO_CPU is sending a fake request, waiting remote response...
[all …]
|
