Merge drag+drop rewrite. It's now possible to drag multiple rows in

[disorder] / server / server-queue.c

diff --git a/server/server-queue.c b/server/server-queue.c
index a1fa18109e204e2cf40bbbf8f10aa3d72097047e..ab154748900cde84fd247b66e305cadb01180790 100644 (file)
--- a/server/server-queue.c
+++ b/server/server-queue.c
@@ -15,14 +15,23 @@
  * You should have received a copy of the GNU General Public License
  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
  * You should have received a copy of the GNU General Public License
  * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */

+/** @file server/server-queue.c
+ * @brief Server-specific track queue support
+ */

 #include "disorder-server.h"
 
 /* the head of the queue is played next, so normally we add to the tail */
 #include "disorder-server.h"
 
 /* the head of the queue is played next, so normally we add to the tail */

-struct queue_entry qhead = { &qhead, &qhead, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
+struct queue_entry qhead = {
+  .next = &qhead,
+  .prev = &qhead
+};

 
 /* the head of the recent list is the oldest thing, the tail the most recently
  * played */
 
 /* the head of the recent list is the oldest thing, the tail the most recently
  * played */

-struct queue_entry phead = { &phead, &phead, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
+struct queue_entry phead = {
+  .next = &phead,
+  .prev = &phead
+};

 
 long pcount;
 
 
 long pcount;
 


@@ -41,11 +50,11 @@ void queue_fix_sofar(struct queue_entry *q) {
       if(q->uptopause == -1)           /* Don't know how far thru. */
        sofar = -1;
       else if(q->lastresumed)          /* Has been paused and resumed. */
       if(q->uptopause == -1)           /* Don't know how far thru. */
        sofar = -1;
       else if(q->lastresumed)          /* Has been paused and resumed. */

-       sofar = q->uptopause + time(0) - q->lastresumed;
+       sofar = q->uptopause + xtime(0) - q->lastresumed;

       else                             /* Currently paused. */
        sofar = q->uptopause;
     } else                             /* Never been paused. */
       else                             /* Currently paused. */
        sofar = q->uptopause;
     } else                             /* Never been paused. */

-      sofar = time(0) - q->played;
+      sofar = xtime(0) - q->played;

     q->sofar = sofar;
   }
 }
     q->sofar = sofar;
   }
 }


@@ -59,6 +68,7 @@ static void queue_do_read(struct queue_entry *head, const char *path) {
   char *buffer;
   FILE *fp;
   struct queue_entry *q;
   char *buffer;
   FILE *fp;
   struct queue_entry *q;

+  int ver = 0;

 
   if(!(fp = fopen(path, "r"))) {
     if(errno == ENOENT)
 
   if(!(fp = fopen(path, "r"))) {
     if(errno == ENOENT)


@@ -67,8 +77,31 @@ static void queue_do_read(struct queue_entry *head, const char *path) {
   }
   head->next = head->prev = head;
   while(!inputline(path, fp, &buffer, '\n')) {
   }
   head->next = head->prev = head;
   while(!inputline(path, fp, &buffer, '\n')) {

+    if(buffer[0] == '#') {
+      /* Version indicator */
+      ver = atoi(buffer + 1);
+      continue;
+    }

     q = xmalloc(sizeof *q);
     queue_unmarshall(q, buffer, queue_read_error, (void *)path);
     q = xmalloc(sizeof *q);
     queue_unmarshall(q, buffer, queue_read_error, (void *)path);

+    if(ver < 1) {
+      /* Fix up origin field as best we can; will be wrong in some cases but
+       * hopefully not too horribly so. */
+      q->origin = q->submitter ? origin_picked : origin_random;
+      /* Eliminated obsolete states, since they are assumed elsewhere not to be
+       * set. */
+      switch(q->state) {
+      case playing_isscratch:
+        q->origin = origin_scratch;
+        q->state = playing_unplayed;
+        break;
+      case playing_random:
+        q->state = playing_unplayed;
+        break;
+      default:
+        break;
+      }
+    }

     if(head == &qhead
        && (!q->track
           || !q->when))
     if(head == &qhead
        && (!q->track
           || !q->when))


@@ -103,6 +136,9 @@ static void queue_do_write(const struct queue_entry *head, const char *path) {
 
   byte_xasprintf(&tmp, "%s.new", path);
   if(!(fp = fopen(tmp, "w"))) fatal(errno, "error opening %s", tmp);
 
   byte_xasprintf(&tmp, "%s.new", path);
   if(!(fp = fopen(tmp, "w"))) fatal(errno, "error opening %s", tmp);

+  /* Save version indicator */
+  if(fprintf(fp, "#1\n") < 0)
+    fatal(errno, "error writing %s", tmp);

   for(q = head->next; q != head; q = q->next)
     if(fprintf(fp, "%s\n", queue_marshall(q)) < 0)
       fatal(errno, "error writing %s", tmp);
   for(q = head->next; q != head; q = q->next)
     if(fprintf(fp, "%s\n", queue_marshall(q)) < 0)
       fatal(errno, "error writing %s", tmp);