LList.c File Reference

#include <stdio.h>
#include "LList.h"

Go to the source code of this file.

Functions
list *	mklist (void)
void	linsert (list *l, void *data, int len, int key)
void *	lfind (list *l, int key, int *len)
void *	lremove (list *l, int key, int *len)

---

Function Documentation

void* lfind (  list *  l, int  key, int *  len )

Definition at line 36 of file LList.c. References list::data, list::key, list::len, and list::next. { /* skip first node (dummy) */ l=l->next; while ((l->key!=key) && (l->next!=NULL)) l=l->next; if (l->key!=key) return(NULL); *len=l->len; return l->data; }

void linsert (  list *  l, void *  data, int  len, int  key )

Definition at line 16 of file LList.c. References list::data, list::key, list::len, and list::next. { list *newnode; printf("linsert() - inserting into list at location 0x%x...\n",l); while (l->next != NULL) l=l->next; newnode = (list*) malloc(sizeof(list)); if (newnode==NULL) { fprintf(stderr, "insert to a list failed, Ack!\n"); return; } newnode->data=data; newnode->len=len; newnode->key=key; newnode->next=NULL; l->next=newnode; }

void* lremove (  list *  l, int  key, int *  len )

Definition at line 49 of file LList.c. References data, list::data, list::key, list::len, and list::next. { void *data; list *it; list *nxt; /* save pointer to start of list */ it=l; if (it->next==NULL) return NULL; /* skip first node (dummy) */ it=it->next; /* find match */ while ((it->key!=key) && (it->next!=NULL)) it=it->next; /* if we didn't find a match, return NULL */ if (it->key!=key) return(NULL); /* Save the stuff we're looking for */ *len=it->len; data=it->data; /* Now try to remove the node */ nxt=it->next; while (l->next!=it) l=l->next; l->next=nxt; free(it); return(data); }

list* mklist (  void   )

Definition at line 4 of file LList.c. References list::data, list::key, and list::next. { list *l; l=(list*)malloc(sizeof(list)); if (l==NULL) return NULL; l->data=NULL; l->key=-1; l->next=NULL; return l; }

---