Searched refs:slist (Results 1 – 14 of 14) sorted by relevance
| /Zephyr-latest/include/zephyr/sys/ |
| D | slist.h | 67 Z_GENLIST_FOR_EACH_NODE(slist, __sl, __sn)
90 Z_GENLIST_ITERATE_FROM_NODE(slist, __sl, __sn)
109 Z_GENLIST_FOR_EACH_NODE_SAFE(slist, __sl, __sn, __sns)
130 Z_GENLIST_PEEK_HEAD_CONTAINER(slist, __sl, __cn, __n)
140 Z_GENLIST_PEEK_TAIL_CONTAINER(slist, __sl, __cn, __n)
149 Z_GENLIST_PEEK_NEXT_CONTAINER(slist, __cn, __n)
166 Z_GENLIST_FOR_EACH_CONTAINER(slist, __sl, __cn, __n)
184 Z_GENLIST_FOR_EACH_CONTAINER_SAFE(slist, __sl, __cn, __cns, __n)
268 Z_GENLIST_IS_EMPTY(slist)
281 Z_GENLIST_PEEK_NEXT_NO_CHECK(slist, snode)
[all …]
|
| /Zephyr-latest/tests/kernel/queue/src/ |
| D | test_queue_fail.c | 109 sys_slist_t slist; in ZTEST() local
112 sys_slist_init(&slist); in ZTEST()
116 zassert_true(k_queue_merge_slist(&queue, &slist) == -EINVAL, in ZTEST()
119 sys_slist_append(&slist, (sys_snode_t *)&(data_sl[0].snode)); in ZTEST()
120 sys_slist_append(&slist, (sys_snode_t *)&(data_sl[1].snode)); in ZTEST()
121 slist.tail = NULL; in ZTEST()
122 zassert_true(k_queue_merge_slist(&queue, &slist) != 0, in ZTEST()
|
| D | test_queue_contexts.c | 57 sys_slist_t slist; in tqueue_append() local
59 sys_slist_init(&slist); in tqueue_append()
60 sys_slist_append(&slist, (sys_snode_t *)&(data_sl[0].snode)); in tqueue_append()
61 sys_slist_append(&slist, (sys_snode_t *)&(data_sl[1].snode)); in tqueue_append()
62 k_queue_merge_slist(pqueue, &slist); in tqueue_append()
|
| /Zephyr-latest/tests/kernel/fifo/fifo_api/src/ |
| D | test_fifo_contexts.c | 38 sys_slist_t slist; in tfifo_put() local
40 sys_slist_init(&slist); in tfifo_put()
41 sys_slist_append(&slist, (sys_snode_t *)&(data_sl[0].snode)); in tfifo_put()
42 sys_slist_append(&slist, (sys_snode_t *)&(data_sl[1].snode)); in tfifo_put()
43 k_fifo_put_slist(pfifo, &slist); in tfifo_put()
|
| /Zephyr-latest/doc/kernel/data_structures/ |
| D | slist.rst | 49 Finally the slist implementation provides a set of "for each" macros
68 The slist code is designed to be minimal and conventional.
73 .. figure:: slist.png
75 :alt: slist example
78 An slist containing three elements.
80 .. figure:: slist-empty.png
82 :alt: empty slist example
85 An empty slist
106 of "slist") and the additional API described next, it operates in all
107 ways identically to the slist API.
[all …]
|
| D | index.rst | 33 slist.rst
|
| D | dlist.rst | 8 behavior for all the existing slist operations, but also allows for
34 As for slist, each node in a dlist can be processed in a natural code
|
| D | rbtree.rst | 28 As with the slist and dlist containers, nodes within an rbtree are
|
| /Zephyr-latest/tests/unit/list/ |
| D | CMakeLists.txt | 12 slist.c
|
| /Zephyr-latest/subsys/net/lib/prometheus/ |
| D | collector.c | 181 ctx->metric = Z_GENLIST_PEEK_HEAD_CONTAINER(slist, in prometheus_collector_walk_metrics()
185 ctx->tmp = Z_GENLIST_PEEK_NEXT_CONTAINER(slist, in prometheus_collector_walk_metrics()
194 ctx->tmp = Z_GENLIST_PEEK_NEXT_CONTAINER(slist, in prometheus_collector_walk_metrics()
|
| /Zephyr-latest/scripts/pylib/twister/twisterlib/ |
| D | size_calc.py | 162 slist = []
165 slist.append(v["name"])
166 return slist
|
| /Zephyr-latest/doc/releases/ |
| D | release-notes-3.4.rst | 1078 * Fixed a possible slist corruption in case Ethernet interface went up before
|
| D | release-notes-3.2.rst | 1431 * Groups in MCUMGR now use kernel slist entries rather than the custom MCUMGR
2495 * :github:`44824` - mgmt/mcumgr/lib: Use slist in group registration to unify with Zephyr code
|
| D | release-notes-3.1.rst | 1536 * :github:`44495` - sys_slist_append_list and sys_slist_merge_slist corrupt target slist if appende…
|
