node.c

#include "monty.h"

int num;

/**
 * newnode - creates a new node
 * @i: the value to add in the node
 * Return: pointer to the new node
 */
stack_t *newnode(int i)
{
	stack_t *new;

	new = malloc(sizeof(stack_t));
	if (new == NULL)
	{
		dprintf(2, "Error: malloc failed\n");
		exit(EXIT_FAILURE);
	}
	new->n = i;
	new->prev = NULL;
	new->next = NULL;

	return (new);
}
/**
 * push - adds a node into stack
 * @stack: pointer to the top of stack
 * @line_number: the number of line a file
 * Return: void
 */
void push(stack_t **stack, unsigned int line_number)
{
	stack_t *temp = NULL;
	(void) line_number;

	temp = newnode(num);

	temp->next = *stack;

	if (*stack != NULL)
	{
		(*stack)->prev = temp;
	}
	*stack = temp;
}
/**
 * pall - prints all the stack value
 * @stack: the pointer to the top of stack
 * @line_number: unsigned integer
 * Return: void
 */
void pall(stack_t **stack, unsigned int line_number)
{
	stack_t *node;

	(void) line_number;

	node = *stack;
	while (node != NULL)
	{
		dprintf(1, "%d\n", node->n);
		node = node->next;
	}
}
/**
 * pint - prints the value at the top of the stack
 * @stack: double pointer to the head of the stack
 * @line_number: line number
 */
void pint(stack_t **stack, unsigned int line_number)
{
	if (*stack == NULL || stack == NULL)
	{
		dprintf(2, "L%d: can't pint, stack empty\n", line_number);
		clear_stack(stack);
		exit(EXIT_FAILURE);
	}
	else
		dprintf(1, "%d\n", (*stack)->n);

}

/**
 * pop - removes the top element from the stack
 * @stack: pointer to the top of stack
 * @line_number: line number
 * Return: void
 */
void pop(stack_t **stack, unsigned int line_number)
{
	stack_t *temp;

	if (!*stack)
	{
		dprintf(2, "L%u: can't pop an empty stack\n", line_number);
		free_stack(*stack);
		exit(EXIT_FAILURE);
	}

	else
	{
		temp = (*stack)->next;
		free(*stack);
		if (temp)
			temp->prev = NULL;
		*stack = temp;
	}
}