Searched full:dlist (Results 1 – 25 of 52) sorted by relevance
123
29 A dlist can be modified in constant time by removing a node with34 As for slist, each node in a dlist can be processed in a natural code42 Convenience utilities provided by dlist include47 not a node is currently linked into a dlist or not (via an53 Internally, the dlist implementation is minimal: the :c:type:`sys_dlist_t`71 Effectively, a dlist of N nodes can be thought of as a "ring" of "N+1"74 .. figure:: dlist.png76 :alt: dlist example79 A dlist containing three elements. Note that the list struct82 .. figure:: dlist-single.png[all …]
34 dlist.rst
28 As with the slist and dlist containers, nodes within an rbtree are111 implemented with no more runtime storage overhead than a dlist.
10 * @defgroup lib_dlist_tests Dlist14 #include <zephyr/sys/dlist.h>26 * @brief Test whether dlist node struct is embeddedable30 * dlist node.Appending nodes into the doubly-linked list47 /* Initialize an user-defiend structure of contains dlist node */ in ZTEST()88 * @brief Test dlist for each function181 * dlist have, get head and tail from the dlist directly.the time201 "dlist can't access 'head' in constant time"); in ZTEST()206 "dlist can't access 'tail' in constant time"); in ZTEST()216 * no matter the size of a dlist.[all …]
2 benchmark.data_structure_perf.dlist:7 - dlist
5 project(dlist) project
8 #include <zephyr/sys/dlist.h>362 /* Check if the dlist is empty */ in ZTEST()366 /* Check if a node can append as head if dlist is empty */ in ZTEST()380 "dlist appended incorrectly"); in ZTEST()384 "dlist appended incorrectly"); in ZTEST()388 "dlist appended incorrectly"); in ZTEST()391 "dlist appended incorrectly"); in ZTEST()395 "dlist appended incorrectly"); in ZTEST()399 "dlist appended incorrectly"); in ZTEST()403 "dlist appended incorrectly"); in ZTEST()
13 dlist.c
5 # Test whiteboxes the wait_q and expects it to be a dlist
10 #include <zephyr/sys/dlist.h>
27 #include <zephyr/sys/dlist.h>
26 #include <zephyr/sys/dlist.h>
33 #include <zephyr/sys/dlist.h>
32 #include <zephyr/sys/dlist.h>
13 #include <zephyr/sys/dlist.h>
16 #include <zephyr/sys/dlist.h>116 /** dlist device node */118 /** dlist host list */
38 #include <zephyr/sys/dlist.h>
37 #include <zephyr/sys/dlist.h>
16 #include <zephyr/sys/dlist.h>
237 /* <375> [...]/zephyr/include/zephyr/sys/dlist.h:37 */243 /* <397> [...]/zephyr/include/zephyr/sys/dlist.h:36 */258 /* <3b7> [...]/zephyr/include/zephyr/sys/dlist.h:41 */
12 #include <zephyr/sys/dlist.h>
19 #include <zephyr/sys/dlist.h>50 /** dlist node */174 /** dlist for control transfers */176 /** dlist for bulk transfers */
20 #include <zephyr/sys/dlist.h>