/* Start the real work */
if( p_playlist->request.b_request )
{
- PL_DEBUG( "processing request node %s item %s skip %i",
+ PL_DEBUG( "processing request item %s node %s skip %i",
PLI_NAME( p_playlist->request.p_item ),
PLI_NAME( p_playlist->request.p_node ), i_skip );
p_new = p_playlist->request.p_item;
{
if( i-1 < 0 )
{
- /* Was already the first sibling. Look for uncles */
- PL_DEBUG( "Current item is the first of the node,"
+ /* Was already the first sibling. Look for uncles */
+ PL_DEBUG( "current item is the first of its node,"
"looking for uncle from %s",
p_parent->p_input->psz_name );
+ if( p_parent == p_root )
+ {
+ PL_DEBUG( "already at root" );
+ return NULL;
+ }
return GetPrevUncle( p_playlist, p_item, p_root );
}
else