LList.c

Go to the documentation of this file.

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

list *mklist(void)
{
  list *l;
  l=(list*)malloc(sizeof(list));
  if (l==NULL) 
    return NULL;
  l->data=NULL;
  l->key=-1;
  l->next=NULL;
  return l;
}

void linsert(list *l, void *data, int len, int key)
{
  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 *lfind(list *l, int key, int *len)
{
  /* 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 *lremove(list *l, int key, int *len)
{
  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);
}
  

---