-
Notifications
You must be signed in to change notification settings - Fork 0
/
operations2.c
124 lines (114 loc) · 2.4 KB
/
operations2.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
#include "monty.h"
/**
* add - add top two elements of stack
* @stack: stack
* @line_number: file line number
* Return: nothing
*/
void add(stack_t **stack, unsigned int line_number)
{
stack_t *curr = *stack;
int n;
if (curr == NULL || curr->next == NULL)
{
fprintf(stderr, "L%d: can't add, stack too short\n", line_number);
free_stack(*stack);
exit(EXIT_FAILURE);
}
n = curr->next->n + curr->n;
pop(stack, line_number);
pop(stack, line_number);
curr->n = n;
curr->next = *stack;
curr->prev = NULL;
*stack = curr;
}
/**
* nop - do nothing
* @stack: stack
* @line_number: file line number
* Return: nothing
*/
void nop(stack_t **stack, unsigned int line_number)
{
(void)line_number;
(void)*stack;
}
/**
* sub - subtract top two elements of stack
* @stack: stack
* @line_number: file line number
* Return: nothing
*/
void sub(stack_t **stack, unsigned int line_number)
{
stack_t *curr = *stack;
int n;
if (curr == NULL || curr->next == NULL)
{
fprintf(stderr, "L%d: can't sub, stack too short\n", line_number);
free_stack(*stack);
exit(EXIT_FAILURE);
}
n = curr->next->n - curr->n;
pop(stack, line_number);
pop(stack, line_number);
curr->n = n;
curr->next = *stack;
curr->prev = NULL;
*stack = curr;
}
/**
* div_op - divide top two elements of stack
* @stack: stack
* @line_number: file line number
* Return: nothing
*/
void div_op(stack_t **stack, unsigned int line_number)
{
stack_t *curr = *stack;
int n;
if (curr == NULL || curr->next == NULL)
{
fprintf(stderr, "L%d: can't div, stack too short\n", line_number);
free_stack(*stack);
exit(EXIT_FAILURE);
}
if (curr->n == 0)
{
fprintf(stderr, "L%d: can't div, division by zero\n", line_number);
free_stack(*stack);
exit(EXIT_FAILURE);
}
n = curr->next->n / curr->n;
pop(stack, line_number);
pop(stack, line_number);
curr->n = n;
curr->next = *stack;
curr->prev = NULL;
*stack = curr;
}
/**
* mul - multiply top two elements of stack
* @stack: stack
* @line_number: file line number
* Return: nothing
*/
void mul(stack_t **stack, unsigned int line_number)
{
stack_t *curr = *stack;
int n;
if (curr == NULL || curr->next == NULL)
{
fprintf(stderr, "L%d: can't mul, stack too short\n", line_number);
free_stack(*stack);
exit(EXIT_FAILURE);
}
n = curr->next->n * curr->n;
pop(stack, line_number);
pop(stack, line_number);
curr->n = n;
curr->next = *stack;
curr->prev = NULL;
*stack = curr;
}