Commit 1f26dd3f authored by Rafaël Carré's avatar Rafaël Carré

Remove unused option: b_prefers_tree

parent 02d6e6ab
...@@ -72,7 +72,6 @@ struct input_item_t ...@@ -72,7 +72,6 @@ struct input_item_t
mtime_t i_duration; /**< Duration in milliseconds*/ mtime_t i_duration; /**< Duration in milliseconds*/
uint8_t i_type; /**< Type (file, disc, ...) */ uint8_t i_type; /**< Type (file, disc, ...) */
bool b_prefers_tree; /**< Do we prefer being displayed as tree*/
int i_categories; /**< Number of info categories */ int i_categories; /**< Number of info categories */
info_category_t **pp_categories; /**< Pointer to the first info category */ info_category_t **pp_categories; /**< Pointer to the first info category */
......
...@@ -352,7 +352,6 @@ input_item_t *input_ItemNewWithType( vlc_object_t *p_obj, const char *psz_uri, ...@@ -352,7 +352,6 @@ input_item_t *input_ItemNewWithType( vlc_object_t *p_obj, const char *psz_uri,
p_input->psz_uri = NULL; p_input->psz_uri = NULL;
p_input->i_type = i_type; p_input->i_type = i_type;
p_input->b_prefers_tree = false;
if( p_input->i_type == ITEM_TYPE_UNKNOWN ) if( p_input->i_type == ITEM_TYPE_UNKNOWN )
GuessType( p_input ); GuessType( p_input );
......
...@@ -329,8 +329,8 @@ playlist_item_t * playlist_GetPreferredNode( playlist_t *p_playlist, ...@@ -329,8 +329,8 @@ playlist_item_t * playlist_GetPreferredNode( playlist_t *p_playlist,
int i; int i;
if( p_node->p_parent == p_playlist->p_root_category ) if( p_node->p_parent == p_playlist->p_root_category )
{ {
if( p_playlist->b_always_tree || if( p_playlist->b_always_tree )
p_node->p_input->b_prefers_tree ) return p_node; return p_node;
for( i = 0 ; i< p_playlist->p_root_onelevel->i_children; i++ ) 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 == if( p_playlist->p_root_onelevel->pp_children[i]->p_input->i_id ==
...@@ -340,7 +340,7 @@ playlist_item_t * playlist_GetPreferredNode( playlist_t *p_playlist, ...@@ -340,7 +340,7 @@ playlist_item_t * playlist_GetPreferredNode( playlist_t *p_playlist,
} }
else if( p_node->p_parent == p_playlist->p_root_onelevel ) else if( p_node->p_parent == p_playlist->p_root_onelevel )
{ {
if( p_playlist->b_never_tree || !p_node->p_input->b_prefers_tree ) if( p_playlist->b_never_tree )
return p_node; return p_node;
for( i = 0 ; i< p_playlist->p_root_category->i_children; i++ ) for( i = 0 ; i< p_playlist->p_root_category->i_children; i++ )
{ {
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment