src/rdunittest.c
static struct ut_tq *ut_tq_find_prev_pos (const struct ut_tq_head *head,
                                          int val) {
        struct ut_tq *e, *prev = NULL;

        TAILQ_FOREACH(e, head, link) {
                if (e->v > val)
                        return prev;
                prev = e;
        }

        return prev;
}
/**
 * @brief Find the previous element (insert position) for
 *        value \p val in list \p head or NULL if \p val is less than
 *        the first element in \p head.
 * @remarks \p head must be ascending sorted.
 */
@brief Find the previous element (insert position) for
value \p val in list \p head or NULL if \p val is less than
the first element in \p head.
@remarks \p head must be ascending sorted.
@brief Find the previous element ( insert position ) for value \ p val in list \ p head or NULL if \ p val is less than the first element in \ p head . @remarks \ p head must be ascending sorted .
static struct ut_tq *ut_tq_find_prev_pos (const struct ut_tq_head *head,
                                          int val) {
        struct ut_tq *e, *prev = NULL;
        TAILQ_FOREACH(e, head, link) {
                if (e->v > val)
                        return prev;
                prev = e;
        }
        return prev;
}
static struct ut_tq * ut_tq_find_prev_pos ( const struct ut_tq_head * head , int val ) { struct ut_tq * e , * prev = NULL ; TAILQ_FOREACH ( e , head , link ) { if ( e -> v > val ) return prev ; prev = e ; } return prev ; }
@brief Find the previous element (insert position) for
        value \p val in list \p head or NULL if \p val is less than
        the first element in \p head.
@brief Find the previous element ( insert position ) for value \ p val in list \ p head or NULL if \ p val is less than the first element in \ p head .