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 #include "disorder-server.h"
20 /* the head of the queue is played next, so normally we add to the tail */
21 struct queue_entry qhead
= { &qhead
, &qhead
, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
23 /* the head of the recent list is the oldest thing, the tail the most recently
25 struct queue_entry phead
= { &phead
, &phead
, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
29 void queue_fix_sofar(struct queue_entry
*q
) {
32 /* Fake up SOFAR field for currently-playing tracks that don't have it filled
33 * in by the speaker process. XXX this horrible bodge should go away when we
34 * have a more general implementation of pausing as that field will always
35 * have to be right for the playing track. */
36 if((q
->state
== playing_started
37 || q
->state
== playing_paused
)
38 && q
->type
& DISORDER_PLAYER_PAUSES
39 && (q
->type
& DISORDER_PLAYER_TYPEMASK
) != DISORDER_PLAYER_RAW
) {
41 if(q
->uptopause
== -1) /* Don't know how far thru. */
43 else if(q
->lastresumed
) /* Has been paused and resumed. */
44 sofar
= q
->uptopause
+ time(0) - q
->lastresumed
;
45 else /* Currently paused. */
47 } else /* Never been paused. */
48 sofar
= time(0) - q
->played
;
53 static void queue_read_error(const char *msg
,
55 fatal(0, "error parsing queue %s: %s", (const char *)u
, msg
);
58 static void queue_do_read(struct queue_entry
*head
, const char *path
) {
61 struct queue_entry
*q
;
63 if(!(fp
= fopen(path
, "r"))) {
65 return; /* no queue */
66 fatal(errno
, "error opening %s", path
);
68 head
->next
= head
->prev
= head
;
69 while(!inputline(path
, fp
, &buffer
, '\n')) {
70 q
= xmalloc(sizeof *q
);
71 queue_unmarshall(q
, buffer
, queue_read_error
, (void *)path
);
75 fatal(0, "incomplete queue entry in %s", path
);
76 queue_insert_entry(head
->prev
, q
);
78 if(ferror(fp
)) fatal(errno
, "error reading %s", path
);
82 void queue_read(void) {
83 queue_do_read(&qhead
, config_get_file("queue"));
86 void recent_read(void) {
87 struct queue_entry
*q
;
89 queue_do_read(&phead
, config_get_file("recent"));
90 /* reset pcount after loading */
99 static void queue_do_write(const struct queue_entry
*head
, const char *path
) {
102 struct queue_entry
*q
;
104 byte_xasprintf(&tmp
, "%s.new", path
);
105 if(!(fp
= fopen(tmp
, "w"))) fatal(errno
, "error opening %s", tmp
);
106 for(q
= head
->next
; q
!= head
; q
= q
->next
)
107 if(fprintf(fp
, "%s\n", queue_marshall(q
)) < 0)
108 fatal(errno
, "error writing %s", tmp
);
109 if(fclose(fp
) < 0) fatal(errno
, "error closing %s", tmp
);
110 if(rename(tmp
, path
) < 0) fatal(errno
, "error replacing %s", path
);
113 void queue_write(void) {
114 queue_do_write(&qhead
, config_get_file("queue"));
117 void recent_write(void) {
118 queue_do_write(&phead
, config_get_file("recent"));
121 struct queue_entry
*queue_find(const char *key
) {
122 struct queue_entry
*q
;
125 q
!= &qhead
&& strcmp(q
->track
, key
) && strcmp(q
->id
, key
);
128 return q
!= &qhead ? q
: 0;