@@ -244,7 +244,7 @@ static inline bool sys_dnode_is_linked(const sys_dnode_t *node)
244
244
* @return true if node is the head, false otherwise
245
245
*/
246
246
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 )
248
248
{
249
249
return list -> head == node ;
250
250
}
@@ -258,7 +258,7 @@ static inline bool sys_dlist_is_head(sys_dlist_t *list, sys_dnode_t *node)
258
258
* @return true if node is the tail, false otherwise
259
259
*/
260
260
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 )
262
262
{
263
263
return list -> tail == node ;
264
264
}
@@ -271,7 +271,7 @@ static inline bool sys_dlist_is_tail(sys_dlist_t *list, sys_dnode_t *node)
271
271
* @return true if empty, false otherwise
272
272
*/
273
273
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 )
275
275
{
276
276
return list -> head == list ;
277
277
}
@@ -286,7 +286,7 @@ static inline bool sys_dlist_is_empty(sys_dlist_t *list)
286
286
* @return true if multiple nodes, false otherwise
287
287
*/
288
288
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 )
290
290
{
291
291
return list -> head != list -> tail ;
292
292
}
@@ -299,7 +299,7 @@ static inline bool sys_dlist_has_multiple_nodes(sys_dlist_t *list)
299
299
* @return a pointer to the head element, NULL if list is empty
300
300
*/
301
301
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 )
303
303
{
304
304
return sys_dlist_is_empty (list ) ? NULL : list -> head ;
305
305
}
@@ -314,7 +314,7 @@ static inline sys_dnode_t *sys_dlist_peek_head(sys_dlist_t *list)
314
314
* @return a pointer to the head element
315
315
*/
316
316
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 )
318
318
{
319
319
return list -> head ;
320
320
}
@@ -330,8 +330,8 @@ static inline sys_dnode_t *sys_dlist_peek_head_not_empty(sys_dlist_t *list)
330
330
* @return a pointer to the next element from a node, NULL if node is the tail
331
331
*/
332
332
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 )
335
335
{
336
336
return (node == list -> tail ) ? NULL : node -> next ;
337
337
}
@@ -346,8 +346,8 @@ static inline sys_dnode_t *sys_dlist_peek_next_no_check(sys_dlist_t *list,
346
346
* or NULL (when node comes from reading the head of an empty list).
347
347
*/
348
348
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 )
351
351
{
352
352
return (node != NULL ) ? sys_dlist_peek_next_no_check (list , node ) : NULL ;
353
353
}
@@ -364,8 +364,8 @@ static inline sys_dnode_t *sys_dlist_peek_next(sys_dlist_t *list,
364
364
* tail
365
365
*/
366
366
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 )
369
369
{
370
370
return (node == list -> head ) ? NULL : node -> prev ;
371
371
}
@@ -381,8 +381,8 @@ static inline sys_dnode_t *sys_dlist_peek_prev_no_check(sys_dlist_t *list,
381
381
* list).
382
382
*/
383
383
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 )
386
386
{
387
387
return (node != NULL ) ? sys_dlist_peek_prev_no_check (list , node ) : NULL ;
388
388
}
@@ -395,7 +395,7 @@ static inline sys_dnode_t *sys_dlist_peek_prev(sys_dlist_t *list,
395
395
* @return a pointer to the tail element, NULL if list is empty
396
396
*/
397
397
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 )
399
399
{
400
400
return sys_dlist_is_empty (list ) ? NULL : list -> tail ;
401
401
}
@@ -563,7 +563,7 @@ static inline sys_dnode_t *sys_dlist_get(sys_dlist_t *list)
563
563
*
564
564
* @return an integer equal to the size of the list, or 0 if empty
565
565
*/
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 )
567
567
{
568
568
size_t len = 0 ;
569
569
sys_dnode_t * node = NULL ;
0 commit comments