stack_functions_3.c

#include "monty.h"

/**
 * compute_remainder - Computes the remainder of the division of the second
 * top element of the stack by the top element.
 * @stack_top: Pointer to the top of the stack.
 * @line_number: Current line number in the bytecode file.
 * Return: void
 */
void compute_remainder(stack_t **stack_top, unsigned int line_number)
{
	stack_t *current_node;
	int stack_size = 0, remainder;

	current_node = *stack_top;
	/* Count the number of elements in the stack */
	while (current_node)
	{
		current_node = current_node->next;
		stack_size++;
	}

	/* Check if there are at least two elements in the stack */
	if (stack_size < 2)
	{
		fprintf(stderr, "L%d: can't mod, stack too short\n", line_number);
		clean(*stack_top);
	}

	current_node = *stack_top;
	if (current_node->n == 0)
	{
		fprintf(stderr, "L%d: division by zero\n", line_number);
		clean(*stack_top);
	}

	remainder = current_node->next->n % current_node->n; /*Compute the remainder*/
	/* Store the remainder in the second node from the top */
	current_node->next->n = remainder;
	*stack_top = current_node->next; /* Move the top of the stack down */
	free(current_node); /* Free the original top node */
}

/**
 * print_char - Prints the ASCII character corresponding to the top
 * element of the stack.
 *
 * @stack_top: A pointer to the top of the stack.
 * @line_number: The line number in the source file where the operation occurs.
 *
 * Return: Nothing.
 */
void print_char(stack_t **stack_top, unsigned int line_number)
{
	int top_val;

	if (!stack_top || !*stack_top)
	{
		fprintf(stderr, "L%d: can't pchar, stack empty\n", line_number);
		clean(*stack_top);
	}

	top_val = (*stack_top)->n;
	if (top_val < 0 || top_val > 127)
	{
		fprintf(stderr, "L%d: can't pchar, value out of range\n", line_number);
		clean(*stack_top);
	}

	printf("%c\n", top_val);
}

/**
 * print_string - Prints the ASCII characters represented by the elements
 * in the stack until a non-printable or out-of-range value is encountered,
 * followed by a newline character.
 *
 * @stack_top: A pointer to the top of the stack.
 * @line_number: The line number in the source file where the operation occurs.
 *
 * Return: Nothing.
 */
void print_string(stack_t **stack_top, unsigned int line_number)
{
	stack_t *current_node;
	(void) line_number;

	if (!stack_top || !*stack_top)
	{
		printf("\n");
		return;
	}

	current_node = *stack_top;

	while (current_node && (current_node->n > 0 && current_node->n <= 127))
	{
		printf("%c", current_node->n);
		current_node = current_node->next;
	}

	printf("\n");
}

/**
 * rotl - Rotates the stack to the top, moving the top element to the bottom.
 *
 * @stack_top: A pointer to the top of the stack.
 * @line_number: The line number in the source file where the operation occurs.
 *
 * Return: Nothing.
 */
void rotl(stack_t **stack_top, unsigned int line_number)
{
	stack_t *last_node;
	(void) line_number;

	if (!stack_top || !*stack_top || !(*stack_top)->next)
		return;

	last_node = *stack_top;
	while (last_node->next)
		last_node = last_node->next;

	last_node->next = *stack_top;
	(*stack_top)->prev = last_node;
	*stack_top = (*stack_top)->next;
	(*stack_top)->prev->next = NULL;
	(*stack_top)->prev = NULL;
}

/**
 * rotr - Rotates the stack to the bottom, moving the bottom
 * element to the top.
 *
 * @stack_top: A pointer to the top of the stack.
 * @line_number: The line number in the source file where the operation occurs.
 *
 * Return: Nothing.
 */
void rotr(stack_t **stack_top, unsigned int line_number)
{
	stack_t *last_node;
	(void) line_number;

	if (!stack_top || !*stack_top || !(*stack_top)->next)
		return;

	last_node = *stack_top;
	while (last_node->next)
		last_node = last_node->next;

	last_node->next = *stack_top;
	last_node->prev->next = NULL;
	last_node->prev = NULL;
	(*stack_top)->prev = last_node;
	*stack_top = last_node;
}