X-Git-Url: https://hackdaworld.org/gitweb/?a=blobdiff_plain;f=list%2Flist.h;h=8f5328a4f04ef45bf85a08f9ce9f5e930c7ae76e;hb=HEAD;hp=5355a164ce10fd163b072ba7384dea331ad72503;hpb=b8458ffac23aab55ba5316d28dd803dd34297181;p=my-code%2Fapi.git

diff --git a/list/list.h b/list/list.h
index 5355a16..8f5328a 100644
--- a/list/list.h
+++ b/list/list.h
@@ -1,5 +1,8 @@
 /* list.h -- list headers */
 
+#ifndef LIST_H
+#define LIST_H
+
 #define _GNU_SOURCE
 #include <stdio.h>
 #include <string.h>
@@ -33,8 +36,92 @@ int list_shutdown(t_list *list);
 int list_reset(t_list *list);
 int list_next(t_list *list);
 int list_del_element(t_list *list,t_list_element *element);
+int list_del_current(t_list *list);
 int list_destroy(t_list *list);
 int list_search_data(t_list *list,void *data,int first_bytes);
+int list_add_immediate_ptr(t_list *list,void *ptr);
+int list_add_immediate(t_list *list,void *data,int data_len);
 int list_add_element(t_list *list,void *data,int data_len);
 int list_count(t_list *list);
 
+/*
+ * fast linked list routines to be inlined
+ */
+
+/* prototypes */
+
+static inline int list_init_f(t_list *list) __attribute__((always_inline));
+static inline int list_reset_f(t_list *list) __attribute__((always_inline));
+static inline int list_destroy_f(t_list *list) __attribute__((always_inline));
+static inline int list_add_immediate_f(t_list *list,void *ptr) __attribute__((always_inline));
+static inline int list_next_f(t_list *list) __attribute__((always_inline));
+
+/* definitions */
+
+static inline int list_init_f(t_list *list) {
+
+	list->start=NULL;
+	list->current=list->start;
+
+	return L_SUCCESS;
+}
+
+static inline int list_reset_f(t_list *list) {
+
+	list->current=list->start;
+
+	return L_SUCCESS;
+}
+
+static inline int list_destroy_f(t_list *list) {
+
+	t_list_element *this;
+
+	/* destroying the list from the very beginning */
+	list->current=list->start;
+
+	while(list->current!=NULL) {
+		this=list->current;
+		list->current=this->next;
+		free(this);
+	}
+
+	list->start=NULL;
+
+	return L_SUCCESS;
+}
+
+static inline int list_add_immediate_f(t_list *list,void *ptr) {
+
+	/* first element? */
+	if(list->start==NULL) {
+		list->start=malloc(sizeof(t_list_element));
+		list->start->data=ptr;
+		list->start->next=NULL;
+		list->start->prev=NULL;
+		list->current=list->start;
+		
+		return L_SUCCESS;
+	}
+
+	list->current->next=malloc(sizeof(t_list_element));
+	list->current->next->prev=list->current;
+	list->current->next->next=NULL;
+	list->current->next->data=ptr;
+	list->current=list->current->next;
+
+	return L_SUCCESS;
+}
+
+static inline int list_next_f(t_list *list) {
+
+	if(list->current->next==NULL)
+		return L_NO_NEXT_ELEMENT;
+
+	list->current=list->current->next;
+
+	return L_SUCCESS;
+}
+
+
+#endif