2 * This file is part of DisOrder.
3 * Copyright (C) 2004-2008 Richard Kettlewell
5 * This program is free software: you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation, either version 3 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
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/>.
18 /** @file server/queue-ops.c
19 * @brief Track queues (server-specific code)
21 #include "disorder-server.h"
23 static int find_in_list(struct queue_entry
*needle
,
24 int nqs
, struct queue_entry
**qs
) {
27 for(n
= 0; n
< nqs
; ++n
)
33 static int id_in_use(const char *id
) {
34 struct queue_entry
*q
;
36 for(q
= qhead
.next
; q
!= &qhead
; q
= q
->next
)
37 if(!strcmp(id
, q
->id
))
42 static void queue_id(struct queue_entry
*q
) {
51 struct queue_entry
*queue_add(const char *track
, const char *submitter
,
52 int where
, enum track_origin origin
) {
53 struct queue_entry
*q
, *beforeme
;
55 q
= xmalloc(sizeof *q
);
56 q
->track
= xstrdup(track
);
57 q
->submitter
= submitter ?
xstrdup(submitter
) : 0;
58 q
->state
= playing_unplayed
;
65 queue_insert_entry(&qhead
, q
);
68 queue_insert_entry(qhead
.prev
, q
);
70 case WHERE_BEFORE_RANDOM
:
71 /* We want to find the point in the queue before the block of random tracks
74 while(beforeme
->prev
!= &qhead
75 && beforeme
->prev
->origin
== origin_random
)
76 beforeme
= beforeme
->prev
;
77 queue_insert_entry(beforeme
->prev
, q
);
80 /* submitter will be a null pointer for a scratch */
82 notify_queue(track
, submitter
);
83 eventlog_raw("queue", queue_marshall(q
), (const char *)0);
87 int queue_move(struct queue_entry
*q
, int delta
, const char *who
) {
91 /* not the most efficient approach but hopefuly relatively comprehensible:
92 * the idea is that for each step we determine which nodes are affected, and
93 * fill in all the links starting at the 'prev' end and moving towards the
96 while(delta
> 0 && q
->prev
!= &qhead
) {
97 struct queue_entry
*n
, *p
, *pp
;
112 while(delta
< 0 && q
->next
!= &qhead
) {
113 struct queue_entry
*n
, *p
, *nn
;
129 info("user %s moved %s", who
, q
->id
);
130 notify_queue_move(q
->track
, who
);
131 sprintf(buffer
, "%d", moved
);
132 eventlog("moved", who
, (char *)0);
138 void queue_moveafter(struct queue_entry
*target
,
139 int nqs
, struct queue_entry
**qs
,
141 struct queue_entry
*q
;
148 while(find_in_list(target
, nqs
, qs
))
149 target
= target
->prev
;
151 for(n
= 0; n
< nqs
; ++n
) {
153 queue_delete_entry(q
);
154 queue_insert_entry(target
, q
);
156 /* Log the individual tracks */
157 info("user %s moved %s", who
, q
->id
);
158 notify_queue_move(q
->track
, who
);
160 /* Report that the queue changed to the event log */
161 eventlog("moved", who
, (char *)0);
164 void queue_remove(struct queue_entry
*which
, const char *who
) {
166 info("user %s removed %s", who
, which
->id
);
167 notify_queue_move(which
->track
, who
);
169 eventlog("removed", which
->id
, who
, (const char *)0);
170 queue_delete_entry(which
);
173 void queue_played(struct queue_entry
*q
) {
174 while(pcount
&& pcount
>= config
->history
) {
175 eventlog("recent_removed", phead
.next
->id
, (char *)0);
176 queue_delete_entry(phead
.next
);
179 if(config
->history
) {
180 eventlog_raw("recent_added", queue_marshall(q
), (char *)0);
181 queue_insert_entry(phead
.prev
, q
);