ocarina/core/deck.cpp

133 lines
2.9 KiB
C++
Raw Normal View History

/**
* Copyright 2013 (c) Anna Schumaker.
*/
extern "C" {
#include <core/collection.h>
#include <core/history.h>
}
#include <core/deck.h>
#include <core/file.h>
#include <glib.h>
static GSList *tempq_list;
static struct file deck_file;
void tempq_init(struct queue_ops *ops)
{
unsigned int flags, count, j, id;
unsigned int num, i;
struct queue *queue;
file_init(&deck_file, "deck", 1);
if (!file_open(&deck_file, OPEN_READ))
return;
if (file_version(&deck_file) < 1)
return;
file_readf(&deck_file, "%u", &num);
for (i = 0; i < num; i++) {
file_readf(&deck_file, "%u %u", &flags, &count);
queue = tempq_alloc(NULL, flags);
for (j = 0; j < count; j++) {
file_readf(&deck_file, "%u", &id);
queue_add(queue, track_get(id));
}
queue->q_ops = ops;
}
file_close(&deck_file);
}
void tempq_deinit()
{
GSList *cur;
for (cur = tempq_list; cur; cur = g_slist_next(cur)) {
queue_deinit((struct queue *)cur->data);
delete (struct queue *)cur->data;
}
g_slist_free(tempq_list);
tempq_list = NULL;
}
void tempq_save(struct queue *queue, enum queue_flags flag)
{
unsigned int i;
GSList *cur;
if (!file_open(&deck_file, OPEN_WRITE))
return;
file_writef(&deck_file, "%zu\n", g_slist_length(tempq_list));
for (cur = tempq_list; cur; cur = g_slist_next(cur)) {
queue = (struct queue *)cur->data;
file_writef(&deck_file, "%u %zu", queue->q_flags, queue_size(queue));
for (i = 0; i < queue_size(queue); i++) {
file_writef(&deck_file, " %u",
queue_at(queue, i)->tr_dbe.dbe_index);
}
file_writef(&deck_file, "\n");
}
file_close(&deck_file);
}
struct queue *tempq_alloc(struct queue_ops *ops, unsigned int flags)
{
struct queue *queue = new struct queue;
tempq_list = g_slist_append(tempq_list, queue);
queue_init(queue, flags | Q_ENABLED | Q_SAVE_FLAGS | Q_SAVE_SORT, ops);
tempq_save(queue, Q_ENABLED);
return queue;
}
void tempq_free(struct queue *queue)
{
tempq_list = g_slist_remove(tempq_list, queue);
queue_deinit(queue);
tempq_save(queue, Q_ENABLED);
delete queue;
}
struct queue *tempq_get(unsigned int index)
{
return (struct queue *)g_slist_nth_data(tempq_list, index);
}
void tempq_move(struct queue *queue, unsigned int index)
{
GSList *cur = g_slist_find(tempq_list, queue);
GSList *nth = g_slist_nth(tempq_list, index);
if (cur && nth && (cur != nth)) {
tempq_list = g_slist_remove(tempq_list, queue);
tempq_list = g_slist_insert_before(tempq_list, nth, queue);
tempq_save(queue, Q_ENABLED);
}
}
struct track *tempq_next()
{
struct track *track = NULL;
struct queue *queue = NULL;
GSList *cur;
for (cur = tempq_list; cur; cur = g_slist_next(cur)) {
queue = (struct queue *)cur->data;
if (queue_has_flag(queue, Q_ENABLED)) {
track = queue_next(queue);
break;
}
}
if (queue && queue_size(queue) == 0)
tempq_free(queue);
return track;
}
unsigned int tempq_count()
{
return g_slist_length(tempq_list);
}