1 /*
2 * Copyright 2008-2013 Various Authors
3 * Copyright 2006 Timo Hirvonen
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation; either version 2 of the
8 * License, or (at your option) any later version.
9 *
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, see <http://www.gnu.org/licenses/>.
17 */
18
19 #ifndef CMUS_TRACK_H
20 #define CMUS_TRACK_H
21
22 #include "list.h"
23 #include "rbtree.h"
24 #include "iter.h"
25 #include "track_info.h"
26 #include "cmus.h"
27
28 struct simple_track {
29 struct list_head node;
30 struct rb_node tree_node;
31 struct track_info *info;
32 unsigned int marked : 1;
33 };
34
35 struct shuffle_track {
36 struct simple_track simple_track;
37 struct rb_node tree_node;
38 double rand;
39 };
40
41 static inline struct shuffle_track *
simple_track_to_shuffle_track(struct simple_track * track)42 simple_track_to_shuffle_track(struct simple_track *track)
43 {
44 return container_of(track, struct shuffle_track, simple_track);
45 }
46
shuffle_track_info(const struct shuffle_track * track)47 static inline struct track_info *shuffle_track_info(const struct shuffle_track *track)
48 {
49 return ((struct simple_track *)track)->info;
50 }
51
to_simple_track(const struct list_head * item)52 static inline struct simple_track *to_simple_track(const struct list_head *item)
53 {
54 return container_of(item, struct simple_track, node);
55 }
56
iter_to_simple_track(const struct iter * iter)57 static inline struct simple_track *iter_to_simple_track(const struct iter *iter)
58 {
59 return iter->data1;
60 }
61
tree_node_to_simple_track(const struct rb_node * node)62 static inline struct simple_track *tree_node_to_simple_track(const struct rb_node *node)
63 {
64 return container_of(node, struct simple_track, tree_node);
65 }
66
tree_node_to_shuffle_track(const struct rb_node * node)67 static inline struct shuffle_track *tree_node_to_shuffle_track(const struct rb_node *node)
68 {
69 return container_of(node, struct shuffle_track, tree_node);
70 }
71
72 /* NOTE: does not ref ti */
73 void simple_track_init(struct simple_track *track, struct track_info *ti);
74
75 /* refs ti */
76 struct simple_track *simple_track_new(struct track_info *ti);
77
78 int simple_track_get_prev(struct iter *);
79 int simple_track_get_next(struct iter *);
80
81 /* data is window */
82 int simple_track_search_get_current(void *data, struct iter *iter);
83 int simple_track_search_matches(void *data, struct iter *iter, const char *text);
84 int _simple_track_search_matches(struct iter *iter, const char *text);
85
86 struct shuffle_track *shuffle_list_get_next(struct rb_root *root, struct shuffle_track *cur,
87 int (*filter)(const struct simple_track *));
88
89 struct shuffle_track *shuffle_list_get_prev(struct rb_root *root, struct shuffle_track *cur,
90 int (*filter)(const struct simple_track *));
91
92 struct simple_track *simple_list_get_next(struct list_head *head, struct simple_track *cur,
93 int (*filter)(const struct simple_track *));
94
95 struct simple_track *simple_list_get_prev(struct list_head *head, struct simple_track *cur,
96 int (*filter)(const struct simple_track *));
97
98 void sorted_list_add_track(struct list_head *head, struct rb_root *tree_root, struct simple_track *track,
99 const sort_key_t *keys, int tiebreak);
100 void sorted_list_remove_track(struct list_head *head, struct rb_root *tree_root, struct simple_track *track);
101 void sorted_list_rebuild(struct list_head *head, struct rb_root *tree_root, const sort_key_t *keys);
102 void rand_list_rebuild(struct list_head *head, struct rb_root *tree_root);
103
104 void list_add_rand(struct list_head *head, struct list_head *node, int nr);
105
106 int simple_list_for_each_marked(struct list_head *head, track_info_cb cb,
107 void *data, int reverse);
108 int simple_list_for_each(struct list_head *head, track_info_cb cb,
109 void *data, int reverse);
110
111 void shuffle_list_add(struct shuffle_track *track, struct rb_root *tree_root);
112 void shuffle_list_reshuffle(struct rb_root *tree_root);
113 void shuffle_insert(struct rb_root *root, struct shuffle_track *previous, struct shuffle_track *new);
114
115 #endif
116