int playlist_DeleteItem( playlist_t * p_playlist, playlist_item_t *p_item,
bool b_stop )
{
+ assert( b_stop );
+ return playlist_NodeDelete( p_playlist, p_item, true, false );
+#if 0
int i;
int i_id = p_item->i_id;
PL_ASSERT_LOCKED;
playlist_ItemRelease( p_item );
return VLC_SUCCESS;
+#endif
}
static int RecursiveAddIntoParent (
if( !p_new_item ) return i_pos;
i_pos++;
-
- //Swap parent for new item, if we will recurse
- if( b_children ) p_parent = p_new_item;
}
//Recurse if any children
if( b_children )
//Substitute p_new_item for first child leaf
//(If flat, continue counting from current position)
int i_last_pos = RecursiveAddIntoParent(
- p_playlist, p_parent, p_child_node,
+ p_playlist,
+ p_new_item ? p_new_item : p_parent,
+ p_child_node,
( b_flat ? i_pos : 0 ),
b_flat,
&p_new_item );