-
Notifications
You must be signed in to change notification settings - Fork 129
/
dota_cache_test.c
123 lines (103 loc) · 2.57 KB
/
dota_cache_test.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
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "dota_cache.h"
struct charpack
{
char a;
char b;
char c;
};
struct intpack
{
int a;
int b;
int c;
};
int main ()
{
dota_cache_list hc = CreateEmptyCacheList ();
dota_cache_list tc = hc;
dota_cache_list hi = CreateEmptyCacheList ();
dota_cache_list ti = hi;
dota_cache_list temp;
struct charpack *pc ;
pc = (struct charpack *) malloc (sizeof (struct charpack));
pc->a = 'a';
pc->b = 'b';
pc->c = 'c';
struct intpack *pi;
pi = (struct intpack *) malloc (sizeof (struct intpack));
pi->a = 1;
pi->b = 2;
pi->c = 3;
InsertCacheNode (&tc, pc);
InsertCacheNode (&ti, pi);
pc = (struct charpack *) malloc (sizeof (struct charpack));
pc->a = 'd';
pc->b = 'e';
pc->c = 'f';
pi = (struct intpack *) malloc (sizeof (struct intpack));
pi->a = 4;
pi->b = 5;
pi->c = 6;
InsertCacheNode (&tc, pc);
InsertCacheNode (&ti, pi);
pc = (struct charpack *) malloc (sizeof (struct charpack));
pc->a = 'g';
pc->b = 'h';
pc->c = 'i';
pi = (struct intpack *) malloc (sizeof (struct intpack));
pi->a = 7;
pi->b = 8;
pi->c = 9;
InsertCacheNode (&tc, pc);
InsertCacheNode (&ti, pi);
printf ("Finished Insert\n");
temp = GetCacheNode (hc, &tc);
pc = (struct charpack *)temp->data;
printf ("%c, %c, %c\n", pc->a, pc->b, pc->c);
free (temp);
free (pc);
temp = GetCacheNode (hc, &tc);
pc = (struct charpack *)temp->data;
printf ("%c, %c, %c\n", pc->a, pc->b, pc->c);
free (temp);
free (pc);
temp = GetCacheNode (hc, &tc);
pc = (struct charpack *)temp->data;
printf ("%c, %c, %c\n", pc->a, pc->b, pc->c);
free (temp);
free (pc);
printf ("%p, %p, %p, %p\n", hi, ti, hi->next, ti->next);
temp = GetCacheNode (hi, &ti);
pi = (struct intpack *)temp->data;
printf ("%d, %d, %d\n", pi->a, pi->b, pi->c);
free (temp);
free (pi);
printf ("%p, %p, %p, %p\n", hi, ti, hi->next, ti->next);
temp = GetCacheNode (hi, &ti);
pi = (struct intpack *)temp->data;
printf ("%d, %d, %d\n", pi->a, pi->b, pi->c);
free (temp);
free (pi);
printf ("%p, %p, %p, %p\n", hi, ti, hi->next, ti->next);
temp = GetCacheNode (hi, &ti);
pi = (struct intpack *)temp->data;
printf ("%d, %d, %d\n", pi->a, pi->b, pi->c);
free (temp);
free (pi);
printf ("%p, %p, %p, %p\n", hi, ti, hi->next, ti->next);
pi = (struct intpack *) malloc (sizeof (struct intpack));
pi->a = 7;
pi->b = 8;
pi->c = 9;
InsertCacheNode (&ti, pi);
temp = GetCacheNode (hi, &ti);
pi = (struct intpack *)temp->data;
printf ("%d, %d, %d\n", pi->a, pi->b, pi->c);
free (temp);
free (pi);
printf ("%p, %p, %p, %p\n", hi, ti, hi->next, ti->next);
return 0;
}