-
Notifications
You must be signed in to change notification settings - Fork 1
/
sr0.c
85 lines (76 loc) · 1.85 KB
/
sr0.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
/* This is for use as an oscillator, short values are put in a ring of certain size and
* then this is fed a total number of values requires and it loops around the ring
* until it gets them.
*
* sr0.c is the proof of concept */
#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<string.h>
struct s_r_n /* short int ring node */
{
short s;
struct s_r_n *nx;
};
typedef struct s_r_n srn_t;
srn_t *creasrn(unsigned ssz) /* create ring of size ssz, random values will be assigned to members of the ring */
{
int i;
srn_t *mou /* mouth with a tendency to eat the tail*/, *ttmp /* type temporary */;
mou=malloc(sizeof(srn_t));
mou->s=rand();
mou->nx=NULL;
ttmp=mou;
for(i=1;i<ssz;++i) {
ttmp->nx=malloc(sizeof(srn_t));
ttmp->nx->s=rand();
ttmp=ttmp->nx; /* with ->nmove on */
}
ttmp->nx=mou;
return mou;
}
void prtring(srn_t *mou)
{
srn_t *st=mou;
do {
printf("%d ", st->s);
st=st->nx;
} while (st !=mou);
putchar('\n');
return;
}
void prtimesring(srn_t *mou, unsigned ntimes)
{
unsigned i=0;
srn_t *st=mou;
do {
printf("%d ", st->s);
st=st->nx;
i++;
} while (i !=ntimes);
putchar('\n');
return;
}
void freering(srn_t *mou)
{
srn_t *st=mou->nx, *nxt;
while (st !=mou) {
nxt=st->nx; /* we store the nx of this nx */
free(st); /* now we can delete it */
st=nxt;
}
free(mou);
}
int main(int argc, char *argv[])
{
if(argc != 3) {
printf("Usage: program to test a ring of integers\n");
printf("Arguments: 1) size of the ring 2) number of values required from ring (values will cycle through ring).\n");
exit(EXIT_FAILURE);
}
srn_t *m=creasrn(atoi(argv[1]));
prtring(m);
prtimesring(m, atoi(argv[2]));
freering(m);
return 0;
}