-
Notifications
You must be signed in to change notification settings - Fork 0
/
arithmetic_ops.c
118 lines (109 loc) · 2.53 KB
/
arithmetic_ops.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
#include "monty.h"
/**
* addstack - adds the two top elements of the stack
* @structstack: address of the first node
* @lineno: line number
*
* Return: nothing
*/
void addstack(stack_t **structstack, unsigned int lineno)
{
stack_t *current = *structstack, *next;
if (!current || !current->next)
{
fprintf(stderr, "L%u: can't add, stack too short\n", lineno);
exit(EXIT_FAILURE);
}
next = current->next;
next->n += current->n;
popstack(structstack, lineno);
}
/**
* substack - subtracts the two top elements of the stack
* @structstack: address of the first node
* @lineno: line number
*
* Return: nothing
*/
void substack(stack_t **structstack, unsigned int lineno)
{
stack_t *current = *structstack, *next;
if (!current || !current->next)
{
fprintf(stderr, "L%u: can't sub, stack too short\n", lineno);
exit(EXIT_FAILURE);
}
next = current->next;
next->n -= current->n;
popstack(structstack, lineno);
}
/**
* divstack - divides the two top elements of the stack
* @structstack: address of the first node
* @lineno: line number
*
* Return: nothing
*/
void divstack(stack_t **structstack, unsigned int lineno)
{
stack_t *current = *structstack, *next;
if (!current || !current->next)
{
fprintf(stderr, "L%u: can't div, stack too short\n", lineno);
exit(EXIT_FAILURE);
}
if (current->n == 0)
{
fprintf(stderr, "L%u: division by zero\n", lineno);
exit(EXIT_FAILURE);
}
next = current->next;
next->n /= current->n;
popstack(structstack, lineno);
}
/**
* mulstack - multiplies the two top elements of the stack
* @structstack: address of the first node
* @lineno: line number
*
* Return: nothing
*/
void mulstack(stack_t **structstack, unsigned int lineno)
{
stack_t *current = *structstack, *next;
if (!current || !current->next)
{
fprintf(stderr, "L%u: can't mul, stack too short\n", lineno);
exit(EXIT_FAILURE);
}
next = current->next;
next->n *= current->n;
popstack(structstack, lineno);
}
/**
* modstack - computes mod of the two top elements of the stack
* @structstack: address of the first node
* @lineno: line number
*
* Return: nothing
*/
void modstack(stack_t **structstack, unsigned int lineno)
{
stack_t *current = *structstack, *next;
if (!current || !current->next)
{
fprintf(stderr, "L%u: can't mod, stack too short\n", lineno);
exit(EXIT_FAILURE);
}
if (current->n == 0)
{
fprintf(stderr, "L%u: division by zero\n", lineno);
exit(EXIT_FAILURE);
}
next = current->next;
if (next->n < 0)
next->n = current->n;
else
next->n %= current->n;
popstack(structstack, lineno);
}