/
linked.c
152 lines (127 loc) · 4.09 KB
/
linked.c
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include <stdio.h>
#include <stdlib.h>
#define MAX_NODES 100
struct node {
char value;
struct node* next;
}__attribute__ ((aligned(8)));
typedef struct _AllocatedNodes {
int count;
struct node *nodes[MAX_NODES];
}AllocatedNodes;
static AllocatedNodes allocatedNodes;
void registerNode(void* node)
{
allocatedNodes.nodes[allocatedNodes.count] = node;
allocatedNodes.count++;
}
void forceUnregisterAllNodes(void)
{
int i;
for (i=0;i<allocatedNodes.count;i++) {
free((struct node*)allocatedNodes.nodes[i]);
allocatedNodes.nodes[i] = NULL;
}
}
struct node* unregisterLastNode(void)
{
allocatedNodes.count--;
free((struct node*)allocatedNodes.nodes[allocatedNodes.count]);
allocatedNodes.nodes[allocatedNodes.count] = NULL;
return (allocatedNodes.count>=0)?(struct node*)allocatedNodes.nodes[allocatedNodes.count-1]:NULL;
}
void insertNode(struct node* listStart, struct node* node)
{
struct node* temporaryNode;
struct node* seekNode;
seekNode = listStart;
while(NULL != seekNode->next) {
temporaryNode = seekNode;
seekNode = temporaryNode->next;
}
seekNode->next = node;
}
struct node* nextNode(struct node* node)
{
return (NULL == node->next)?node:node->next;
}
struct node* getLastNode(struct node* listStart)
{
struct node* seekNode = listStart;
struct node* temporaryNode = NULL;
do {
temporaryNode = seekNode;
seekNode = nextNode(seekNode);
} while( seekNode != temporaryNode);
return seekNode;
}
struct node* createNode(char value)
{
struct node* temporaryNode = malloc(sizeof(struct node));
temporaryNode->value = value;
temporaryNode->next = NULL;
registerNode((void*)temporaryNode);
return temporaryNode;
}
void destructLastNode(struct node* listStart)
{
struct node* lastNode;
lastNode = unregisterLastNode();
if(NULL != lastNode) lastNode->next = NULL;
}
void destructList(struct node* listStart)
{
struct node* seekNode = NULL;
do {
seekNode = getLastNode(listStart);
destructLastNode(listStart);
} while( seekNode != listStart);
}
int main(int argc, char *argv[])
{
struct node node_1 = {'a', NULL};
struct node node_2 = {'b', NULL};
struct node node_3 = {'c', NULL};
struct node node_4 = {'d', NULL};
struct node node_5 = {'e', NULL};
struct node* temporaryNode = NULL;
struct node* iteratorNode = NULL;
int count = 1;
struct node* dynamicNode = NULL;
printf("Static Linked List funcitons\n");
insertNode(&node_1, &node_2);
insertNode(&node_1, &node_3);
insertNode(&node_1, &node_4);
insertNode(&node_1, &node_5);
iteratorNode = &node_1;
do {
temporaryNode = iteratorNode;
iteratorNode = nextNode(temporaryNode);
printf("node[%d].value = %c\n", count, temporaryNode->value);
count++;
} while(temporaryNode != iteratorNode);
printf("Dynamic Linked List functions\n");
dynamicNode = createNode('1');
printf("dynamicList at %p\n", dynamicNode);
printf("dynamicNode.value: %c\n", dynamicNode->value);
dynamicNode->next = createNode('2');
temporaryNode = getLastNode(dynamicNode);
printf("temporaryNode at %p\n", temporaryNode);
printf("lastNode.value: %c\n", temporaryNode->value);
temporaryNode->next = createNode('3');
temporaryNode = getLastNode(dynamicNode);
printf("temporaryNode at %p\n", temporaryNode);
printf("lastNode.value: %c\n", temporaryNode->value);
temporaryNode->next = createNode('4');
temporaryNode = getLastNode(dynamicNode);
printf("temporaryNode at %p\n", temporaryNode);
printf("lastNode.value: %c\n", temporaryNode->value);
destructLastNode(dynamicNode);
temporaryNode = getLastNode(dynamicNode);
printf("temporaryNode at %p\n", temporaryNode);
printf("lastNode.value: %c\n", temporaryNode->value);
printf("total of nodes %d\n", allocatedNodes.count);
destructList(dynamicNode); //frees the linked list
printf("total of nodes %d\n", allocatedNodes.count);
forceUnregisterAllNodes();//frees all the nodes allocated
}