Skip to content

Commit 1a64977

Browse files
pdgendtnashif
authored andcommitted
sys: dlist: Add const qualifier to immutable API functions
Allow passing structs with sys_dlist_t members as const without discarding qualifiers if the API is used without modifying it. Signed-off-by: Pieter De Gendt <[email protected]>
1 parent dde8067 commit 1a64977

File tree

1 file changed

+16
-16
lines changed

1 file changed

+16
-16
lines changed

include/zephyr/sys/dlist.h

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -244,7 +244,7 @@ static inline bool sys_dnode_is_linked(const sys_dnode_t *node)
244244
* @return true if node is the head, false otherwise
245245
*/
246246

247-
static inline bool sys_dlist_is_head(sys_dlist_t *list, sys_dnode_t *node)
247+
static inline bool sys_dlist_is_head(const sys_dlist_t *list, const sys_dnode_t *node)
248248
{
249249
return list->head == node;
250250
}
@@ -258,7 +258,7 @@ static inline bool sys_dlist_is_head(sys_dlist_t *list, sys_dnode_t *node)
258258
* @return true if node is the tail, false otherwise
259259
*/
260260

261-
static inline bool sys_dlist_is_tail(sys_dlist_t *list, sys_dnode_t *node)
261+
static inline bool sys_dlist_is_tail(const sys_dlist_t *list, const sys_dnode_t *node)
262262
{
263263
return list->tail == node;
264264
}
@@ -271,7 +271,7 @@ static inline bool sys_dlist_is_tail(sys_dlist_t *list, sys_dnode_t *node)
271271
* @return true if empty, false otherwise
272272
*/
273273

274-
static inline bool sys_dlist_is_empty(sys_dlist_t *list)
274+
static inline bool sys_dlist_is_empty(const sys_dlist_t *list)
275275
{
276276
return list->head == list;
277277
}
@@ -286,7 +286,7 @@ static inline bool sys_dlist_is_empty(sys_dlist_t *list)
286286
* @return true if multiple nodes, false otherwise
287287
*/
288288

289-
static inline bool sys_dlist_has_multiple_nodes(sys_dlist_t *list)
289+
static inline bool sys_dlist_has_multiple_nodes(const sys_dlist_t *list)
290290
{
291291
return list->head != list->tail;
292292
}
@@ -299,7 +299,7 @@ static inline bool sys_dlist_has_multiple_nodes(sys_dlist_t *list)
299299
* @return a pointer to the head element, NULL if list is empty
300300
*/
301301

302-
static inline sys_dnode_t *sys_dlist_peek_head(sys_dlist_t *list)
302+
static inline sys_dnode_t *sys_dlist_peek_head(const sys_dlist_t *list)
303303
{
304304
return sys_dlist_is_empty(list) ? NULL : list->head;
305305
}
@@ -314,7 +314,7 @@ static inline sys_dnode_t *sys_dlist_peek_head(sys_dlist_t *list)
314314
* @return a pointer to the head element
315315
*/
316316

317-
static inline sys_dnode_t *sys_dlist_peek_head_not_empty(sys_dlist_t *list)
317+
static inline sys_dnode_t *sys_dlist_peek_head_not_empty(const sys_dlist_t *list)
318318
{
319319
return list->head;
320320
}
@@ -330,8 +330,8 @@ static inline sys_dnode_t *sys_dlist_peek_head_not_empty(sys_dlist_t *list)
330330
* @return a pointer to the next element from a node, NULL if node is the tail
331331
*/
332332

333-
static inline sys_dnode_t *sys_dlist_peek_next_no_check(sys_dlist_t *list,
334-
sys_dnode_t *node)
333+
static inline sys_dnode_t *sys_dlist_peek_next_no_check(const sys_dlist_t *list,
334+
const sys_dnode_t *node)
335335
{
336336
return (node == list->tail) ? NULL : node->next;
337337
}
@@ -346,8 +346,8 @@ static inline sys_dnode_t *sys_dlist_peek_next_no_check(sys_dlist_t *list,
346346
* or NULL (when node comes from reading the head of an empty list).
347347
*/
348348

349-
static inline sys_dnode_t *sys_dlist_peek_next(sys_dlist_t *list,
350-
sys_dnode_t *node)
349+
static inline sys_dnode_t *sys_dlist_peek_next(const sys_dlist_t *list,
350+
const sys_dnode_t *node)
351351
{
352352
return (node != NULL) ? sys_dlist_peek_next_no_check(list, node) : NULL;
353353
}
@@ -364,8 +364,8 @@ static inline sys_dnode_t *sys_dlist_peek_next(sys_dlist_t *list,
364364
* tail
365365
*/
366366

367-
static inline sys_dnode_t *sys_dlist_peek_prev_no_check(sys_dlist_t *list,
368-
sys_dnode_t *node)
367+
static inline sys_dnode_t *sys_dlist_peek_prev_no_check(const sys_dlist_t *list,
368+
const sys_dnode_t *node)
369369
{
370370
return (node == list->head) ? NULL : node->prev;
371371
}
@@ -381,8 +381,8 @@ static inline sys_dnode_t *sys_dlist_peek_prev_no_check(sys_dlist_t *list,
381381
* list).
382382
*/
383383

384-
static inline sys_dnode_t *sys_dlist_peek_prev(sys_dlist_t *list,
385-
sys_dnode_t *node)
384+
static inline sys_dnode_t *sys_dlist_peek_prev(const sys_dlist_t *list,
385+
const sys_dnode_t *node)
386386
{
387387
return (node != NULL) ? sys_dlist_peek_prev_no_check(list, node) : NULL;
388388
}
@@ -395,7 +395,7 @@ static inline sys_dnode_t *sys_dlist_peek_prev(sys_dlist_t *list,
395395
* @return a pointer to the tail element, NULL if list is empty
396396
*/
397397

398-
static inline sys_dnode_t *sys_dlist_peek_tail(sys_dlist_t *list)
398+
static inline sys_dnode_t *sys_dlist_peek_tail(const sys_dlist_t *list)
399399
{
400400
return sys_dlist_is_empty(list) ? NULL : list->tail;
401401
}
@@ -563,7 +563,7 @@ static inline sys_dnode_t *sys_dlist_get(sys_dlist_t *list)
563563
*
564564
* @return an integer equal to the size of the list, or 0 if empty
565565
*/
566-
static inline size_t sys_dlist_len(sys_dlist_t *list)
566+
static inline size_t sys_dlist_len(const sys_dlist_t *list)
567567
{
568568
size_t len = 0;
569569
sys_dnode_t *node = NULL;

0 commit comments

Comments
 (0)