-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack_functions.c
159 lines (143 loc) · 3.01 KB
/
stack_functions.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
153
154
155
156
157
158
159
#include "monty.h"
/**
* push - push to the stack
* @stack: The address of the stack's head
* @line_number: The line which is being parsed
*
* Return: Void
*/
void push(stack_t **stack, unsigned int line_number)
{
char *arg = globals.opcode_arg;
stack_t *current, *new = malloc(sizeof(stack_t));
if (new == NULL)
{
fprintf(stderr, "Error: malloc failed\n");
free_list();
exit(EXIT_FAILURE);
}
if (arg == NULL || !isValidInteger(arg))
{
fprintf(stderr, "L%u: usage: push integer\n", line_number);
free_list();
exit(EXIT_FAILURE);
}
new->n = atoi(arg);
new->next = NULL;
current = *stack;
if (*stack == NULL)
{
new->prev = NULL;
globals.head = new;
return;
}
if (globals.isStackOn == 0 && *stack != NULL)
{
add_at_bottom(new);
return;
}
if (current != NULL)
{
while (current->next != NULL)
current = current->next;
new->prev = current;
current->next = new;
}
globals.opcode_arg = NULL;
}
/**
* pall - Prints all the values on the stack, starting from the top
* @stack: The address of the stack's head
* @line_number: The line which is being parsed(not used)
*
* Return: Void
*/
void pall(stack_t **stack, unsigned int line_number)
{
stack_t *current;
(void) line_number;
current = *stack;
if (current == NULL)
return;
while (current->next != NULL)
current = current->next;
while (current != NULL)
{
printf("%d\n", current->n);
current = current->prev;
}
}
/**
* pint - prints the value at the top of the stack
* @stack: points to a pointer to stack_t list
* @line_number: the number of the current line
*
* Return: Void
*/
void pint(stack_t **stack, unsigned int line_number)
{
stack_t *current = *stack;
if (current == NULL)
{
fprintf(stderr, "L%u: can't pint, stack empty\n", line_number);
exit(EXIT_FAILURE);
}
while (current->next != NULL)
{
current = current->next;
}
printf("%d\n", current->n);
}
/**
* pop - Removes the top element of the stack
* @stack: Points to a pointer to stack_t list
* @line_number: The number of the current line
*
* Return: Void
*/
void pop(stack_t **stack, unsigned int line_number)
{
stack_t *current = *stack, *previous;
if (current == NULL)
{
fprintf(stderr, "L%u: can't pop an empty stack\n", line_number);
exit(EXIT_FAILURE);
}
if (current->next == NULL)
{
free(current);
globals.head = NULL;
return;
}
while (current->next != NULL)
{
previous = current;
current = current->next;
}
previous->next = NULL;
free(current);
}
/**
* swap - swaps the top two elements of the stack
* @stack: Points to a pointer to stack_t list
* @line_number: The number of the current line
*
* Return: Void
*/
void swap(stack_t **stack, unsigned int line_number)
{
int previous_n;
stack_t *current = *stack;
if (current == NULL || current->next == NULL)
{
fprintf(stderr, "L%u: can't swap, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
while (current->next != NULL)
{
current = current->next;
previous_n = current->n;
}
current->n = current->prev->n;
current->prev->n = previous_n;
}