monty/operations2.c at main · bravemaster3/monty · GitHub

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
#include "monty.h"

/**
 * add_fun - adds the top two elements of the stack
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void add_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *curr;
	int first = 0;

	if (stack == NULL || *stack == NULL || stack_len(*stack) < 2)
	{
		fprintf(stderr, "L%d: can't add, stack too short\n", line_number);
		errno = -999;
		return;
	}
	curr = *stack;
	first = curr->n;
	curr = curr->next;
	curr->n = curr->n + first;
	del_at_indx(stack, 0);
}

/**
 * nop_fun - remove top element of the stack
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return value
 */

void nop_fun(stack_t **stack, unsigned int line_number)
{
	(void)stack;
	(void)line_number;
}

/**
 * sub_fun - subs the top two elements of the stack
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void sub_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *curr;
	int first = 0;

	if (stack == NULL || *stack == NULL || stack_len(*stack) < 2)
	{
		fprintf(stderr, "L%d: can't sub, stack too short\n", line_number);
		errno = -999;
		return;
	}
	curr = *stack;
	first = curr->n;
	curr = curr->next;
	curr->n = curr->n - first;
	del_at_indx(stack, 0);
}

/**
 * div_fun - divides the top two elements of the stack
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void div_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *curr;
	int first = 0;

	if (stack == NULL || *stack == NULL || stack_len(*stack) < 2)
	{
		fprintf(stderr, "L%d: can't div, stack too short\n", line_number);
		errno = -999;
		return;
	}
	curr = *stack;
	first = curr->n;
	curr = curr->next;
	if (first == 0)
	{
		fprintf(stderr, "L%d: division by zero\n", line_number);
		errno = -999;
		return;
	}
	curr->n = curr->n / first;
	del_at_indx(stack, 0);
}

/**
 * mul_fun - multiplies the top two elements of the stack
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void mul_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *curr;
	int first = 0;

	if (stack == NULL || *stack == NULL || stack_len(*stack) < 2)
	{
		fprintf(stderr, "L%d: can't mul, stack too short\n", line_number);
		errno = -999;
		return;
	}
	curr = *stack;
	first = curr->n;
	curr = curr->next;
	curr->n = curr->n * first;
	del_at_indx(stack, 0);
}