diff playtree.c @ 4043:25590564842f

tree-based playlist parser code by Alban Bedel <[e-mail]>

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/playtree.c	Tue Jan 08 01:24:25 2002 +0000
@@ -0,0 +1,631 @@
+
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include <assert.h>
+#include "playtree.h"
+#include "mp_msg.h"
+
+static int
+play_tree_is_valid(play_tree_t* pt);
+
+play_tree_t*
+play_tree_new(void) {
+  play_tree_t* r = (play_tree_t*)calloc(1,sizeof(play_tree_t));
+  if(r == NULL)
+    mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",sizeof(play_tree_t));
+  return r;
+}
+
+void
+play_tree_free(play_tree_t* pt, int childs) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+
+  if(childs) {    
+    for(iter = pt->child; iter != NULL; iter = iter->next)
+      play_tree_free(iter,1);
+    pt->child = NULL;
+  }
+
+  play_tree_remove(pt,0,0);
+
+  for(iter = pt->child ; iter != NULL ; iter = iter->next)
+    iter->parent = NULL;
+
+  //if(pt->params) free(pt->params);
+  if(pt->files) {
+    int i;
+    for(i = 0 ; pt->files[i] != NULL ; i++)
+      free(pt->files[i]);
+    free(pt->files);
+  }
+
+  free(pt);
+}
+
+void
+play_tree_free_list(play_tree_t* pt, int childs) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+
+  for(iter = pt ; iter->prev != NULL ; iter = iter->prev)
+    /* NOTHING */;
+
+  for( ; iter != NULL ; iter = iter->next)
+    play_tree_free(iter,childs);
+    
+
+}
+
+void
+play_tree_append_entry(play_tree_t* pt, play_tree_t* entry) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(entry != NULL);
+#endif
+
+  if(pt == entry)
+    return;
+
+  for(iter = pt ; iter->next != NULL ; iter = iter->next)
+    /* NOTHING */;
+
+  entry->parent = iter->parent;
+  entry->prev = iter;
+  entry->next = NULL;
+  iter->next = entry;
+}
+
+void
+play_tree_prepend_entry(play_tree_t* pt, play_tree_t* entry) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(entry != NULL);
+#endif
+
+  for(iter = pt ; iter->prev != NULL; iter = iter->prev)
+    /* NOTHING */;
+
+  entry->prev = NULL;
+  entry->next = iter;
+  entry->parent = iter->parent;
+
+  iter->prev = entry;
+  if(entry->parent) {
+#ifdef DEBUG
+    assert(entry->parent->child == iter);
+#endif
+    entry->parent->child = entry;
+  }
+}
+
+void
+play_tree_insert_entry(play_tree_t* pt, play_tree_t* entry) {
+  
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(entry != NULL);
+#endif
+
+  entry->parent = pt->parent;
+  entry->prev = pt;
+  if(pt->next) {
+#ifdef DEBUG
+    assert(pt->next->prev == pt);
+#endif
+    entry->next = pt->next;
+    entry->next->prev = entry;
+  } else 
+    entry->next = NULL;
+  pt->next = entry;
+
+}
+    
+void
+play_tree_remove(play_tree_t* pt, int free_it,int with_childs) {
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+
+  // Middle of list
+  if(pt->prev && pt->next) {
+#ifdef DEBUG
+    assert(pt->prev->next == pt);
+    assert(pt->next->prev == pt);
+#endif
+    pt->prev->next = pt->next;
+    pt->next->prev = pt->prev;
+  } // End of list
+  else if(pt->prev) { 
+#ifdef DEBUG
+    assert(pt->prev->next == pt);
+#endif
+    pt->prev->next = NULL;
+  } // Begining of list
+  else if(pt->next) {
+#ifdef DEBUG
+    assert(pt->next->prev == pt);
+#endif
+    pt->next->prev = NULL;
+    if(pt->parent) {
+#ifdef DEBUG
+      assert(pt->parent->child == pt);
+#endif
+      pt->parent->child = pt->next;
+    } 
+  } // The only one
+  else if(pt->parent) {
+#ifdef DEBUG
+    assert(pt->parent->child == pt);
+#endif
+    pt->parent->child = NULL;
+  }
+
+  pt->prev = pt->next = pt->parent = NULL;
+  if(free_it)
+    play_tree_free(pt,with_childs);
+
+}
+
+void
+play_tree_set_child(play_tree_t* pt, play_tree_t* child) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(pt->files == NULL);
+#endif
+
+  for(iter = pt->child ; iter != NULL ; iter = iter->next)
+    iter->parent = NULL;
+  
+  // Go back to first one
+  for(iter = child ; iter->prev != NULL ; iter = iter->prev)
+    /* NOTHING */;
+
+  pt->child = iter;
+
+  for( ; iter != NULL ; iter= iter->next)
+    iter->parent = pt;
+
+}
+
+void
+play_tree_set_parent(play_tree_t* pt, play_tree_t* parent) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+
+  if(pt->parent)
+    pt->parent->child = NULL;
+
+  for(iter = pt ; iter != NULL ; iter = iter->next)
+    iter->parent = parent;
+
+  if(pt->prev) {
+    for(iter = pt->prev ; iter->prev != NULL ; iter = iter->prev)
+      iter->parent = parent;
+    iter->parent = parent;
+    parent->child = iter;
+  } else
+    parent->child = pt;
+
+}  
+  
+
+void
+play_tree_add_file(play_tree_t* pt,char* file) {
+  int n = 0;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(pt->child == NULL);
+  assert(file != NULL);
+#endif
+
+  if(pt->files) {
+    for(n = 0 ; pt->files[n] != NULL ; n++)
+      /* NOTHING */;
+  }
+  pt->files = (char**)realloc(pt->files,(n+2)*sizeof(char*));
+  if(pt->files ==NULL) {
+    mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",(n+2)*sizeof(char*));
+    return;
+  }
+
+  pt->files[n] = strdup(file);
+  pt->files[n+1] = NULL;
+
+}
+
+int
+play_tree_remove_file(play_tree_t* pt,char* file) {
+  int n,f = -1;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(file != NULL);
+  assert(pt->files != NULL);
+#endif
+
+  for(n=0 ; pt->files[n] != NULL ; n++) {
+    if(strcmp(file,pt->files[n]) == 0)
+      f = n;
+  }
+
+  if(f < 0) // Not found
+    return 0;
+
+#ifdef DEBUG
+  assert(n > f);
+#endif
+
+  free(pt->files[f]);
+
+  if(n > 1) {
+    memmove(&pt->files[f],&pt->files[f+1],(n-f)*sizeof(char*));
+    pt->files = (char**)realloc(pt->files,n*sizeof(char*));
+    if(pt->files == NULL) {
+      mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",(n+2)*sizeof(char*));
+      return -1;
+    }
+  } else {
+    free(pt->files);
+    pt->files = NULL;
+  }
+
+  return 1;
+}
+
+#if 0
+void
+play_tree_set_param(play_tree_t* pt, char* name, char* val) {
+  int n = 0,ni = -1;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(name != NULL);
+#endif
+
+  if(pt->params) {
+    for( ; pt->params[n].name != NULL ; n++) {
+      if(strcasecmp(pt->params[n].name,name) == 0)
+	ni = n;
+    }
+  }
+
+  if(ni > 0) {
+    if(pt->params[n].value != NULL) free(pt->params[n].value);
+    pt->params[n].value = val;
+    return;
+  }
+
+  pt->params = (play_tree_param_t*)realloc(pt->params,(n+2)*sizeof(play_tree_param_t));
+  pt->params[n].name = strdup(name);
+  pt->params[n].value = val != NULL ? strdup(val) : NULL;
+  memset(&pt->params[n+1],0,sizeof(play_tree_param_t));
+
+  return;
+}
+
+int
+play_tree_unset_param(play_tree_t* pt, char* name) {
+  int n,ni = 0;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+  assert(name != NULL);
+  assert(pt->params != NULL);
+#endif
+
+  for(n = 0 ; pt->params[n].name != NULL ; n++) {
+    if(strcasecmp(pt->params[n].name,name) == 0)
+      ni = n;
+  }
+
+  if(ni < 0)
+    return 0;
+
+  if(n > 1) {
+    memmove(&pt->params[ni],&pt->params[ni+1],(n-ni)*sizeof(play_tree_param_t));
+    pt->params = (play_tree_param_t*)realloc(pt->params,n*sizeof(play_tree_param_t));
+    assert(pt->params != NULL);
+  } else {
+    free(pt->params);
+    pt->params = NULL;
+  }
+
+  return 1;
+}
+
+#endif
+
+play_tree_iter_t*
+play_tree_iter_new(play_tree_t* pt) {
+  play_tree_iter_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+  
+  if( ! play_tree_is_valid(pt))
+    return NULL;
+
+  iter = (play_tree_iter_t*)calloc(1,sizeof(play_tree_iter_t));
+  if(! iter) return NULL;
+  iter->root = pt;
+  iter->tree = NULL;
+ 
+  if(pt->parent)
+    iter->loop = pt->parent->loop;
+
+  return iter;
+}
+
+void
+play_tree_iter_free(play_tree_iter_t* iter) {
+  
+#ifdef DEBUG
+  assert(iter != NULL);
+#endif
+
+  if(iter->status_stack) {
+#ifdef DEBUG
+    assert(iter->stack_size > 0);
+#endif
+    free(iter->status_stack);
+  }
+
+  free(iter);
+}
+
+int
+play_tree_iter_step(play_tree_iter_t* iter, int d,int with_nodes) {
+  play_tree_t* pt;
+
+#ifdef DEBUG
+  assert(iter != NULL);
+  assert(iter->root != NULL);
+#endif
+
+  if(iter->tree == NULL) {
+    iter->tree = iter->root;
+    return play_tree_iter_step(iter,0,with_nodes);
+  }
+
+  iter->file = 0;
+  if( d > 0 )
+    pt = iter->tree->next;
+  else if(d < 0)
+    pt = iter->tree->prev;
+  else
+    pt = iter->tree;
+
+  if(pt == NULL) { // No next
+    // Must we loop?
+    if(iter->tree->parent && iter->tree->parent->loop != 0 && ((d > 0 && iter->loop != 0) || ( d < 0 && (iter->loop < 0 || iter->loop < iter->tree->parent->loop) ) ) ) { 
+      if(d > 0) { // Go back to the first one
+	for(pt = iter->tree ; pt->prev != NULL; pt = pt->prev)
+	  /* NOTHNG */;
+	if(iter->loop > 0) iter->loop--;
+      } else if( d < 0 ) { // Or the last one
+	for(pt = iter->tree ; pt->next != NULL; pt = pt->next)
+	  /* NOTHNG */;
+	if(iter->loop >= 0 && iter->loop < iter->tree->parent->loop) iter->loop++;
+      }
+      iter->tree = pt;
+      return play_tree_iter_step(iter,0,with_nodes);
+    }
+    // Go up one level
+    return play_tree_iter_up_step(iter,d,with_nodes);
+
+  }
+
+  // Is there any valid childs ?
+  if(pt->child && play_tree_is_valid(pt->child)) {
+    iter->tree = pt;
+    if(with_nodes) { // Stop on the node      
+      return PLAY_TREE_ITER_NODE;
+    } else      // Or follow it
+      return play_tree_iter_down_step(iter,d,with_nodes);
+  }
+
+  // Is it a valid enty ?
+  if(! play_tree_is_valid(pt)) {
+    if(d == 0) { // Can this happen ?
+      mp_msg(MSGT_PLAYTREE,MSGL_ERR,"What to do now ???? Infinite loop if we continue\n");
+      return PLAY_TREE_ITER_ERROR;
+    } // Not a valid entry : go to next one
+    return play_tree_iter_step(iter,d,with_nodes);
+  }
+
+#ifdef DEBUG
+  assert(iter->tree->files != NULL);
+#endif
+  
+  iter->tree = pt;
+  for(d = 0 ; iter->tree->files[d] != NULL ; d++)
+    /* NOTHING */;
+  iter->num_files = d;
+
+  return PLAY_TREE_ITER_ENTRY;
+
+}
+
+static int
+play_tree_is_valid(play_tree_t* pt) {
+  play_tree_t* iter;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+
+  if(pt->files != NULL)
+    return 1;
+  else if (pt->child != NULL) {
+    for(iter = pt->child ; iter != NULL ; iter = iter->next) {
+      if(play_tree_is_valid(iter))
+	return 1;
+    }
+  }
+  return 0;
+}
+
+int
+play_tree_iter_up_step(play_tree_iter_t* iter, int d,int with_nodes) {
+
+#ifdef DEBUG
+  assert(iter != NULL);
+  assert(iter->tree != NULL);
+#endif
+  
+  iter->file = 0;
+  if(iter->tree->parent == iter->root->parent)
+    return PLAY_TREE_ITER_END;
+
+#ifdef DEBUG
+  assert(iter->tree->parent != NULL);
+  assert(iter->stack_size > 0);
+  assert(iter->status_stack != NULL);
+#endif
+  
+  // Pop status
+  iter->stack_size--;
+  iter->loop = iter->status_stack[iter->stack_size];
+  iter->status_stack = (int*)realloc(iter->status_stack,iter->stack_size*sizeof(int));
+  if(iter->stack_size > 0 && iter->status_stack == NULL) {
+    mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",iter->stack_size*sizeof(char*));
+    return PLAY_TREE_ITER_ERROR;
+  }
+  iter->tree = iter->tree->parent;
+  return play_tree_iter_step(iter,d,with_nodes);
+}
+  
+int
+play_tree_iter_down_step(play_tree_iter_t* iter, int d,int with_nodes) {
+
+#ifdef DEBUG
+  assert(iter->tree->files == NULL);
+  assert(iter->tree->child != NULL);
+  assert(iter->tree->child->parent == iter->tree);
+#endif
+
+  iter->file = 0;
+  //  Push status
+  iter->stack_size++;
+  iter->status_stack = (int*)realloc(iter->status_stack,iter->stack_size*sizeof(int));
+  if(iter->status_stack == NULL) {
+    mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",iter->stack_size*sizeof(int));
+    return PLAY_TREE_ITER_ERROR;
+  }
+  iter->status_stack[iter->stack_size-1] = iter->loop;
+  // Set new status
+  iter->loop = iter->tree->loop-1;
+  if(d >= 0)
+    iter->tree = iter->tree->child;
+  else {
+    play_tree_t* pt;
+    for(pt = iter->tree->child ; pt->next != NULL ; pt = pt->next)
+      /*NOTING*/;
+    iter->tree = pt;
+  }
+  return play_tree_iter_step(iter,0,with_nodes);
+}
+
+char*
+play_tree_iter_get_file(play_tree_iter_t* iter, int d) {
+  
+#ifdef DEBUG
+  assert(iter != NULL);
+  assert(iter->tree->child == NULL);
+#endif
+
+  if(iter->tree->files == NULL)
+    return NULL;
+
+  if(d > 0) {
+    if(iter->tree->files[iter->file] == NULL)
+      return NULL;
+    iter->file++;
+  } else if(d < 0) {
+    if(iter->file == 0)
+      return NULL;
+    iter->file--;
+  } 
+  return iter->tree->files[iter->file-1];
+}
+
+play_tree_t*
+play_tree_cleanup(play_tree_t* pt) {
+  play_tree_t* iter, *tmp, *first;
+
+#ifdef DEBUG
+  assert(pt != NULL);
+#endif
+
+  if( ! play_tree_is_valid(pt)) {
+    play_tree_remove(pt,1,1);
+    return NULL;
+  }
+
+  first = pt->child;
+
+  for(iter = pt->child ; iter != NULL ; ) {
+    tmp = iter;
+    iter = iter->next;
+    if(! play_tree_is_valid(tmp)) {
+      play_tree_remove(tmp,1,1);
+      if(tmp == first) first = iter;
+    }
+  }
+
+  for(iter = first ; iter != NULL ; ) {
+    tmp = iter;
+    iter = iter->next;
+    play_tree_cleanup(tmp);
+  }
+    
+  return pt;
+
+}
+
+play_tree_iter_t*
+play_tree_iter_new_copy(play_tree_iter_t* old) {
+  play_tree_iter_t* iter;
+
+#ifdef DEBUG
+  assert(old != NULL);
+#endif
+
+  iter = (play_tree_iter_t*)malloc(sizeof(play_tree_iter_t));
+  if(iter == NULL) {
+    mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",sizeof(play_tree_iter_t));
+    return NULL;
+  }
+;
+  memcpy(iter,old,sizeof(play_tree_iter_t));
+  if(old->status_stack) {
+    iter->status_stack = (int*)malloc(old->stack_size * sizeof(int));
+    if(iter->status_stack == NULL) {
+      mp_msg(MSGT_PLAYTREE,MSGL_ERR,"Can't allocate %d bytes of memory\n",old->stack_size * sizeof(int));
+      free(iter);
+      return NULL;
+    }
+    memcpy(iter->status_stack,old->status_stack,iter->stack_size*sizeof(int));
+  }
+  return iter;
+}