blob: 05f041e6b913de503a237006352dfddb94824fe2 (
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
67
68
69
70
71
72
73
74
75
76
|
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <unistd.h>
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
// doubly linked list demo
struct waster {
int gg;
struct waster *prev;
struct waster *next;
};
struct waster *newnode (void) {
struct waster *new = malloc(sizeof(struct waster));
return new;
}
struct waster *llist (uint64_t count) {
struct waster *wr1 = malloc(sizeof(struct waster));
struct waster *head = wr1;
wr1->gg = 0; // Data for first node
wr1->prev = NULL; // There is no previous node
wr1->next = newnode(); // Make new node, next points to it
struct waster *prv = wr1; // Make prv point to current node
wr1 = wr1->next; // Make wr1 point to next node
for (uint64_t i = 1 ; i < count ; i++) { // Actual loop starts
wr1->gg = i; // Data for 2nd node
wr1->prev = prv; // make prev point to prv = wr1 = last node
if (i == count-1) {
wr1->next = NULL;
} else {
wr1->next = newnode(); // Make next node, next points to it
}
prv = wr1; // prv points to current node
wr1 = wr1->next; // Make wr1 point to the next node
}
wr1 = NULL;
return head;
}
void freellist(struct waster *wr1) {
//printf("freelist \n");
struct waster *save;
while (wr1 != NULL) {
save = wr1;
wr1 = wr1->next;
free(save);
}
}
int main (void) {
struct waster *wr1 = llist(20);
struct waster *p;
for (p = wr1 ; p != NULL ; p = p->next) {
void *prev = (void*)p->prev;
void *next = (void*)p->next;
printf("\n------%p----------",(void *)p);
printf("\ndata: %d\nprev: %p\nnext: %p\n", p->gg, prev, next);
printf("-----------------------------\n");
}
freellist(wr1);
return 0;
}
|
