diff options
author | Jason Ekstrand <[email protected]> | 2018-07-25 10:37:53 -0700 |
---|---|---|
committer | Jason Ekstrand <[email protected]> | 2018-07-29 13:39:35 -0700 |
commit | 5c1c6939ce384dbcae690ed4d5fbfca3ae240844 (patch) | |
tree | bfe5ac3ee213de7d68ee5781baec3d033ada67db /src/util/list.h | |
parent | 0ddae4acae08cc6b216c49f85c6ffb969dea0969 (diff) |
util/list: Make some helpers take const lists
They're all just querying things about the list and not mutating
anything.
Reviewed-by: Thomas Helland<[email protected]>
Reviewed-by: Christian Gmeiner <[email protected]>
Diffstat (limited to 'src/util/list.h')
-rw-r--r-- | src/util/list.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/util/list.h b/src/util/list.h index 6edb7501109..09d1b4cae64 100644 --- a/src/util/list.h +++ b/src/util/list.h @@ -72,7 +72,7 @@ static inline void list_addtail(struct list_head *item, struct list_head *list) list->prev = item; } -static inline bool list_empty(struct list_head *list); +static inline bool list_empty(const struct list_head *list); static inline void list_replace(struct list_head *from, struct list_head *to) { @@ -101,7 +101,7 @@ static inline void list_delinit(struct list_head *item) item->prev = item; } -static inline bool list_empty(struct list_head *list) +static inline bool list_empty(const struct list_head *list) { return list->next == list; } @@ -114,7 +114,7 @@ static inline bool list_is_singular(const struct list_head *list) return list->next != NULL && list->next != list && list->next->next == list; } -static inline unsigned list_length(struct list_head *list) +static inline unsigned list_length(const struct list_head *list) { struct list_head *node; unsigned length = 0; @@ -145,7 +145,7 @@ static inline void list_splicetail(struct list_head *src, struct list_head *dst) dst->prev = src->prev; } -static inline void list_validate(struct list_head *list) +static inline void list_validate(const struct list_head *list) { struct list_head *node; assert(list->next->prev == list && list->prev->next == list); |