-
Notifications
You must be signed in to change notification settings - Fork 3
/
choose_option.c
144 lines (130 loc) · 2.44 KB
/
choose_option.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
#include "monty.h"
/**
* m_push - function that pusher an element to the stack
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void m_push(stack_t **stack, unsigned int line_number)
{
stack_t *new_node = NULL, *tmp = *stack;
if (head->mode)
{
m_pushq(stack, line_number);
return;
}
new_node = malloc(sizeof(stack_t));
if (!new_node)
{
dprintf(STDERR_FILENO, "Error: malloc failed\n");
freell(stack);
exit(EXIT_FAILURE);
}
if (isint(head->cmd[1]))
{
dprintf(STDERR_FILENO, "L%d: usage: push integer\n", line_number);
freell(stack);
free(new_node);
exit(EXIT_FAILURE);
}
new_node->n = atoi(head->cmd[1]);
new_node->next = NULL;
if (!(*stack))
{
new_node->prev = *stack;
*stack = new_node;
return;
}
while (tmp->next)
tmp = tmp->next;
tmp->next = new_node;
new_node->prev = tmp;
}
/**
* m_pall - Function that print all values on the stack
* starting from the top of the stack
*
* @stack: address of double linked list
* @line_number: number of line
*
*/
void m_pall(stack_t **stack, unsigned int line_number)
{
stack_t *tmp = *stack;
(void)line_number;
if (tmp == NULL)
return;
while (tmp->next != NULL)
tmp = tmp->next;
while (tmp)
{
printf("%d\n", tmp->n);
tmp = tmp->prev;
}
}
/**
* execute_ops - Function to execute options
*
* @stack: address of double linked list
*
*/
void execute_ops(stack_t **stack)
{
int i = 0;
instruction_t options[] = {
{"push", m_push},
{"pall", m_pall},
{"pint", mega_pint},
{"pop", m_pop},
{"swap", m_swap},
{"add", m_add},
{"nop", m_nop},
{"sub", m_sub},
{"div", m_div},
{"mul", m_mul},
{"mod", m_mod},
{"pchar", m_pchar},
{"pstr", m_pstr},
{"rotl", m_rotl},
{"rotr", m_rotr},
{"stack", m_stack},
{"queue", m_queue},
{NULL, NULL}
};
while (options[i].opcode)
{
if (!strcmp(options[i].opcode, head->cmd[0]))
{
(*options[i].f)(stack, head->line_number);
break;
}
i++;
}
if (!options[i].opcode)
{
dprintf(STDERR_FILENO, "L%d: unknown instruction %s\n",
head->line_number, head->cmd[0]);
freell(stack);
exit(EXIT_FAILURE);
}
}
/**
* freell - Function free all linked list
*
* @stack: address of double linked list
*
*/
void freell(stack_t **stack)
{
stack_t *tmp = NULL;
cmds *tmp2 = NULL;
for (; *stack; *stack = (*stack)->next, free(tmp))
tmp = *stack;
for (; head; head = head->next, free(tmp2))
{
tmp2 = head;
free(head->cmd[1]);
free(head->cmd[0]);
}
}