blob: 634129beeac34f6a8d055342435241257fa270d5 (
plain)
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
|
/*
* Licensed Materials - Property of IBM
*
* trousers - An open source TCG Software Stack
*
* (C) Copyright International Business Machines Corp. 2006
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <list.h>
#include "tsplog.h"
list_ptr list_new( void) {
list_ptr list = (list_ptr)malloc( sizeof( list_struct));
if( list == NULL) return NULL;
list->head = NULL;
return list;
}
void list_add(list_ptr list, void *obj) {
list->current = (node_t *) malloc (sizeof(struct _list_t));
if (list->current == NULL) {
LogError("[list_add] malloc of %d bytes failed", sizeof(struct _list_t));
return;
}
if( list->head == NULL) {
list->head = list->current;
} else
list->previous->next = list->current;
list->current->obj = obj;
list->current->next = NULL;
list->previous = list->current;
}
void list_dump(list_ptr list) {
node_t *current;
if( list->head == NULL) // if head has not been altered
puts("no data"); // list is empty
else {
current = list->head; // go to first node
do {
printf("%d\n", (int)current->obj); // print value at current node
current = current->next; // traverse through the list
} while(current != NULL); // until current node is NULL
}
}
void list_freeall(list_ptr list) {
node_t *current = list->head; // go to first node
node_t *next;
if( list->head != NULL) {
current = list->head; // go to first node
do {
next = current->next;
free(current);
current = next;
} while(current != NULL); // until current node is NULL
}
}
|
