diff options
| author | Matias Elo <matias.elo@nokia.com> | 2022-09-23 13:15:58 +0300 |
|---|---|---|
| committer | Matias Elo <matias.elo@nokia.com> | 2022-10-07 14:12:02 +0300 |
| commit | 32a630e3898a0306f78b3b6430663873a93de4b5 (patch) | |
| tree | db9f83e0098e1417dfc1946661e667540ad016b4 /platform/linux-generic/include/odp_llqueue.h | |
| parent | 96e86e6f9a9fe9a63f2609c28af6e41ddbf1a9d9 (diff) | |
linux-gen: debug: prefix implementation internal debug macros
Prefix implementation internal debug macro names with underscore.
Signed-off-by: Matias Elo <matias.elo@nokia.com>
Reviewed-by: Petri Savolainen <petri.savolainen@nokia.com>
Diffstat (limited to 'platform/linux-generic/include/odp_llqueue.h')
| -rw-r--r-- | platform/linux-generic/include/odp_llqueue.h | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/platform/linux-generic/include/odp_llqueue.h b/platform/linux-generic/include/odp_llqueue.h index 6340d111a..29810ebf3 100644 --- a/platform/linux-generic/include/odp_llqueue.h +++ b/platform/linux-generic/include/odp_llqueue.h @@ -84,7 +84,7 @@ static inline void llq_enqueue(struct llqueue *llq, struct llnode *node) { union llht old, neu; - ODP_ASSERT(node->next == NULL); + _ODP_ASSERT(node->next == NULL); node->next = SENTINEL; do { old.ui = lld(&llq->u.ui, __ATOMIC_RELAXED); @@ -93,7 +93,7 @@ static inline void llq_enqueue(struct llqueue *llq, struct llnode *node) } while (odp_unlikely(scd(&llq->u.ui, neu.ui, __ATOMIC_RELEASE))); if (old.st.tail != NULL) { /* List was not empty */ - ODP_ASSERT(old.st.tail->next == SENTINEL); + _ODP_ASSERT(old.st.tail->next == SENTINEL); old.st.tail->next = node; } } @@ -230,7 +230,7 @@ static inline void llqueue_init(struct llqueue *llq) static inline void llq_enqueue(struct llqueue *llq, struct llnode *node) { - ODP_ASSERT(node->next == NULL); + _ODP_ASSERT(node->next == NULL); node->next = SENTINEL; odp_spinlock_lock(&llq->lock); @@ -257,11 +257,11 @@ static inline struct llnode *llq_dequeue(struct llqueue *llq) if (llq->head != NULL) { node = llq->head; if (llq->head == llq->tail) { - ODP_ASSERT(node->next == SENTINEL); + _ODP_ASSERT(node->next == SENTINEL); llq->head = NULL; llq->tail = NULL; } else { - ODP_ASSERT(node->next != SENTINEL); + _ODP_ASSERT(node->next != SENTINEL); llq->head = node->next; } node->next = NULL; @@ -279,11 +279,11 @@ static inline odp_bool_t llq_dequeue_cond(struct llqueue *llq, if (odp_likely(llq->head != NULL && llq->head == node)) { success = true; if (llq->head == llq->tail) { - ODP_ASSERT(node->next == SENTINEL); + _ODP_ASSERT(node->next == SENTINEL); llq->head = NULL; llq->tail = NULL; } else { - ODP_ASSERT(node->next != SENTINEL); + _ODP_ASSERT(node->next != SENTINEL); llq->head = node->next; } node->next = NULL; @@ -302,7 +302,7 @@ static inline odp_bool_t llq_cond_rotate(struct llqueue *llq, if (odp_likely(llq->head == node)) { success = true; if (llq->tail != node) { - ODP_ASSERT(node->next != SENTINEL); + _ODP_ASSERT(node->next != SENTINEL); llq->head = node->next; llq->tail->next = node; llq->tail = node; |