X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fplaylist%2Ftree.c;h=196ab807f05c0e8417b17cc6f818fd8bbaa0df14;hb=12ade3e3bc975d5426ba4af155b7372c31093b31;hp=1a8d0cc9245b64bfb10261f107e24db5e7aab698;hpb=d11fd0d1e5433a5299fbf0f0150178178ebd3f83;p=vlc diff --git a/src/playlist/tree.c b/src/playlist/tree.c index 1a8d0cc924..196ab807f0 100644 --- a/src/playlist/tree.c +++ b/src/playlist/tree.c @@ -50,14 +50,15 @@ playlist_item_t *GetPrevItem( playlist_t *p_playlist, * \param p_playlist the playlist * \param psz_name the name of the node * \param p_parent the parent node to attach to or NULL if no attach + * \param i_pos position of the node in the parent, PLAYLIST_END to append to end. * \param p_flags miscellaneous flags * \param p_input the input_item to attach to or NULL if it has to be created * \return the new node */ playlist_item_t * playlist_NodeCreate( playlist_t *p_playlist, const char *psz_name, - playlist_item_t *p_parent, int i_flags, - input_item_t *p_input ) + playlist_item_t *p_parent, int i_pos, + int i_flags, input_item_t *p_input ) { input_item_t *p_new_input = NULL; playlist_item_t *p_item; @@ -67,7 +68,7 @@ playlist_item_t * playlist_NodeCreate( playlist_t *p_playlist, if( !p_input ) p_new_input = input_item_NewWithType( VLC_OBJECT(p_playlist), NULL, - psz_name, 0, NULL, -1, ITEM_TYPE_NODE ); + psz_name, 0, NULL, 0, -1, ITEM_TYPE_NODE ); p_item = playlist_ItemNewFromInput( p_playlist, p_input ? p_input : p_new_input ); if( p_new_input ) @@ -79,10 +80,14 @@ playlist_item_t * playlist_NodeCreate( playlist_t *p_playlist, ARRAY_APPEND(p_playlist->all_items, p_item); if( p_parent != NULL ) - playlist_NodeAppend( p_playlist, p_item, p_parent ); + playlist_NodeInsert( p_playlist, p_item, p_parent, + i_pos == PLAYLIST_END ? -1 : i_pos ); playlist_SendAddNotify( p_playlist, p_item->i_id, p_parent ? p_parent->i_id : -1, !( i_flags & PLAYLIST_NO_REBUILD )); + + p_item->i_flags |= i_flags; + return p_item; } @@ -138,23 +143,13 @@ int playlist_NodeDelete( playlist_t *p_playlist, playlist_item_t *p_root, PL_ASSERT_LOCKED; int i; - if( p_root->i_children == -1 ) - { - return VLC_EGENERIC; - } - /* Delete the children */ - for( i = p_root->i_children - 1 ; i >= 0; i-- ) + for( i = p_root->i_children - 1 ; i >= 0; i-- ) { - if( p_root->pp_children[i]->i_children > -1 ) + if( b_delete_items || p_root->pp_children[i]->i_children > -1 ) { playlist_NodeDelete( p_playlist, p_root->pp_children[i], - b_delete_items , b_force ); - } - else if( b_delete_items ) - { - playlist_DeleteFromItemId( p_playlist, - p_root->pp_children[i]->i_id ); + b_delete_items, b_force ); } } /* Delete the node */ @@ -163,13 +158,37 @@ int playlist_NodeDelete( playlist_t *p_playlist, playlist_item_t *p_root, } else { + pl_priv(p_playlist)->b_reset_currently_playing = true; + int i; - var_SetInteger( p_playlist, "item-deleted", p_root->i_id ); + var_SetInteger( p_playlist, "playlist-item-deleted", p_root->i_id ); ARRAY_BSEARCH( p_playlist->all_items, ->i_id, int, p_root->i_id, i ); if( i != -1 ) ARRAY_REMOVE( p_playlist->all_items, i ); + if( p_root->i_children == -1 ) { + ARRAY_BSEARCH( p_playlist->items,->i_id, int, p_root->i_id, i ); + if( i != -1 ) + ARRAY_REMOVE( p_playlist->items, i ); + } + + /* Check if it is the current item */ + if( get_current_status_item( p_playlist ) == p_root ) + { + /* Stop */ + playlist_Control( p_playlist, PLAYLIST_STOP, pl_Locked ); + msg_Info( p_playlist, "stopping playback" ); + /* This item can't be the next one to be played ! */ + set_current_status_item( p_playlist, NULL ); + } + + ARRAY_BSEARCH( p_playlist->current,->i_id, int, p_root->i_id, i ); + if( i != -1 ) + ARRAY_REMOVE( p_playlist->current, i ); + + PL_DEBUG( "deleting item `%s'", p_root->p_input->psz_name ); + /* Remove the item from its parent */ if( p_root->p_parent ) playlist_NodeRemoveItem( p_playlist, p_root, p_root->p_parent ); @@ -201,16 +220,17 @@ int playlist_NodeInsert( playlist_t *p_playlist, int i_position ) { PL_ASSERT_LOCKED; - (void)p_playlist; - assert( p_parent && p_parent->i_children != -1 ); - if( i_position == -1 ) i_position = p_parent->i_children ; - - INSERT_ELEM( p_parent->pp_children, - p_parent->i_children, - i_position, - p_item ); - p_item->p_parent = p_parent; - return VLC_SUCCESS; + (void)p_playlist; + assert( p_parent && p_parent->i_children != -1 ); + if( i_position == -1 ) i_position = p_parent->i_children ; + assert( i_position <= p_parent->i_children); + + INSERT_ELEM( p_parent->pp_children, + p_parent->i_children, + i_position, + p_item ); + p_item->p_parent = p_parent; + return VLC_SUCCESS; } /** @@ -226,46 +246,25 @@ int playlist_NodeRemoveItem( playlist_t *p_playlist, playlist_item_t *p_parent ) { PL_ASSERT_LOCKED; - (void)p_playlist; - - for(int i= 0; i< p_parent->i_children ; i++ ) - { - if( p_parent->pp_children[i] == p_item ) - { - REMOVE_ELEM( p_parent->pp_children, p_parent->i_children, i ); - } - } - - return VLC_SUCCESS; -} - - -/** - * Count the children of a node - * - * \param p_playlist the playlist - * \param p_node the node - * \return the number of children - */ -int playlist_NodeChildrenCount( playlist_t *p_playlist, playlist_item_t*p_node) -{ - PL_ASSERT_LOCKED; - int i; - int i_nb = 0; + (void)p_playlist; - if( p_node->i_children == -1 ) - return 0; + int ret = VLC_EGENERIC; - i_nb = p_node->i_children; - for( i=0 ; i< p_node->i_children;i++ ) + for(int i= 0; i< p_parent->i_children ; i++ ) { - if( p_node->pp_children[i]->i_children == -1 ) - break; - else - i_nb += playlist_NodeChildrenCount( p_playlist, - p_node->pp_children[i] ); + if( p_parent->pp_children[i] == p_item ) + { + REMOVE_ELEM( p_parent->pp_children, p_parent->i_children, i ); + ret = VLC_SUCCESS; + } + } + + if( ret == VLC_SUCCESS ) { + assert( p_item->p_parent == p_parent ); + p_item->p_parent = NULL; } - return i_nb; + + return ret; } /** @@ -296,96 +295,9 @@ playlist_item_t *playlist_ChildSearchName( playlist_item_t *p_node, return NULL; } -/** - * Create a pair of nodes in the category and onelevel trees. - * They share the same input item. - * \param p_playlist the playlist - * \param psz_name the name of the nodes - * \param pp_node_cat pointer to return the node in category tree - * \param pp_node_one pointer to return the node in onelevel tree - * \param b_for_sd For Services Discovery ? (make node read-only and unskipping) - */ -void playlist_NodesPairCreate( playlist_t *p_playlist, const char *psz_name, - playlist_item_t **pp_node_cat, - playlist_item_t **pp_node_one, - bool b_for_sd ) -{ - PL_ASSERT_LOCKED; - *pp_node_cat = playlist_NodeCreate( p_playlist, psz_name, - p_playlist->p_root_category, 0, NULL ); - *pp_node_one = playlist_NodeCreate( p_playlist, psz_name, - p_playlist->p_root_onelevel, 0, - (*pp_node_cat)->p_input ); - if( b_for_sd ) - { - (*pp_node_cat)->i_flags |= PLAYLIST_RO_FLAG; - (*pp_node_cat)->i_flags |= PLAYLIST_SKIP_FLAG; - (*pp_node_one)->i_flags |= PLAYLIST_RO_FLAG; - (*pp_node_one)->i_flags |= PLAYLIST_SKIP_FLAG; - } -} - -/** - * Get the node in the preferred tree from a node in one of category - * or onelevel tree. - */ -playlist_item_t * playlist_GetPreferredNode( playlist_t *p_playlist, - playlist_item_t *p_node ) -{ - PL_ASSERT_LOCKED; - int i; - if( p_node->p_parent == p_playlist->p_root_category ) - { - if( p_playlist->b_tree ) - return p_node; - for( i = 0 ; i< p_playlist->p_root_onelevel->i_children; i++ ) - { - if( p_playlist->p_root_onelevel->pp_children[i]->p_input->i_id == - p_node->p_input->i_id ) - return p_playlist->p_root_onelevel->pp_children[i]; - } - } - else if( p_node->p_parent == p_playlist->p_root_onelevel ) - { - if( !p_playlist->b_tree ) - return p_node; - for( i = 0 ; i< p_playlist->p_root_category->i_children; i++ ) - { - if( p_playlist->p_root_category->pp_children[i]->p_input->i_id == - p_node->p_input->i_id ) - return p_playlist->p_root_category->pp_children[i]; - } - } - return NULL; -} - /********************************************************************** * Tree walking functions **********************************************************************/ - -playlist_item_t *playlist_GetLastLeaf(playlist_t *p_playlist, - playlist_item_t *p_root ) -{ - PL_ASSERT_LOCKED; - int i; - playlist_item_t *p_item; - for ( i = p_root->i_children - 1; i >= 0; i-- ) - { - if( p_root->pp_children[i]->i_children == -1 ) - return p_root->pp_children[i]; - else if( p_root->pp_children[i]->i_children > 0) - { - p_item = playlist_GetLastLeaf( p_playlist, - p_root->pp_children[i] ); - if ( p_item != NULL ) - return p_item; - } - else if( i == 0 ) - return NULL; - } - return NULL; -} - /** * Finds the next item to play * @@ -444,7 +356,7 @@ playlist_item_t *playlist_GetPrevLeaf( playlist_t *p_playlist, PL_ASSERT_LOCKED; playlist_item_t *p_prev; - PL_DEBUG2( "finding previous os %s within %s", PLI_NAME( p_item ), + PL_DEBUG2( "finding previous of %s within %s", PLI_NAME( p_item ), PLI_NAME( p_root ) ); assert( p_root && p_root->i_children != -1 ); @@ -481,41 +393,40 @@ playlist_item_t *GetNextItem( playlist_t *p_playlist, playlist_item_t *p_root, playlist_item_t *p_item ) { - playlist_item_t *p_parent; - int i; + /* If the item is NULL, return the firt child of root */ + if( p_item == NULL ) + { + if( p_root->i_children > 0 ) + return p_root->pp_children[0]; + else + return NULL; + } /* Node with children, get the first one */ - if( p_item && p_item->i_children > 0 ) + if( p_item->i_children > 0 ) return p_item->pp_children[0]; - if( p_item != NULL ) - p_parent = p_item->p_parent; - else - p_parent = p_root; - for( i= 0 ; i < p_parent->i_children ; i++ ) + playlist_item_t* p_parent = p_item->p_parent; + for( int i = 0 ; i < p_parent->i_children ; i++ ) { - if( p_item == NULL || p_parent->pp_children[i] == p_item ) + if( p_parent->pp_children[i] == p_item ) { - if( p_item == NULL ) - i = -1; - - if( i+1 >= p_parent->i_children ) + // Return the next children + if( i + 1 < p_parent->i_children ) + return p_parent->pp_children[i+1]; + // We are the least one, so try to have uncles + else { - /* Was already the last sibling. Look for uncles */ PL_DEBUG2( "Current item is the last of the node," "looking for uncle from %s", p_parent->p_input->psz_name ); - if( p_parent == p_root ) { PL_DEBUG2( "already at root" ); return NULL; } - return GetNextUncle( p_playlist, p_item, p_root ); - } - else - { - return p_parent->pp_children[i+1]; + else + return GetNextUncle( p_playlist, p_item, p_root ); } } }