/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   f_search_map.c                                     :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2019/04/27 20:47:22 by hulamy            #+#    #+#             */
/*   Updated: 2019/06/01 15:12:08 by hulamy           ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "fillit.h"

/*
** function that look if a tretri fit in a place
*/

unsigned int	fit_in_place(unsigned int *map, t_fillist *lst, int sze, int i)
{
	unsigned int	tmp;
	unsigned int	mask;
	unsigned int	tetri;
	int				n;
	int				r;

	n = lst->num;
	r = lst->rank;
	i = lst->height;
	tetri = lst->tetribit << 16 >> lst->width;
	tmp = 0;
	mask = ~0u << (32 - lst->width);
	while (i--)
	{
		if (tmp & tetri)
			return (0);
		if (r >= 32 && ++n)
			r -= 32;
		tmp = (mask & (map[n] << r));
		if (n + 1 < lst->total_num)
			tmp |= (mask & (map[n + 1] >> (32 - r)));
		tetri <<= lst->width;
		r += sze;
	}
	return (!(tmp & tetri));
}

/*
** function that look for the first place in the map for a tetri
*/

int				find_place(unsigned int *map, t_fillist *list, int size)
{
	int	limit;
	int	pos;

	pos = list->position;
	list->place = pos % size;
	list->rank = pos % 32;
	list->num = pos / 32;
	limit = (size - list->height + 1) * size;
	while (pos < limit)
	{
		if (list->rank >= 32 && ++list->num)
			list->rank -= 32;
		if (list->place > size - list->width)
		{
			list->place = -1;
			pos += list->width - 2;
			list->rank += list->width - 2;
		}
		else if (fit_in_place(map, list, size, 0))
			return ((list->position = pos + 1));
		pos++;
		list->place++;
		list->rank++;
	}
	return (0);
}

/*
** function that add or remove a tetri on the map
*/

void			add_remove(unsigned int *map, t_fillist *list, int size)
{
	unsigned int	msk;
	unsigned short	tetri;
	int				i;
	int				j;

	tetri = list->tetribit;
	msk = ~0u << (32 - list->width);
	i = (list->height - 1) * list->width;
	j = (list->height - 1) * size + list->position;
	while (j >= list->position)
	{
		map[(j - 1) / 32] ^= (msk & tetri << (16 + i)) >> (j - 1);
		if ((j - 1) / 32 + 1 < list->total_num)
			map[(j - 1) / 32 + 1] ^= (msk & tetri << (16 + i)) << (32 - j) << 1;
		j -= size;
		i -= list->width;
	}
}

/*
** Function that try to place every tetri in the left places
** to know if it worth it to continue to check in this order
*/

int		check_others(unsigned int *map, t_fillist *list, int size, int num)
{
	t_fillist	*tmp;
	int			dots;
	int			total;
	int			i;
	int			j;

	dots = 0;
	i = -1;
	num *= 4;
	total = size * size;
	while (++i < total && dots <= total - num)
	{
		tmp = list->next;
		j = 1;
		while (1 << (i % 32) & map[i % 32])
			i++;
		while (j && tmp)
		{
			if (tmp->width > (size - i % size) || (total - i) <= (tmp->height * size))
				tmp = tmp->next;
			else if (!fit_in_place(map, list, size, i))
				tmp = tmp->next;
			else
				j = 0;
		}
		if (j)
			dots++;
	}
	return (dots > total - num);
}

/*
** Function that supress the memory of already placed tetri
** when a next one is placed before them
** because then they might fit where they already tried
*/

void	clean_memory(t_fillist *list, int pos, int mem)
{
	t_fillist		*tmp;
	unsigned int	mask;

	tmp = list->start;
	while (tmp)
	{
		if (tmp->memory)
		{
			pos = mem;
			while (pos >= list->position)
			{
				mask = ~(1 << ((pos % 32) - 1));
				tmp->memory[pos / 32] &= mask;
				pos--;
			}
		}
		tmp = tmp->next;
	}
}

/*
** Function that recursively try to fill the map with the tetris
*/

int				fill_map(unsigned int *map, t_fillist *list, int size)
{
	int	pos;

	if (!list)
		return (1);
	pos = list->position;
	list->position = 0;
	while (find_place(map, list, size))
	{
		if (list->position < pos)
			clean_memory(list, pos, pos);
		add_remove(map, list, size);
		list->test = 1;
		if (list->dope[0])
		{
			print_letter_map(list->start, size, 1);
			ft_putchar('\n');
		}
		if (list->dope[1])
			if (check_tetri_memory(list, list->position))
//				if (check_others(map, list, size, list->total))
					if (fill_map(map, list->next, size))
						return (1);
		if (!list->dope[1])
			if (fill_map(map, list->next, size))
				return (1);
		add_remove(map, list, size);
		list->test = 0;
	}
	return (0);
}

/*
** Function that send to "fill_map" a map of a certain size
** and increment its size untill it's solved
*/

int				search_map(t_fillist *list)
{
	t_fillist		*tmp;
	unsigned int	*map;
	int				size;
	int				num;
	int				i;

	size = 2;

	num = 1;
	tmp = list;
	while ((tmp = tmp->next))
		num++;

	tmp = print_tetri(list, num);
	init_num_and_size(1, &size, tmp);
	i = 0;
	while (!i)
	{
		num = (size * size) / 32 + 1;
		if (!(map = (unsigned int *)malloc(sizeof(*map) * num)))
			return (0);
		check_same_tetri(list, num);
		if (list->dope[2])
			ft_putnbrendl(size);
		while (num--)
			map[num] = 0;
		i = fill_map(map, list, size++);
		if (!i)
			free(map);
	}
	return (print_binary_map(map, size, list->dope));
}