monty/operations3.c at main · chimaskyy/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
137
138
139
140
141
142
143
144
145
146
147
#include "monty.h"

/**
 * mod_fun - modulo of 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 mod_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 mod, 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);
}

/**
 * pchar_fun - prints char at top of stack using n as ascii code
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void pchar_fun(stack_t **stack, unsigned int line_number)
{
	if (stack == NULL || *stack == NULL)
	{
		fprintf(stderr, "L%d: can't pchar, stack empty\n", line_number);
		errno = -999;
		return;
	}
	if ((*stack)->n < 0 || (*stack)->n > 127)
	{
		fprintf(stderr, "L%d: can't pchar, value out of range\n", line_number);
		errno = -999;
		return;
	}
	printf("%c\n", (*stack)->n);
}

/**
 * pstr_fun - prints stack as string
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void pstr_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *curr;

	(void)line_number;
	if (stack == NULL || *stack == NULL)
	{
		printf("\n");
		return;
	}
	curr = *stack;

	while (curr)
	{
		if (curr->n > 0 && curr->n <= 127)
		{
			printf("%c", curr->n);
		}
		else
		{
			printf("\n");
			return;
		}
		curr = curr->next;
	}
	printf("\n");
}

/**
 * rotl_fun - moves the second top to top and top to last
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void rotl_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *init_stack, *curr;

	(void)line_number;
	if (stack == NULL || *stack == NULL || (*stack)->next == NULL)
	{
		return;
	}
	init_stack = *stack;

	*stack = (*stack)->next;
	(*stack)->prev = NULL;
	curr = *stack;
	while (curr->next != NULL)
	{
		curr = curr->next;
	}

	curr->next = init_stack;
	init_stack->prev = curr;
	init_stack->next = NULL;
}

/**
 * rotr_fun - rotates to the bottom (last becomes first)
 * @stack: pointer to top (pointer to pointer)
 * @line_number: liner number in the file
 * Return: No return
 */
void rotr_fun(stack_t **stack, unsigned int line_number)
{
	stack_t *curr;

	(void)line_number;
	if (stack == NULL || *stack == NULL || (*stack)->next == NULL)
	{
		return;
	}

	curr = *stack;
	while (curr->next != NULL)
	{
		curr = curr->next;
	}

	curr->prev->next = NULL;
	curr->prev = NULL;
	(*stack)->prev = curr;
	curr->next = *stack;
	*stack = curr;
}