-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack_dma.c
100 lines (77 loc) · 1.28 KB
/
stack_dma.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
#include<stdio.h>
#include<stdlib.h>
int *stack;
int top=-1;
int size=0;
void createStack(int isize){
size=isize;
stack = (int*)malloc(size*sizeof(int));
if(!stack){
exit(0);
}
else{
printf("Memory is successfully allocated\n");
}
}
int isfull(){
if(top==size-1){
return 1;
}
else{
return 0;
}
}
int isempty(){
if(top==-1){
return 1;
}
else{
return 0;
}
}
void resizeStack(){
size = size*2;
stack = (int*)realloc(stack,size*sizeof(int));
if(!stack){
printf("Memory is not allocated\n");
exit(0);
}
}
void push(int val){
// printf(" push function called \n");
if(isfull()){
printf(" Overflow \n" );
resizeStack();
}
top = top+1;
stack[top]=val;
}
void show(){
printf("show function called \n");
for(int i=0;i<=top;i++){
printf("At %d index the value is %d \n",i,stack[i]);
}
}
void pop(){
printf("pop function called \n");
if(isempty()){
printf("Underflow\n");
}
top = top-1;
}
void peek(){
printf("peek function called \n");
printf("%d\n",stack[top]);
}
int main(){
createStack(2);
push(10);
push(12);
push(13);
push(14);
show();
pop();
show();
peek();
peek();
}