monty/opcode_funct2.c at main · PcNerd9/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
135
136
#include "monty.h"
#include <stdio.h>
#include <stdlib.h>

/**
 * add_f - add the value on top of the stack with the second
 * value on the stack
 * @stack: the pointer to the top of the stack
 * @line_number: the line number of the instruction
 * @to_free: a struct of  all the space to free before exiting program
 *
 * Return: nothing
 */
void add_f(stack_t **stack, unsigned int line_number, free_t to_free)
{
	stack_t *tmp;

	if (*stack == NULL || (*stack)->next == NULL)
	{
		free_strings(to_free.command);
		free(to_free.instruction);
		fclose(to_free.fd);
		free_stack(stack);
		fprintf(stderr, "L%d: can't add, stack too short\n", line_number);
		exit(EXIT_FAILURE);
	}
	tmp = *stack;
	*stack = (*stack)->next;
	(*stack)->n = (*stack)->n + tmp->n;
	free(tmp);
}
/**
 * nop_f - do nothing
 * @stack: the pointer to the top of the stack
 * @line_number: the line number of instruction
 * @to_free: spaces to free before program exit
 *
 * Return: nothing
 */

void nop_f(stack_t **stack, unsigned int line_number, free_t to_free)
{
	(void)stack;
	(void)line_number;
	(void)to_free;
}

/**
 * sub_f - subtract the top element of the stack from the
 * second top element of the stack
 * @stack: the pointer to the top of the stack
 * @line_number: the line number of instruction
 * @to_free: spaces to free before program exit
 *
 * Return: nothing
 */

void sub_f(stack_t **stack, unsigned int line_number, free_t to_free)
{
	stack_t *tmp;

	if (*stack == NULL || (*stack)->next == NULL)
	{
		free_strings(to_free.command);
		free(to_free.instruction);
		fclose(to_free.fd);
		free_stack(stack);
		fprintf(stderr, "L%d: can't sub, stack too short\n", line_number);
		exit(EXIT_FAILURE);
	}
	tmp = *stack;
	*stack = (*stack)->next;
	(*stack)->n = (*stack)->n - tmp->n;
	free(tmp);
}

/**
 * div_f - divid the second top element of the stack
 * by the top element of the stack
 * @stack: the pointer to the top of the stack
 * @line_number: the line number of instruction
 * @to_free: spaces to free before program exit
 *
 * Return: nothing
 */

void div_f(stack_t **stack, unsigned int line_number, free_t to_free)
{
	stack_t *tmp;

	if (*stack == NULL || (*stack)->next == NULL || (*stack)->n == 0)
	{
		if (*stack == NULL || (*stack)->next == NULL)
			fprintf(stderr, "L%d: can't div, stack too short\n", line_number);
		else
			fprintf(stderr, "L%d: division by zero\n", line_number);
		free_strings(to_free.command);
		free(to_free.instruction);
		fclose(to_free.fd);
		free_stack(stack);
		exit(EXIT_FAILURE);
	}
	tmp = *stack;
	*stack = (*stack)->next;
	(*stack)->n = (*stack)->n / tmp->n;
	free(tmp);
}

/**
 * mul_f - multiplies the second top element of the stack
 * with the top element of the stack
 * @stack: the pointer to the top of the stack
 * @line_number: the line number of instruction
 * @to_free: spaces to free before program exit
 *
 * Return: nothing
 */

void mul_f(stack_t **stack, unsigned int line_number, free_t to_free)
{
	stack_t *tmp;

	if (*stack == NULL || (*stack)->next == NULL)
	{
		free_strings(to_free.command);
		free(to_free.instruction);
		fclose(to_free.fd);
		free_stack(stack);
		fprintf(stderr, "L%d: can't mul, stack too short\n", line_number);
		exit(EXIT_FAILURE);
	}
	tmp = *stack;
	*stack = (*stack)->next;
	(*stack)->n = (*stack)->n * tmp->n;
	free(tmp);
}