Function lwp_map_find_first

components/lwp/lwp_avl.c:279–294

 *       the minimum element in the tree. It's commonly used for ordered traversal starting point.
 */
rt_weak struct lwp_avl_struct* lwp_map_find_first(struct lwp_avl_struct* ptree)
{
    if (ptree == AVL_EMPTY)
    {
        return (struct lwp_avl_struct *)0;
    }
    while (1)
    {
        if (!ptree->avl_left)
        {
            break;
        }
        ptree = ptree->avl_left;
    }
    return ptree;
}