-
Notifications
You must be signed in to change notification settings - Fork 0
/
base_handlers.c
149 lines (123 loc) · 2.95 KB
/
base_handlers.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
#include "monty.h"
/**
* push - push a new node to the stack
*
* @stack: the stack to push to, represented as a pointer to a linked list
* @line_number: current line number of file being parsed
*/
void push(stack_t **stack, unsigned int line_number)
{
char *value_to_push, *endptr;
int value_to_push_int;
value_to_push = strtok(NULL, " ");
if (!value_to_push)
throw_usage_error(line_number);
value_to_push_int = strtol(value_to_push, &endptr, 10);
strip_newline(endptr);
if (*endptr != '\0' || endptr == value_to_push)
throw_usage_error(line_number);
handle_stack_insert(stack, value_to_push_int);
}
/**
* pop - remove the value at the top of the stack.
*
* @stack: the stack, represented as a pointer to a linked list
* @line_number: current line number of file being parsed
*/
void pop(stack_t **stack, unsigned int line_number)
{
stack_t *head = *stack;
if (!stack || !head)
{
fprintf(stderr, "L%d: can't pop an empty stack\n", line_number);
exit(EXIT_FAILURE);
}
*stack = head->next;
if (head->next)
head->next->prev = NULL;
free(head);
}
/**
* swap - swap the two top elements of the stack.
*
* @stack: the stack, represented as a pointer to a linked list
* @line_number: current line number of file being parsed
*/
void swap(stack_t **stack, unsigned int line_number)
{
stack_t *head = *stack;
stack_t *after_head;
if (!head || !stack)
{
fprintf(stderr, "L%d: can't swap, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
after_head = head->next;
if (!after_head)
{
fprintf(stderr, "L%d: can't swap, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
head->next = after_head->next;
head->prev = after_head;
after_head->prev = NULL;
after_head->next = head;
*stack = after_head;
}
/**
* rotl - rotate the stack to the top.
* The top element of the stack becomes the last one,
* and the second top element of the stack becomes the first one
*
* @stack: the stack, represented as a pointer to a linked list
* @line_number: current line number of file being parsed
*/
void rotl(stack_t **stack, unsigned int line_number __attribute__((unused)))
{
stack_t *head = *stack;
stack_t *tmp = *stack;
if (head && head->next)
{
while (tmp)
{
if (!tmp->next)
{
*stack = head->next;
head->next->prev = NULL;
head->next = NULL;
head->prev = tmp;
tmp->next = head;
break;
}
tmp = tmp->next;
}
}
}
/**
* rotr - rotate the stack to the bottom,
* the last element of the stack becomes the first.
*
* @stack: the stack, represented as a pointer to a linked list
* @line_number: current line number of file being parsed
*/
void rotr(stack_t **stack, unsigned int line_number __attribute__((unused)))
{
stack_t *tmp = *stack;
stack_t *head = *stack;
if (tmp && tmp->next)
{
while (tmp)
{
if (!tmp->next)
{
tmp->prev->next = NULL;
tmp->next = head;
tmp->prev = NULL;
head->prev = tmp;
*stack = tmp;
break;
}
tmp = tmp->next;
}
}
}