-
Notifications
You must be signed in to change notification settings - Fork 0
/
opcodes_2.c
184 lines (174 loc) · 3.92 KB
/
opcodes_2.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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
#include "monty.h"
/**
* mty_op_mod - Computes the rest of the division of the second \
* top element of the stack by the top element of the stack
* @stack: The pointer to the stack of data
* @line_number: The current line number
*/
void mty_op_mod(stack_t **stack, unsigned int line_number)
{
char data_mode = *get_data_mode(), error = TRUE;
stack_t *top0 = NULL, *top1 = NULL;
int result = 0;
if (stack != NULL && (*stack != NULL))
{
top0 = get_top_element(stack);
if (data_mode == DF_FIFO)
top1 = top0->next;
else if (data_mode == DF_LIFO)
top1 = top0->prev;
if (top1 != NULL)
{
if (top0->n == 0)
{
fprintf(stderr, "L%d: division by zero\n", line_number);
exit_program(EXIT_FAILURE);
}
result = top1->n % top0->n;
if (data_mode == DF_FIFO)
{
dequeue(stack);
}
else if (data_mode == DF_LIFO)
{
pop(stack);
}
top0 = get_top_element(stack);
top0->n = result;
error = FALSE;
}
}
if (error)
{
fprintf(stderr, "L%d: can't mod, stack too short\n", line_number);
exit_program(EXIT_FAILURE);
}
}
/**
* mty_op_pchar - Prints the char at the top of the stack \
* followed by a new line
* @stack: The pointer to the stack of data
* @line_number: The current line number
*/
void mty_op_pchar(stack_t **stack, unsigned int line_number)
{
stack_t *node = get_top_element(stack);
if (node != NULL)
{
if (is_ascii_char(node->n))
{
printf("%c\n", node->n);
}
else
{
fprintf(stderr, "L%d: can't pchar, value out of range\n", line_number);
exit_program(EXIT_FAILURE);
}
}
else
{
fprintf(stderr, "L%d: can't pchar, stack empty\n", line_number);
exit_program(EXIT_FAILURE);
}
}
/**
* mty_op_pstr - Prints the string starting at the top of the stack, \
* followed by a new line
* @stack: The pointer to the stack of data
* @line_number: The current line number
*/
void mty_op_pstr(stack_t **stack, unsigned int line_number)
{
char data_mode = *get_data_mode();
stack_t *node = NULL;
if (stack != NULL)
{
node = get_top_element(stack);
while ((node != NULL) && is_ascii_char(node->n) && (node->n != 0))
{
printf("%c", node->n);
if (data_mode == DF_FIFO)
{
node = node->next;
}
else if (data_mode == DF_LIFO)
{
node = node->prev;
}
}
}
printf("\n");
(void)line_number;
}
/**
* mty_op_rotl - Rotates the stack to the top
* @stack: The pointer to the stack of data
* @line_number: The current line number
*/
void mty_op_rotl(stack_t **stack, unsigned int line_number)
{
char data_mode = *get_data_mode();
stack_t *top = NULL, *bottom = NULL;
if ((stack != NULL) && (*stack != NULL))
{
top = get_top_element(stack);
bottom = get_bottom_element(stack);
if (data_mode == DF_FIFO)
{
if ((top != NULL) && (bottom != NULL) && (top != bottom))
{
bottom->prev->next = NULL;
bottom->next = top;
bottom->prev = NULL;
top->prev = bottom;
}
}
else if (data_mode == DF_LIFO)
{
if ((top != NULL) && (bottom != NULL) && (top != bottom))
{
top->prev->next = NULL;
top->next = bottom;
top->prev = NULL;
bottom->prev = top;
}
}
}
(void)line_number;
}
/**
* mty_op_rotr - Rotates the stack to the bottom
* @stack: The pointer to the stack of data
* @line_number: The current line number
*/
void mty_op_rotr(stack_t **stack, unsigned int line_number)
{
char data_mode = *get_data_mode();
stack_t *top = NULL, *bottom = NULL;
if ((stack != NULL) && (*stack != NULL))
{
top = get_top_element(stack);
bottom = get_bottom_element(stack);
if (data_mode == DF_FIFO)
{
if ((top != NULL) && (bottom != NULL) && (top != bottom))
{
top->next->prev = NULL;
bottom->next = top;
top->next = NULL;
top->prev = bottom;
}
}
else if (data_mode == DF_LIFO)
{
if ((top != NULL) && (bottom != NULL) && (top != bottom))
{
bottom->next->prev = NULL;
top->next = bottom;
bottom->next = NULL;
bottom->prev = top;
}
}
}
(void)line_number;
}