linkedlist.c

/* cproxy - Copyright (C) 2012 Aaron Riekenberg (aaron.riekenberg@gmail.com).

   cproxy is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   cproxy is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with cproxy.  If not, see <http://www.gnu.org/licenses/>.
*/

#include <assert.h>
#include "linkedlist.h"
#include "memutil.h"
#include <string.h>

void initializeLinkedList(
  struct LinkedList* list)
{
  assert(list != NULL);

  memset(list, 0, sizeof(struct LinkedList));
}

void addToLinkedList(
  struct LinkedList* list,
  void* data)
{
  struct LinkedListNode* node;

  assert(list != NULL);

  node = checkedCalloc(1, sizeof(struct LinkedListNode));
  node->data = data;
  if (list->tail == NULL)
  {
    list->head = node;
    list->tail = node;
  }
  else
  {
    list->tail->next = node;
    node->prev = list->tail;
    list->tail = node;
  }
  ++(list->size);
}

void removeFromLinkedList(
  struct LinkedList* list,
  void* data)
{
  struct LinkedListNode* currentNode;

  assert(list != NULL);

  for (currentNode = list->head;
       currentNode;
       currentNode = currentNode->next)
  {
    if (currentNode->data == data)
    {
      break;
    }
  }

  if (currentNode)
  {
    if (list->head == currentNode)
    {
      list->head = currentNode->next;
    }
    if (list->tail == currentNode)
    {
      list->tail = currentNode->prev;
    }
    if (currentNode->prev)
    {
      currentNode->prev->next = currentNode->next;
    }
    if (currentNode->next)
    {
      currentNode->next->prev = currentNode->prev;
    }
    free(currentNode);
    --(list->size);
  }
}