X-Git-Url: https://www.hackdaworld.org/gitweb/?a=blobdiff_plain;f=list%2Flist.c;h=79d53f7a5f0088a8a4ef8abdf240ac4095ccda21;hb=4fb6339047ed741c431ee45b855b9221df299737;hp=64a282a14e1f33dfd505fdaec215f5668bb8701a;hpb=40946b581d43a81ef427115bc284a4240c389e8f;p=my-code%2Fapi.git

diff --git a/list/list.c b/list/list.c
index 64a282a..79d53f7 100644
--- a/list/list.c
+++ b/list/list.c
@@ -8,39 +8,63 @@
 
 int list_init(t_list *list,int outfd) {
 
-  dprintf(outfd,"[list] list initilaization ...\n");
+  dprintf(outfd,"[list] list initialization ...\n");
 
   list->outfd=outfd;
   list->start=NULL;
-  list->current=NULL;
+  list_reset(list);
 
   return L_SUCCESS;
 }
 
-int list_del_next(t_list *list,t_list_element *element) {
+int list_shutdown(t_list *list) {
 
-  t_list_element *tmp;
+  if(list->start!=NULL) list_destroy(list);
+
+  dprintf(list->outfd,"[list] shutdown\n");
+
+  return L_SUCCESS;
+}
+
+int list_next(t_list *list) {
+
+  if(list->current->next==NULL) return L_NO_NEXT_ELEMENT;
+
+  list->current=list->current->next;
+
+  return L_SUCCESS;
+}
+
+int list_reset(t_list *list) {
+
+  list->current=list->start;
+
+  return L_SUCCESS;
+}
+
+int list_del_element(t_list *list,t_list_element *element) {
 
   if(element==NULL) {
     dprintf(list->outfd,"[list] empty element\n");
     return L_INVALID_ELEMENT;
   }
 
-  if(element->next!=NULL) {
-    dprintf(list->outfd,"[list] destroying element number %d\n"
-    tmp=element->next->next;
-    if(element->next->data!=NULL) free(element->next->data);
-    free(element->next);
-    element->next=tmp;
-  }
-  else {
-    dprintf(list->outfd,"[list] no next element\n");
-    return L_NO_NEXT_ELEMENT;
-  }
+  if(element->next!=NULL) element->next->prev=element->prev;
+  if(element->prev!=NULL) element->prev->next=element->next;
+  if(element==list->start) list->start=element->next;
+  list_reset(list);
+  if((element->data!=NULL)&&(element->data_len)) free(element->data);
+  free(element);
+  dprintf(list->outfd,"[list] element deleted\n");
 
   return L_SUCCESS;
 }
 
+int list_del_current(t_list *list) {
+
+  return(list_del_element(list,list->current));
+}
+
 int list_destroy(t_list *list) {
 
   if(list->start==NULL) {
@@ -48,72 +72,173 @@ int list_destroy(t_list *list) {
     return L_EMPTY_LIST;
   }
 
-  list->current=list->start;
+  list_reset(list);
 
-  while(list->current->next!=NULL)
-    list_del_next(list,list->current);
+  while(list->current!=NULL) list_del_element(list,list->current);
 
   return L_SUCCESS;
 }
 
-int list_del_nr(t_list *list,int nr) {
+int list_search_data(t_list *list,void *data,int first_bytes) {
+
+  list_reset(list);
 
   if(list->start==NULL) {
     dprintf(list->outfd,"[list] empty list\n");
     return L_EMPTY_LIST;
   }
 
-  if(list->start->number==nr) {
+  do {
+    if(list->current!=NULL)
+      if(first_bytes<=list->current->data_len)
+        if(!(memcmp(list->current->data,data,first_bytes))) return L_SUCCESS;
+  } while(list_next(list)!=L_NO_NEXT_ELEMENT);
 
-  }  
+  return L_NO_SUCH_ELEMENT;
+}
 
-  list->current=&(list->start);
+int list_add_immediate_ptr(t_list *list,void *ptr) {
 
-  while(list->current->next!=NULL) {
-    if(list->current->next->number==nr) {
-      list_del_next(list,list->current);
-      return L_SUCCESS;
+  /* if this is the first element */
+  if(list->start==NULL) {
+    list->start=(t_list_element *)malloc(sizeof(t_list_element));
+    if(list->start==NULL) {
+      dprintf(list->outfd,"[list] unable to allocate list element memory\n");
+      return L_E_MEM;
     }
-    list->current=list->current->next;
+    list->start->data=ptr;
+    list->start->data_len=0;
+    list->start->next=NULL;
+    list->start->prev=NULL;
+    list->current=list->start;
+    dprintf(list->outfd,"[list] added initial element\n");
+    return L_SUCCESS;
   }
 
-  return L_NO_SUCH_ELEMENT;
-}
+  list->current->next=(t_list_element *)malloc(sizeof(t_list_element));
+  if(list->current->next==NULL) {
+    dprintf(list->outfd,"[list] unable to allocate element memory\n");
+    return L_E_MEM;
+  }
+  list->current->next->prev=list->current;
+  list->current->next->next=NULL;
+  list->current->next->data=ptr;
+  list->current->next->data_len=0;
+
+  list->current=list->current->next;
 
-int list_search_data(t_list *list,void *data,int data_len) {
+  return L_SUCCESS;
 
-  t_element *help;
+}
 
-  help=&(list->start);
+int list_add_immediate(t_list *list,void *data,int data_len) {
 
-  while(help->next!=NULL) {
-    if(help->next->data_len==data_len) {
-      if(!(memcmp(help->next->data,data,data_len)) {
-        list->current=help->next;
-        return L_SUCCESS;
-      }
+  /* if this is the first element */
+  if(list->start==NULL) {
+    list->start=(t_list_element *)malloc(sizeof(t_list_element));
+    if(list->start==NULL) {
+      dprintf(list->outfd,"[list] unable to allocate list element memory\n");
+      return L_E_MEM;
     }
-    list->current=list->current->next;
+    if((list->start->data=malloc(data_len))==NULL) {
+      dprintf(list->outfd,"[list] unable to allocate data memory\n");
+      return L_E_MEM;
+    }
+    memcpy(list->start->data,data,data_len);
+    list->start->data_len=data_len;
+    list->start->next=NULL;
+    list->start->prev=NULL;
+    list->current=list->start;
+    dprintf(list->outfd,"[list] added initial element\n");
+    return L_SUCCESS;
   }
 
-  return L_NO_SUCH_ELEMENT;
+  list->current->next=(t_list_element *)malloc(sizeof(t_list_element));
+  if(list->current->next==NULL) {
+    dprintf(list->outfd,"[list] unable to allocate element memory\n");
+    return L_E_MEM;
+  }
+  list->current->next->prev=list->current;
+  list->current->next->next=NULL;
+  if((list->current->next->data=malloc(data_len))==NULL) {
+    dprintf(list->outfd,"[list] unable to allocate data memory\n");
+    return L_E_MEM;
+  }
+  memcpy(list->current->next->data,data,data_len);
+  list->current->next->data_len=data_len;
+
+  list->current=list->current->next;
+
+  return L_SUCCESS;
 }
 
-int list_search_nr(t_list *list,int nr) {
+int list_add_element(t_list *list,void *data,int data_len) {
+
+  list_reset(list);
 
-  list->current=&(list->start);
+  while(list->current!=NULL) {
+    if(data_len==list->current->data_len) {
+      if(!memcmp(list->current->data,data,data_len)) {
+        dprintf(list->outfd,"[list] element already in list\n");
+        return L_ELEMENT_IN_LIST;
+      }
+    }
+    if(list->current->next==NULL) {
+      list->current->next=(t_list_element *)malloc(sizeof(t_list_element));
+      if(list->current->next==NULL) {
+        dprintf(list->outfd,"[list] unable to allocate element memory\n");
+        return L_E_MEM;
+      }
+      list->current->next->prev=list->current;
+      list->current->next->next=NULL;
+      if((list->current->next->data=malloc(data_len))==NULL) {
+        dprintf(list->outfd,"[list] unable to allocate data memory\n");
+        return L_E_MEM;
+      }
+      memcpy(list->current->next->data,data,data_len);
+      list->current->next->data_len=data_len;
 
-  while(list->current->next!=NULL) {
-    if(list->current->next->number==nr) {
       list->current=list->current->next;
+
+      dprintf(list->outfd,"[list] element added\n");
+
       return L_SUCCESS;
     }
-    list->current=list->current->next;
+    else list_next(list);
   }
 
-  return L_NO_SUCH_ELEMENT;
+  /* if this is the first element */
+  list->start=(t_list_element *)malloc(sizeof(t_list_element));
+  if(list->start==NULL) {
+    dprintf(list->outfd,"[list] unable to allocate list element memory\n");
+    return L_E_MEM;
+  }
+  if((list->start->data=malloc(data_len))==NULL) {
+    dprintf(list->outfd,"[list] unable to allocate data memory\n");
+    return L_E_MEM;
+  }
+  memcpy(list->start->data,data,data_len);
+  list->start->data_len=data_len;
+  list->start->next=NULL;
+  list->start->prev=NULL;
+
+  list->current=list->start;
+
+  dprintf(list->outfd,"[list] added initial element\n");
+
+  return L_SUCCESS;
 }
 
-int list_append_element(t_list *list,t_list_element *element) {
+int list_count(t_list *list) {
+
+  int count;
 
-  list->current=&(list->start);
+  count=0;
+
+  list_reset(list);
+
+  if(list->current!=NULL) count++;
+  if(count) while(list_next(list)!=L_NO_NEXT_ELEMENT) count++;
+
+  return count;
+}