list.c

#define EXT_LIST

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "list.h"

listStatus  list_create(head_t* head, uint32_t n)
{
  int    i;
  node_t* p = NULL;
  node_t* r = NULL;

  head ->node = (node_t*)malloc(sizeof(node_t));
  if(head ->node == NULL)return ERROR;
  head ->length = 0;
  r = head ->node;
  for(i = 0; i < n; i++)
  {
    p = (node_t*)malloc(sizeof(node_t));
    if(p == NULL)return ERROR;

    //----------节点数据赋值开始----------
    //----------节点数据赋值结束----------
    r ->next = p;
    r        = p;
    head ->length++;
  }
  r ->next = NULL;
  return SUCCESS;
}

void  list_clear(head_t* head)
{
  node_t* p = NULL;
  node_t* q = NULL;

  p = head ->node ->next;
  while(p)
  {
    q = p ->next;
    free(p);
    p = q;
    head ->length--;
  }
  head ->node ->next = NULL;
}

listStatus  list_is_empty(head_t* head)
{
  if(head ->node ->next == NULL)//链表为空
    return SUCCESS;
  else
    return ERROR;
}

uint32_t  list_get_length(head_t* head)
{
  return head ->length;
}

listStatus  list_get_nodedata(head_t* head, uint32_t index, nodedata_t* nodedata)
{
  node_t      *p = NULL;
  uint32_t    i;

  //传参校验
  if( (index > head ->length)||(index < 1) )return ERROR;

  p = head ->node;
  for(i = 0; i < index; i++){
    p = p ->next;
  }
  //元素赋值
  memcpy((void*)nodedata, (const void*)&(p ->data), sizeof(nodedata_t));
  return SUCCESS;
}

int32_t  list_check_nodedata(head_t* head, int32_t connect_fd, nodedata_t* nodedata)
{
  node_t      *p  = NULL;
  uint32_t    cnt = 1;
  int32_t     result;

  p = head ->node ->next;
  while(p)
  {
    //判断给出的元素与链表当前节点数据区的值是否相等
    result = memcmp((const void*)&nodedata, (const void*)&(p ->data), sizeof(nodedata_t));
    if(connect_fd == p ->data.connect_fd){
      memcpy((void*)nodedata, (const void*)&(p ->data), sizeof(nodedata_t));
      return cnt;
    }
    p = p ->next;
    cnt++;
  }

  return -1;
}

listStatus  list_insert_nodedata(head_t* head, uint32_t index, nodedata_t nodedata)
{
  node_t      *p = NULL;
  node_t      *s = NULL;
  uint32_t    length;
  uint32_t    i;

  //传参校验
  if( (index > (head->length + 1))||(index < 1) )return ERROR;

  p = head ->node;
  for(i = 0; i < (index-1); i++){
    p = p ->next;
  }
  s = (node_t*)malloc(sizeof(node_t));
  if(s == NULL)return ERROR;
  memcpy((void*)&(s ->data), (const void*)&nodedata, sizeof(nodedata_t));
  s ->next = p ->next;
  p ->next = s;
  head ->length++;

  return SUCCESS;
}

listStatus  list_delete_nodedata(head_t* head, uint32_t index, nodedata_t* nodedata)
{
  node_t      *p = NULL;
  node_t      *q = NULL;
  uint32_t    length;
  uint32_t    i;

  //传参校验
  if( (index > head ->length)||(index < 1) )return ERROR;

  p = head ->node;
  for(i = 0; i < (index-1); i++){
    p = p ->next;
  }
  q        = p ->next;
  p ->next = q ->next;
  free(q);
  head ->length--;

  return SUCCESS;
}