chiark / gitweb /
Add a new 'origin' field to queue entries. This records the origin of
[disorder] / server / server-queue.c
CommitLineData
f08c0859
RK
1/*
2 * This file is part of DisOrder.
5ee84006 3 * Copyright (C) 2004-2008 Richard Kettlewell
f08c0859 4 *
e7eb3a27 5 * This program is free software: you can redistribute it and/or modify
f08c0859 6 * it under the terms of the GNU General Public License as published by
e7eb3a27 7 * the Free Software Foundation, either version 3 of the License, or
f08c0859
RK
8 * (at your option) any later version.
9 *
e7eb3a27
RK
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.
14 *
f08c0859 15 * You should have received a copy of the GNU General Public License
e7eb3a27 16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
f08c0859 17 */
05b75f8d 18#include "disorder-server.h"
f08c0859
RK
19
20/* the head of the queue is played next, so normally we add to the tail */
2dc2f478
RK
21struct queue_entry qhead = {
22 .next = &qhead,
23 .prev = &qhead
24};
f08c0859
RK
25
26/* the head of the recent list is the oldest thing, the tail the most recently
27 * played */
2dc2f478
RK
28struct queue_entry phead = {
29 .next = &phead,
30 .prev = &phead
31};
f08c0859 32
05b75f8d 33long pcount;
f08c0859
RK
34
35void queue_fix_sofar(struct queue_entry *q) {
36 long sofar;
37
38 /* Fake up SOFAR field for currently-playing tracks that don't have it filled
39 * in by the speaker process. XXX this horrible bodge should go away when we
40 * have a more general implementation of pausing as that field will always
41 * have to be right for the playing track. */
42 if((q->state == playing_started
43 || q->state == playing_paused)
44 && q->type & DISORDER_PLAYER_PAUSES
45 && (q->type & DISORDER_PLAYER_TYPEMASK) != DISORDER_PLAYER_RAW) {
46 if(q->lastpaused) {
47 if(q->uptopause == -1) /* Don't know how far thru. */
48 sofar = -1;
49 else if(q->lastresumed) /* Has been paused and resumed. */
50 sofar = q->uptopause + time(0) - q->lastresumed;
51 else /* Currently paused. */
52 sofar = q->uptopause;
53 } else /* Never been paused. */
54 sofar = time(0) - q->played;
55 q->sofar = sofar;
56 }
57}
58
59static void queue_read_error(const char *msg,
60 void *u) {
61 fatal(0, "error parsing queue %s: %s", (const char *)u, msg);
62}
63
64static void queue_do_read(struct queue_entry *head, const char *path) {
65 char *buffer;
66 FILE *fp;
67 struct queue_entry *q;
68
69 if(!(fp = fopen(path, "r"))) {
70 if(errno == ENOENT)
71 return; /* no queue */
72 fatal(errno, "error opening %s", path);
73 }
74 head->next = head->prev = head;
75 while(!inputline(path, fp, &buffer, '\n')) {
76 q = xmalloc(sizeof *q);
77 queue_unmarshall(q, buffer, queue_read_error, (void *)path);
78 if(head == &qhead
79 && (!q->track
80 || !q->when))
81 fatal(0, "incomplete queue entry in %s", path);
05b75f8d 82 queue_insert_entry(head->prev, q);
f08c0859
RK
83 }
84 if(ferror(fp)) fatal(errno, "error reading %s", path);
85 fclose(fp);
86}
87
88void queue_read(void) {
89 queue_do_read(&qhead, config_get_file("queue"));
90}
91
92void recent_read(void) {
93 struct queue_entry *q;
94
95 queue_do_read(&phead, config_get_file("recent"));
96 /* reset pcount after loading */
97 pcount = 0;
98 q = phead.next;
99 while(q != &phead) {
100 ++pcount;
101 q = q->next;
102 }
103}
104
105static void queue_do_write(const struct queue_entry *head, const char *path) {
106 char *tmp;
107 FILE *fp;
108 struct queue_entry *q;
109
110 byte_xasprintf(&tmp, "%s.new", path);
111 if(!(fp = fopen(tmp, "w"))) fatal(errno, "error opening %s", tmp);
112 for(q = head->next; q != head; q = q->next)
113 if(fprintf(fp, "%s\n", queue_marshall(q)) < 0)
114 fatal(errno, "error writing %s", tmp);
115 if(fclose(fp) < 0) fatal(errno, "error closing %s", tmp);
116 if(rename(tmp, path) < 0) fatal(errno, "error replacing %s", path);
117}
118
119void queue_write(void) {
120 queue_do_write(&qhead, config_get_file("queue"));
121}
122
123void recent_write(void) {
124 queue_do_write(&phead, config_get_file("recent"));
125}
126
f08c0859
RK
127struct queue_entry *queue_find(const char *key) {
128 struct queue_entry *q;
129
130 for(q = qhead.next;
131 q != &qhead && strcmp(q->track, key) && strcmp(q->id, key);
132 q = q->next)
133 ;
134 return q != &qhead ? q : 0;
135}
136
f08c0859
RK
137/*
138Local Variables:
139c-basic-offset:2
140comment-column:40
141fill-column:79
142indent-tabs-mode:nil
143End:
144*/