42-exam_beginner/rpn_calc_list.c at master · boodii0308/42-exam_beginner · 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
#include "ft_list_calc.h"

static t_list	*push(t_list *stack, int nbr)
{
	t_list	*n;

	if (!(n = malloc(sizeof(t_list))))
		return (NULL);
	n->num = nbr;
	n->next = stack;
	stack = n;
	return (stack);
}

static t_list	*pop(t_list *stack)
{
	t_list	*tmp;

	tmp = stack;
	stack = stack->next;
	free(tmp);
	return (stack);
}

static void		clear_list(t_list *stack)
{
	while (stack)
		stack = pop(stack);
}

static t_list	*push_from_str(t_list *stack, char *s)
{
	/* 12 chars is intmin + '\0' */
	char	tmp[12];
	int		i;
	int		nbr;

	/* copy number to tmp string */
	i = 0;
	if (ISSIGN)
	{
		tmp[i] = *s;
		i++;
		s++;
	}
	while (ISNUM)
	{
		tmp[i] = *s;
		i++;
		s++;
	}
	tmp[i] = '\0';
	nbr = atoi(tmp);
	return (push(stack, nbr));
}

static t_list	*calc(t_list *stack, char op)
{
	int	x;
	int	y;

	y = stack->num;
	stack = pop(stack);
	x = stack->num;
	stack = pop(stack);
	if (op == '+')
		return (push(stack, (x + y)));
	else if (op == '-')
		return (push(stack, (x - y)));
	else if (op == '*')
		return (push(stack, (x * y)));
	else if (op == '/' && y != 0)
		return (push(stack, (x / y)));
	else if (op == '%' && y != 0)
		return (push(stack, (x % y)));
	else
		return (NULL);
}

int			main(int argc, char **argv)
{
	char	*s;
	t_list	*stack;

	if (argc != 2)
	   printf("Error\n");
	else
	{
		s = *(argv + 1);
		stack = NULL;
		while (*s)
		{
			if (ISNUM || ISSIGN)
			{
				/* malloc error case */
				if (!(stack = push_from_str(stack, s)))
				{
					clear_list(stack);
					return (1);
				}
				s++;
				while (ISNUM)
					s++;
			}
			else if (*s == ' ')
				s++;
			else if (ISOP)
			{
				/* error when stack is empty or contatins only one element */
				if (!stack || !stack->next)
				{
					clear_list(stack);
					printf("Error\n");
					return (1);
				}
				if(!(stack = calc(stack, *s)))
				{
					clear_list(stack);
					printf("Error\n");
					return (1);
				}
				s++;
			}
			else
			{
				clear_list(stack);
				printf("Error\n");
				return (1);
			}
		}
		if (stack->next)
		{
			printf("Error\n");
			return (1);
		}
		else
			printf("%i\n", stack->num);
	}
}