forked from KFredlund/monty
-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils_add_swap.c
124 lines (119 loc) · 2.58 KB
/
utils_add_swap.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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include "monty.h"
/**
* op_add - adds the data from the top two nodes, creates a new node
* and replaces them
* @head: List node passed in
* @line_number: line number var
* Return: Never
*/
void op_add(stack_t **head, unsigned int line_number)
{
stack_t *current;
int i = 0;
if (*head && (*head)->next)
{
current = *head;
i = current->n + current->next->n;
current->next->n = i;
free(current);
*head = (*head)->next;
}
else
handle_error(8, line_number, "hiiii");
}
/**
* op_swap - swaps the top two nodes
* @head: List node passed in
* @line_number: line number var
* Return: Never
*/
void op_swap(stack_t **head, unsigned int line_number)
{
stack_t *current;
stack_t *hold = NULL;
if (*head && (*head)->next)
{
current = *head;
hold = (*head)->next;
current->next = hold->next;
current->prev = hold;
hold->prev = NULL;
if (hold->next)
hold->next->prev = current;
hold->next = current;
}
else
handle_error(7, line_number, "hiiiii");
*head = hold;
}
/**
* op_sub - subracts the data of the top node from the second,
* and creates a new node and replaces them
* @head: List node passed in
* @line_number: line number var
* Return: Never
*/
void op_sub(stack_t **head, unsigned int line_number)
{
stack_t *current;
int i = 0;
if (*head && (*head)->next)
{
current = *head;
i = current->next->n - current->n;
current->next->n = i;
current->next->prev = NULL;
*head = (*head)->next;
free(current);
}
else
handle_error(9, line_number, "hiiiii");
}
/**
* op_div - divides the data of the top node from the second,
* and creates a new node and replaces them
* @head: List node passed in
* @line_number: line number var
* Return: Never
*/
void op_div(stack_t **head, unsigned int line_number)
{
stack_t *current;
int i = 0;
if (*head && (*head)->next)
{
if ((*head)->n == 0)
handle_error(11, line_number, "hiiiii");
current = *head;
i = current->next->n / current->n;
current->next->n = i;
current->next->prev = NULL;
*head = (*head)->next;
free(current);
}
else
handle_error(10, line_number, "hiiiii");
}
/**
* op_mul - multiplies the data of the top node from the second,
* and creates a new node and replaces them
* @head: List node passed in
* @line_number: line number var
* Return: Never
*/
void op_mul(stack_t **head, unsigned int line_number)
{
stack_t *current;
int i = 0;
if (*head && (*head)->next)
{
current = *head;
i = current->n * current->next->n;
current->next->n = i;
current->next->prev = NULL;
*head = (*head)->next;
free(current);
}
else
handle_error(12, line_number, "hiiiii");
}