2 * This file is part of DisOrder.
3 * Copyright (C) 2004-2009 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/>.
35 const char *const playing_states
[] = {
48 /** @brief String values for @c origin field */
49 const char *const track_origins
[] = {
57 #define VALUE(q, offset, type) *(type *)((char *)q + offset)
59 /** @brief Insert queue entry @p n just after @p b
60 * @param b Insert after this entry
61 * @param n New entry to insert
63 void queue_insert_entry(struct queue_entry
*b
, struct queue_entry
*n
) {
70 /* remove an entry from a doubly-linked list */
71 void queue_delete_entry(struct queue_entry
*node
) {
72 node
->next
->prev
= node
->prev
;
73 node
->prev
->next
= node
->next
;
76 static int unmarshall_long(char *data
, struct queue_entry
*q
,
78 void (*error_handler
)(const char *, void *),
80 if(xstrtol(&VALUE(q
, offset
, long), data
, 0, 0)) {
81 error_handler(strerror(errno
), u
);
87 static const char *marshall_long(const struct queue_entry
*q
, size_t offset
) {
91 n
= byte_snprintf(buffer
, sizeof buffer
, "%ld", VALUE(q
, offset
, long));
93 disorder_fatal(errno
, "error converting int");
94 else if((size_t)n
>= sizeof buffer
)
95 disorder_fatal(0, "long converted to decimal is too long");
96 return xstrdup(buffer
);
99 static void free_none(struct queue_entry
attribute((unused
)) *q
,
100 size_t attribute((unused
)) offset
) {
103 #define free_long free_none
105 static int unmarshall_string(char *data
, struct queue_entry
*q
,
107 void attribute((unused
)) (*error_handler
)(const char *, void *),
108 void attribute((unused
)) *u
) {
109 VALUE(q
, offset
, char *) = xstrdup(data
);
113 static const char *marshall_string(const struct queue_entry
*q
, size_t offset
) {
114 return VALUE(q
, offset
, char *);
117 static void free_string(struct queue_entry
*q
, size_t offset
) {
118 xfree(VALUE(q
, offset
, char *));
121 static int unmarshall_time_t(char *data
, struct queue_entry
*q
,
123 void (*error_handler
)(const char *, void *),
127 if(xstrtoll(&ul
, data
, 0, 0)) {
128 error_handler(strerror(errno
), u
);
131 VALUE(q
, offset
, time_t) = ul
;
135 static const char *marshall_time_t(const struct queue_entry
*q
, size_t offset
) {
139 n
= byte_snprintf(buffer
, sizeof buffer
,
140 "%"PRIdMAX
, (intmax_t)VALUE(q
, offset
, time_t));
142 disorder_fatal(errno
, "error converting time");
143 else if((size_t)n
>= sizeof buffer
)
144 disorder_fatal(0, "time converted to decimal is too long");
145 return xstrdup(buffer
);
148 #define free_time_t free_none
150 static int unmarshall_state(char *data
, struct queue_entry
*q
,
152 void (*error_handler
)(const char *, void *),
156 if((n
= table_find(playing_states
, 0, sizeof (char *),
157 sizeof playing_states
/ sizeof *playing_states
,
159 D(("state=[%s] n=%d", data
, n
));
160 error_handler("invalid state", u
);
163 VALUE(q
, offset
, enum playing_state
) = n
;
167 static int unmarshall_origin(char *data
, struct queue_entry
*q
,
169 void (*error_handler
)(const char *, void *),
173 if((n
= table_find(track_origins
, 0, sizeof (char *),
174 sizeof track_origins
/ sizeof *track_origins
,
176 D(("origin=[%s] n=%d", data
, n
));
177 error_handler("invalid origin", u
);
180 VALUE(q
, offset
, enum track_origin
) = n
;
184 static const char *marshall_state(const struct queue_entry
*q
, size_t offset
) {
185 return playing_states
[VALUE(q
, offset
, enum playing_state
)];
188 static const char *marshall_origin(const struct queue_entry
*q
, size_t offset
) {
189 return track_origins
[VALUE(q
, offset
, enum track_origin
)];
192 #define free_state free_none
193 #define free_origin free_none
195 #define F(n, h) { #n, offsetof(struct queue_entry, n), marshall_##h, unmarshall_##h, free_##h }
197 /** @brief A field in a @ref queue_entry */
198 static const struct queue_field
{
199 /** @brief Field name */
202 /** @brief Offset of value in @ref queue_entry structure */
205 /** @brief Marshaling function */
206 const char *(*marshall
)(const struct queue_entry
*q
, size_t offset
);
208 /** @brief Unmarshaling function */
209 int (*unmarshall
)(char *data
, struct queue_entry
*q
, size_t offset
,
210 void (*error_handler
)(const char *, void *),
213 /** @brief Destructor */
214 void (*free
)(struct queue_entry
*q
, size_t offset
);
216 /* Keep this table sorted. */
221 F(scratched
, string
),
224 F(submitter
, string
),
229 #define NFIELDS (sizeof fields / sizeof *fields)
231 int queue_unmarshall(struct queue_entry
*q
, const char *s
,
232 void (*error_handler
)(const char *, void *),
237 q
->pid
= -1; /* =none */
238 if(!(vec
= split(s
, &nvec
, SPLIT_QUOTES
, error_handler
, u
)))
240 int rc
= queue_unmarshall_vec(q
, nvec
, vec
, error_handler
, u
);
241 free_strings(nvec
, vec
);
245 int queue_unmarshall_vec(struct queue_entry
*q
, int nvec
, char **vec
,
246 void (*error_handler
)(const char *, void *),
251 error_handler("invalid marshalled queue format", u
);
255 D(("key %s value %s", vec
[0], vec
[1]));
256 if((n
= TABLE_FIND(fields
, name
, *vec
)) < 0) {
257 error_handler("unknown key in queue data", u
);
260 if(fields
[n
].unmarshall(vec
[1], q
, fields
[n
].offset
, error_handler
, u
))
268 char *queue_marshall(const struct queue_entry
*q
) {
270 const char *vec
[sizeof fields
/ sizeof *fields
], *v
;
274 for(n
= 0; n
< sizeof fields
/ sizeof *fields
; ++n
)
275 if((v
= fields
[n
].marshall(q
, fields
[n
].offset
))) {
276 vec
[n
] = quoteutf8(v
);
277 len
+= strlen(vec
[n
]) + strlen(fields
[n
].name
) + 2;
280 s
= r
= xmalloc_noptr(len
);
281 for(n
= 0; n
< sizeof fields
/ sizeof *fields
; ++n
)
284 s
+= strlen(strcpy(s
, fields
[n
].name
));
286 s
+= strlen(strcpy(s
, vec
[n
]));
291 void queue_free(struct queue_entry
*q
, int rest
) {
295 queue_free(q
->next
, rest
);
296 for(unsigned n
= 0; n
< NFIELDS
; ++n
)
297 fields
[n
].free(q
, fields
[n
].offset
);