Home
last modified time | relevance | path

Searched refs:shuffle_track (Results 1 – 6 of 6) sorted by relevance

/dports/audio/cmus/cmus-2.9.1/
H A Dtrack.h35 struct shuffle_track { struct
41 static inline struct shuffle_track * argument
44 return container_of(track, struct shuffle_track, simple_track); in simple_track_to_shuffle_track()
47 static inline struct track_info *shuffle_track_info(const struct shuffle_track *track) in shuffle_track_info()
67 static inline struct shuffle_track *tree_node_to_shuffle_track(const struct rb_node *node) in tree_node_to_shuffle_track()
69 return container_of(node, struct shuffle_track, tree_node); in tree_node_to_shuffle_track()
86 struct shuffle_track *shuffle_list_get_next(struct rb_root *root, struct shuffle_track *cur,
89 struct shuffle_track *shuffle_list_get_prev(struct rb_root *root, struct shuffle_track *cur,
111 void shuffle_list_add(struct shuffle_track *track, struct rb_root *tree_root);
113 void shuffle_insert(struct rb_root *root, struct shuffle_track *previous, struct shuffle_track *new…
H A Dtrack.c74 void shuffle_insert(struct rb_root *root, struct shuffle_track *previous, struct shuffle_track *nex… in shuffle_insert()
94 struct shuffle_track *shuffle_list_get_next(struct rb_root *root, struct shuffle_track *cur, in shuffle_list_get_next()
105 struct shuffle_track *track = tree_node_to_shuffle_track(node); in shuffle_list_get_next()
120 struct shuffle_track *shuffle_list_get_prev(struct rb_root *root, struct shuffle_track *cur, in shuffle_list_get_prev()
131 struct shuffle_track *track = tree_node_to_shuffle_track(node); in shuffle_list_get_prev()
306 struct shuffle_track *tr_a = tree_node_to_shuffle_track(a); in compare_rand()
307 struct shuffle_track *tr_b = tree_node_to_shuffle_track(b); in compare_rand()
317 static void shuffle_track_init(struct shuffle_track *track) in shuffle_track_init()
322 void shuffle_list_add(struct shuffle_track *track, struct rb_root *tree_root) in shuffle_list_add()
354 struct shuffle_track *track = tree_node_to_shuffle_track(node); in shuffle_list_reshuffle()
H A Dpl.c179 struct shuffle_track *shuffle_track = in pl_free_track() local
185 rb_erase(&shuffle_track->tree_node, &pl->shuffle_root); in pl_free_track()
207 struct shuffle_track *track = xnew(struct shuffle_track, 1); in pl_add_track()
318 struct shuffle_track *st = shuffle_list_get_next(&pl->shuffle_root, NULL, pl_dummy_filter); in pl_get_first_track()
374 struct shuffle_track *st = simple_track_to_shuffle_track(cur); in pl_get_next_shuffled()
388 struct shuffle_track *st = simple_track_to_shuffle_track(cur); in pl_get_prev_shuffled()
657 …struct shuffle_track *st = shuffle_list_get_next(&pl_visible->shuffle_root, NULL, pl_dummy_filter); in pl_play_selected_row()
667 struct shuffle_track *prev_st = simple_track_to_shuffle_track(prev_track); in pl_play_selected_row()
668 struct shuffle_track *cur_st = in pl_play_selected_row()
H A Dlib.h29 struct shuffle_track shuffle_track; member
H A Dlib.c77 shuffle_list_add(&track->shuffle_track, &lib_shuffle_root); in shuffle_add()
325 rb_erase(&track->shuffle_track.tree_node, &lib_shuffle_root); in free_lib_track()
367 (struct shuffle_track *)lib_cur_track, aaa_mode_filter); in lib_goto_next()
387 (struct shuffle_track *)lib_cur_track, aaa_mode_filter); in lib_goto_prev()
H A Dcommand_mode.c1583 struct shuffle_track *previous = NULL, *next = NULL; in cmd_win_activate()
1588 previous = &lib_cur_track->shuffle_track; in cmd_win_activate()
1595 next = &lib_cur_track->shuffle_track; in cmd_win_activate()
1599 next = &lib_cur_track->shuffle_track; in cmd_win_activate()