monty/math_stack_opcodes.c at master · kjowong/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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include "monty.h"
/**
 * add - adds the top two elements of the stack
 * @h: head pointer
 * @line_number: line number in the file with Monty byte code
 * Return: none
 */
void add(stack_t **h, unsigned int line_number)
{
	stack_t *tmp;
	int sum;

	if (list_len(*h) < 2)
	{
		printf("L%u: can't add, stack too short\n", line_number);
		globals.retval = -1;
		return;
	}
	tmp = (*h)->next;
	sum = (*h)->n + tmp->n;
	tmp->n = sum;
	pop(h, line_number);
	globals.retval = 0;
}

/**
 * sub - subtracts the top element of the stack from the 2nd top
 * @h: head pointer
 * @line_number: line number in the file with Monty byte code
 * Return: none
 */
void sub(stack_t **h, unsigned int line_number)
{
	stack_t *tmp;

	if (list_len(*h) < 2)
	{
		printf("L%u: can't sub, stack too short\n", line_number);
		globals.retval = -1;
		return;
	}
	tmp = (*h)->next;
	tmp->n -= (*h)->n;
	pop(h, line_number);
	globals.retval = 0;
}

/**
 * _div - divides the top two elements of the stack
 * @h: head pointer
 * @line_number: line number in the file with Monty byte code
 * Return: none
 */
void _div(stack_t **h, unsigned int line_number)
{
	stack_t *tmp;

	if (list_len(*h) < 2)
	{
		printf("L%d: can't div, stack too short\n", line_number);
		globals.retval = -1;
		return;
	}
	if ((*h)->n == 0)
	{
		printf("L%d: division by zero\n", line_number);
		globals.retval = -1;
		return;
	}
	tmp = (*h)->next;
	tmp->n /= (*h)->n;
	pop(h, line_number);
	globals.retval = 0;
}

/**
 * mul - multiplies the top two elements of the stack
 * @h: head pointer
 * @line_number: line number in the file with Monty byte code
 * Return: none
 */
void mul(stack_t **h, unsigned int line_number)
{
	stack_t *tmp;
	int result;

	if (list_len(*h) < 2)
	{
		printf("L%d: can't mul, stack too short\n", line_number);
		globals.retval = -1;
		return;
	}
	if ((*h)->n == 0)
	{
		printf("L%d: division by zero\n", line_number);
		globals.retval = -1;
		return;
	}
	tmp = (*h)->next;
	result = (tmp->n * (*h)->n);
	pop(h, line_number);
	tmp->n = result;
	globals.retval = 0;
}

/**
 * mod - mods the top two elements of the stack
 * @h: head pointer
 * @line_number: line number in the file with Monty byte code
 * Return: none
 */
void mod(stack_t **h, unsigned int line_number)
{
	stack_t *tmp;
	int result;

	if (list_len(*h) < 2)
	{
		printf("L%d: can't mod, stack too short\n", line_number);
		globals.retval = -1;
		return;
	}
	if ((*h)->n == 0)
	{
		printf("L%d: division by zero\n", line_number);
		globals.retval = -1;
		return;
	}
	tmp = (*h)->next;
	result = (tmp->n % (*h)->n);
	pop(h, line_number);
	tmp->n = result;
	globals.retval = 0;
}