forked from wrightkhlebisol/monty
-
Notifications
You must be signed in to change notification settings - Fork 0
/
calc.c
105 lines (96 loc) · 2.31 KB
/
calc.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
#include "monty.h"
/**
* add - adds the top two elements of the stack
* @head: the pointer to the head node pointer
* @line_number: the line number
*
* Return: void
*/
void add(stack_t **head, unsigned int line_number)
{
if (*head == NULL || (*head)->next == NULL)
{
fprintf(stderr, "L%u: can't add, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
(*head)->next->n += (*head)->n;
pop(head, line_number);
}
/**
* sub - subtracts the top elements from the second in the stack
* @head: the pointer to the head node pointer
* @line_number: the line number
*
* Return: void
*/
void sub(stack_t **head, unsigned int line_number)
{
if (*head == NULL || (*head)->next == NULL)
{
fprintf(stderr, "L%u: can't sub, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
(*head)->next->n -= (*head)->n;
pop(head, line_number);
}
/**
* op_div - divides the 2nd top by the top element of the stack
* @head: the pointer to the head node pointer
* @line_number: the line number
*
* Return: void
*/
void op_div(stack_t **head, unsigned int line_number)
{
if (*head == NULL || (*head)->next == NULL)
{
fprintf(stderr, "L%u: can't div, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
if ((*head)->n == 0)
{
fprintf(stderr, "L%d: division by zero\n", line_number);
exit(EXIT_FAILURE);
}
(*head)->next->n /= (*head)->n;
pop(head, line_number);
}
/**
* mul - multiplies the 2nd top by the top element of the stack
* @head: the pointer to the head node pointer
* @line_number: the line number
*
* Return: void
*/
void mul(stack_t **head, unsigned int line_number)
{
if (*head == NULL || (*head)->next == NULL)
{
fprintf(stderr, "L%u: can't mul, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
(*head)->next->n *= (*head)->n;
pop(head, line_number);
}
/**
* mod - remainder of div of second top elem by top in stack
* @head: the pointer to the head node pointer
* @line_number: the line number
*
* Return: void
*/
void mod(stack_t **head, unsigned int line_number)
{
if (*head == NULL || (*head)->next == NULL)
{
fprintf(stderr, "L%u: can't mod, stack too short\n", line_number);
exit(EXIT_FAILURE);
}
if ((*head)->n == 0)
{
fprintf(stderr, "L%d: division by zero\n", line_number);
exit(EXIT_FAILURE);
}
(*head)->next->n %= (*head)->n;
pop(head, line_number);
}