-
Notifications
You must be signed in to change notification settings - Fork 1
/
monty_funcs_2.c
123 lines (110 loc) · 3.71 KB
/
monty_funcs_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
#include "monty.h"
void monty_add(stack_t **stack, unsigned int line_number);
void monty_sub(stack_t **stack, unsigned int line_number);
void monty_div(stack_t **stack, unsigned int line_number);
void monty_mul(stack_t **stack, unsigned int line_number);
void monty_mod(stack_t **stack, unsigned int line_number);
/**
* monty_add - Adds the top two values of a stack_t linked list.
* @stack: A pointer to the top mode node of a stack_t linked list.
* @line_number: The current working line number of a Monty bytecodes file.
*
* Description: The result is stored in the second value node
* from the top and the top value is removed.
*/
void monty_add(stack_t **stack, unsigned int line_number)
{
if ((*stack)->next == NULL || (*stack)->next->next == NULL)
{
set_op_tok_error(short_stack_error(line_number, "add"));
return;
}
(*stack)->next->next->n += (*stack)->next->n;
monty_pop(stack, line_number);
}
/**
* monty_sub - Subtracts the second value from the top of
* a stack_t linked list by the top value.
* @stack: A pointer to the top mode node of a stack_t linked list.
* @line_number: The current working line number of a Monty bytecodes file.
*
* Description: The result is stored in the second value node
* from the top and the top value is removed.
*/
void monty_sub(stack_t **stack, unsigned int line_number)
{
if ((*stack)->next == NULL || (*stack)->next->next == NULL)
{
set_op_tok_error(short_stack_error(line_number, "sub"));
return;
}
(*stack)->next->next->n -= (*stack)->next->n;
monty_pop(stack, line_number);
}
/**
* monty_div - Divides the second value from the top of
* a stack_t linked list by the top value.
* @stack: A pointer to the top mode node of a stack_t linked list.
* @line_number: The current working line number of a Monty bytecodes file.
*
* Description: The result is stored in the second value node
* from the top and the top value is removed.
*/
void monty_div(stack_t **stack, unsigned int line_number)
{
if ((*stack)->next == NULL || (*stack)->next->next == NULL)
{
set_op_tok_error(short_stack_error(line_number, "div"));
return;
}
if ((*stack)->next->n == 0)
{
set_op_tok_error(div_error(line_number));
return;
}
(*stack)->next->next->n /= (*stack)->next->n;
monty_pop(stack, line_number);
}
/**
* monty_mul - Multiplies the second value from the top of
* a stack_t linked list by the top value.
* @stack: A pointer to the top mode node of a stack_t linked list.
* @line_number: The current working line number of a Monty bytecodes file.
*
* Description: The result is stored in the second value node
* from the top and the top value is removed.
*/
void monty_mul(stack_t **stack, unsigned int line_number)
{
if ((*stack)->next == NULL || (*stack)->next->next == NULL)
{
set_op_tok_error(short_stack_error(line_number, "mul"));
return;
}
(*stack)->next->next->n *= (*stack)->next->n;
monty_pop(stack, line_number);
}
/**
* monty_mod - Computes the modulus of the second value from the
* top of a stack_t linked list by the top value.
* @stack: A pointer to the top mode node of a stack_t linked list.
* @line_number: The current working line number of a Monty bytecodes file.
*
* Description: The result is stored in the second value node
* from the top and the top value is removed.
*/
void monty_mod(stack_t **stack, unsigned int line_number)
{
if ((*stack)->next == NULL || (*stack)->next->next == NULL)
{
set_op_tok_error(short_stack_error(line_number, "mod"));
return;
}
if ((*stack)->next->n == 0)
{
set_op_tok_error(div_error(line_number));
return;
}
(*stack)->next->next->n %= (*stack)->next->n;
monty_pop(stack, line_number);
}