1 /*****************************************************************************
2 * sort.c : Playlist sorting functions
3 *****************************************************************************
4 * Copyright (C) 1999-2007 the VideoLAN team
7 * Authors: Clément Stenac <zorglub@videolan.org>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
22 *****************************************************************************/
24 #include "vlc_playlist.h"
25 #include "playlist_internal.h"
28 static int playlist_ItemArraySort( playlist_t *p_playlist, int i_items,
29 playlist_item_t **pp_items, int i_mode,
34 * This function must be entered with the playlist lock !
36 * \param p_playlist the playlist
37 * \param p_node the node to sort
38 * \param i_mode: SORT_ID, SORT_TITLE, SORT_ARTIST, SORT_ALBUM, SORT_RANDOM
39 * \param i_type: ORDER_NORMAL or ORDER_REVERSE (reversed order)
40 * \return VLC_SUCCESS on success
42 static int playlist_NodeSort( playlist_t * p_playlist , playlist_item_t *p_node,
43 int i_mode, int i_type )
45 playlist_ItemArraySort( p_playlist,p_node->i_children,
46 p_node->pp_children, i_mode, i_type );
51 * Sort a node recursively.
53 * This function must be entered with the playlist lock !
55 * \param p_playlist the playlist
56 * \param p_node the node to sort
57 * \param i_mode: SORT_ID, SORT_TITLE, SORT_ARTIST, SORT_ALBUM, SORT_RANDOM
58 * \param i_type: ORDER_NORMAL or ORDER_REVERSE (reversed order)
59 * \return VLC_SUCCESS on success
61 int playlist_RecursiveNodeSort( playlist_t *p_playlist, playlist_item_t *p_node,
62 int i_mode, int i_type )
65 playlist_NodeSort( p_playlist, p_node, i_mode, i_type );
66 for( i = 0 ; i< p_node->i_children; i++ )
68 if( p_node->pp_children[i]->i_children != -1 )
70 playlist_RecursiveNodeSort( p_playlist, p_node->pp_children[i],
78 static int playlist_ItemArraySort( playlist_t *p_playlist, int i_items,
79 playlist_item_t **pp_items, int i_mode,
82 int i , i_small , i_position;
83 playlist_item_t *p_temp;
85 val.b_bool = VLC_TRUE;
87 (void)p_playlist; // a bit surprising we don't need p_playlist!
89 if( i_mode == SORT_RANDOM )
91 for( i_position = 0; i_position < i_items ; i_position ++ )
96 i_new = rand() % (i_items - 1);
99 p_temp = pp_items[i_position];
100 pp_items[i_position] = pp_items[i_new];
101 pp_items[i_new] = p_temp;
107 #define DO_META_SORT( node ) { \
108 char *psz_a = input_item_GetMeta( pp_items[i]->p_input, vlc_meta_##node ); \
109 char *psz_b = input_item_GetMeta( pp_items[i_small]->p_input, vlc_meta_##node ); \
110 /* Nodes go first */ \
111 if( pp_items[i]->i_children == -1 && pp_items[i_small]->i_children >= 0 ) \
113 else if( pp_items[i]->i_children >= 0 &&\
114 pp_items[i_small]->i_children == -1 ) \
116 /* Both are nodes, sort by name */ \
117 else if( pp_items[i]->i_children >= 0 && \
118 pp_items[i_small]->i_children >= 0 ) \
120 i_test = strcasecmp( pp_items[i]->p_input->psz_name, \
121 pp_items[i_small]->p_input->psz_name ); \
123 /* Both are items */ \
124 else if( psz_a == NULL && psz_b != NULL ) \
126 else if( psz_a != NULL && psz_b == NULL ) \
128 /* No meta, sort by name */ \
129 else if( psz_a == NULL && psz_b == NULL ) \
131 i_test = strcasecmp( pp_items[i]->p_input->psz_name, \
132 pp_items[i_small]->p_input->psz_name ); \
136 i_test = strcmp( psz_b, psz_a ); \
140 for( i_position = 0; i_position < i_items -1 ; i_position ++ )
142 i_small = i_position;
143 for( i = i_position + 1 ; i< i_items ; i++)
147 if( i_mode == SORT_TITLE )
149 i_test = strcasecmp( pp_items[i]->p_input->psz_name,
150 pp_items[i_small]->p_input->psz_name );
152 else if( i_mode == SORT_TITLE_NUMERIC )
154 i_test = atoi( pp_items[i]->p_input->psz_name ) -
155 atoi( pp_items[i_small]->p_input->psz_name );
157 else if( i_mode == SORT_DURATION )
159 i_test = pp_items[i]->p_input->i_duration -
160 pp_items[i_small]->p_input->i_duration;
162 else if( i_mode == SORT_ARTIST )
164 DO_META_SORT( Artist );
166 else if( i_mode == SORT_ALBUM )
168 DO_META_SORT( Album );
170 else if( i_mode == SORT_TITLE_NODES_FIRST )
172 /* Alphabetic sort, all nodes first */
174 if( pp_items[i]->i_children == -1 &&
175 pp_items[i_small]->i_children >= 0 )
179 else if( pp_items[i]->i_children >= 0 &&
180 pp_items[i_small]->i_children == -1 )
186 i_test = strcasecmp( pp_items[i]->p_input->psz_name,
187 pp_items[i_small]->p_input->psz_name );
191 if( ( i_type == ORDER_NORMAL && i_test < 0 ) ||
192 ( i_type == ORDER_REVERSE && i_test > 0 ) )
197 p_temp = pp_items[i_position];
198 pp_items[i_position] = pp_items[i_small];
199 pp_items[i_small] = p_temp;