monty/funcs.c at master · sermachage/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
#include "monty.h"
/**
 * swap - swaps the top 2 elemets of stack
 * @stack: pointer to the top of stack
 * @line_number: the line number in file
 * Return: void
 */
void swap(stack_t **stack, unsigned int line_number)
{
	stack_t *temp;
	int n = 0;

	temp = *stack;
	if (temp == NULL || temp->next == NULL)
	{
		dprintf(2, "L%d: can't swap, stack too short\n", line_number);
		free_stack(*stack);
		exit(EXIT_FAILURE);
	}
	else
	{
		n = temp->n;
		temp->n = temp->next->n;
		temp->next->n = n;
	}
}
/**
 * nop - function that does nothing
 * @stack: pointer to the top of stack
 * @line_number: the line number of file
 * Return: void
 */
void nop(stack_t **stack, unsigned int line_number)
{
	(void) stack;
	(void) line_number;
}
/**
 * add - sums up the top 2 values in the stack
 * @stack: pointer to the top of stack
 * @line_number: the line number
 * Return: void
 */
void add(stack_t **stack, unsigned int line_number)
{
	stack_t *temp = NULL;
	int sum = 0;

	if (*stack == NULL || (*stack)->next == NULL)
	{
		dprintf(2, "L%d: can't add, stack too short\n", line_number);
		free_stack(*stack);
		exit(EXIT_FAILURE);
	}
	temp = (*stack)->next;
	sum += (*stack)->next->n;
	sum += (*stack)->n;
	pop(stack, line_number);
	temp->n = sum;
}
/**
 * sub - substracts the fir two values in the stack
 * @stack: the pointer to top of stack
 * @line_number: the line in the file
 * Return: viod
 */
void sub(stack_t **stack, unsigned int line_number)
{
	stack_t *temp;
	int result = 0;

	if (*stack == NULL || (*stack)->next == NULL)
	{
		dprintf(2, "L%d: can't sub, stack too short\n", line_number);
		free_stack(*stack);
		exit(EXIT_FAILURE);
	}
	temp = (*stack)->next;
	result = temp->n;
	result -= (*stack)->n;
	pop(stack, line_number);
	temp->n = result;
}
/**
 * divd - divides the first two elements of stack
 * @stack: pointer to top of stack
 * @line_number: the line number in monty file
 * Return: void
 */
void divd(stack_t **stack, unsigned int line_number)
{
	stack_t *temp = NULL;
	int result = 0;

	if (*stack == NULL || (*stack)->next == NULL)
	{
		dprintf(2, "L%d: can't div, stack too short\n", line_number);
		free_stack(*stack);
		exit(EXIT_FAILURE);
	}
	if ((*stack)->n == 0)
	{
		dprintf(2, "L%d: division by zero\n", line_number);
		free_stack(*stack);
		exit(EXIT_FAILURE);
	}

	temp = (*stack)->next;
	result = temp->n;
	result /= (*stack)->n;
	pop(stack, line_number);
	temp->n = result;
}