summaryrefslogtreecommitdiff
path: root/cmd_optimization.c
blob: 5135e5eeb5444b31f9150bb397de793de33e7f96 (plain)
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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   cmd_optimization.c                                 :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: dkaiser <dkaiser@student.42heilbronn.de    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/04/13 16:42:34 by dkaiser           #+#    #+#             */
/*   Updated: 2024/04/27 16:37:28 by dkaiser          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

static enum e_pscmd	get_cmd(t_list *cmd)
{
	if (cmd)
		return (*(enum e_pscmd *)cmd->content);
	else
		return (NO_CMD);
}

static void	set_last(t_list **last, t_list **cur)
{
	*last = (*last)->next;
	if (*last)
		*cur = (*last)->next;
	else
		*cur = NULL;
}

static void	optimize_redundant(t_psdata *data, enum e_pscmd cmd1,
		enum e_pscmd cmd2)
{
	t_list	*cur;
	t_list	*last;
	int		optimizations;

	cur = data->cmds;
	last = ft_lstnew(NULL);
	if (!last)
		return ;
	last->next = cur;
	optimizations = 0;
	while (cur && cur->next)
	{
		if ((get_cmd(cur) == cmd1 && get_cmd(cur->next) == cmd2)
			|| (get_cmd(cur) == cmd2 && get_cmd(cur->next) == cmd1))
		{
			last->next = cur->next->next;
			ft_lstdelone(cur->next, free);
			ft_lstdelone(cur, free);
			optimizations++;
		}
		set_last(&last, &cur);
	}
	if (optimizations)
		optimize_redundant(data, cmd1, cmd2);
}

static void	optimize_two_stack_ops(t_psdata *data, enum e_pscmd cmd1,
		enum e_pscmd cmd2, enum e_pscmd new_cmd)
{
	t_list	*cur;
	t_list	*last;
	int		optimizations;

	cur = data->cmds;
	last = ft_lstnew(NULL);
	if (!last)
		return ;
	optimizations = 0;
	while (cur && cur->next)
	{
		if ((get_cmd(cur) == cmd1 && get_cmd(cur->next) == cmd2)
			|| (get_cmd(cur) == cmd2 && get_cmd(cur->next) == cmd1))
		{
			last->next = cur->next;
			*(enum e_pscmd *)cur->next->content = new_cmd;
			ft_lstdelone(cur, free);
			optimizations++;
		}
		set_last(&last, &cur);
	}
	if (optimizations)
		optimize_two_stack_ops(data, cmd1, cmd2, new_cmd);
}

void	optimize_commands(t_psdata *data)
{
	optimize_redundant(data, PA, PB);
	optimize_redundant(data, RB, RRB);
	optimize_two_stack_ops(data, RA, RB, RR);
	optimize_two_stack_ops(data, SA, SB, SS);
}