monty/op_code_3.c at master · xy-human/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
#include "monty.h"

/**
 * op_pchar - function to print the character on top of the list
 * @stack: double pointer to a double linked list
 * @line_number: counter of FILE lines.
 * Return: None
 */
void op_pchar(stack_t **stack, unsigned int line_number)
{
	dataStruct.valDataToSave = 0;

	if (!(*stack))
	{
		fprintf(stderr, "L%d: can't pchar, stack empty\n", line_number);
		free_dlistint(*stack);
		exit(1);
	}
	if ((*stack)->n < 0 || (*stack)->n > 127)
	{
		fprintf(stderr, "L%d: can't pchar, value out of range\n", line_number);
		free_dlistint(*stack);
		exit(1);
	}
	printf("%c\n", (*stack)->n);
}

/**
 * op_pstr - function to print a string
 * @stack: double pointer to a double linked list
 * @line_number: counter of FILE lines.
 * Return: None
 */
void op_pstr(stack_t **stack, unsigned int line_number)
{

	stack_t *copyHead = NULL;
	(void)line_number;
	dataStruct.valDataToSave = 0;

	if ((*stack))
		copyHead = *stack;
	while (copyHead)
	{
		if (copyHead->n >= 0 && copyHead->n <= 127)
		{
			printf("%c", copyHead->n);
		}
		if (!copyHead->next || copyHead->next->n == 0 ||
		copyHead->next->n < 0 || copyHead->next->n > 127)
		{
			break;
		}
		copyHead = copyHead->next;
	}
	printf("\n");
}

/**
 * op_none - Nothing
 * @stack: double pointer to a double linked list
 * @line_number: counter of FILE lines.
 * Return: None
 */
void op_none(stack_t **stack, unsigned int line_number)
{
	(void)line_number;
	(void)stack;
	dataStruct.valDataToSave = 0;
}

/**
 * op_rotl - round the top to a bottom
 * @stack: double pointer to a double linked list
 * @line_number: counter of FILE lines.
 * Return: None
 */
void op_rotl(stack_t **stack, unsigned int line_number)
{
	stack_t *temp = *stack;
	stack_t *temp2 = NULL;

	if ((*stack)->next)
	{
		dataStruct.valDataToSave = 0;
		(void)line_number;
		*stack = (*stack)->next;
		(*stack)->prev = NULL;
		temp2 = *stack;

		while (temp2->next)
		{
			temp2 = temp2->next;
		}
		temp2->next = temp;
		temp->prev = temp2;
		temp->next = NULL;
	}
}