FilesExpand file tree

 master

/

list.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

87 lines (65 loc) · 1.32 KB

 master

/

list.c

Copy path

Top

File metadata and controls

• Code
• Blame

87 lines (65 loc) · 1.32 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

#include <stdlib.h>

#include "list.h"

list_t *list_create()

{

list_t *retval;

retval = malloc(sizeof(list_t));

if (retval) {

retval->head = NULL;

retval->tail = NULL;

retval->count = 0;

}

return retval;

}

int list_free(list_t *ls)

{

if (ls) {

if (ls->count != 0) {

return -1;

}

free(ls);

}

return 0;

}

int list_push(list_t *ls, void *data)

{

list_node_t *node;

node = malloc(sizeof(list_node_t));

if (!node) {

return -1;

}

node->data = data;

node->prev = NULL;

node->next = ls->head;

if (ls->head) { /* reset head's prev pointer */

ls->head->prev = node;

}

ls->head = node;

if (!ls->count) { /* is the first list node, reset tail pointer */

ls->tail = node;

}

ls->count++;

return 0;

}

int list_pop(list_t *ls, void **data)

{

list_node_t *node;

if (!ls->count) {

return -1;

}

node = ls->tail;

ls->tail = node->prev;

if (ls->tail) { /* not empty update next pointer */

ls->tail->next = NULL;

}

if (--ls->count == 0) { /* if list nodes was empty, reset head pointer */

ls->head = NULL;

}

*data = node->data;

free(node);

return 0;

}

int list_count(list_t *ls)

{

return ls->count;

}