42_old_fillit/search_map.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   search_map.c                                       :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2019/04/27 20:47:22 by hulamy            #+#    #+#             */
/*   Updated: 2019/04/30 20:58:29 by hulamy           ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "fillit.h"

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

int		find_place(unsigned int *tab, t_fillist *list, int size)
{
	int				i;
	int				j;
	unsigned int	mask;
	unsigned int	tmp;

	// creer un mask avec les size bits de gauche a 1 (ex: 11111110000000000000000000000000)
	mask = ~0u << (32 - list->width);
	tmp = mask;
	i = 0;
	// boucle jusqu'a la dernier place pour le tetri dans la map ou qu'il fit dans un trou
	while (i < (size - list->height + 1) * size)
	{
		tmp = 0;
		// construit un tmp qui est une photo de la map de la taille du tetri a un emplacement donne
		j = (list->height - 1) * size + i;
		while (j >= i)
		{
			tmp >>= list->width;
			tmp |= (mask & (tab[j / 32] << j));
			tmp |= (mask & (tab[(j + list->width) / 32] >> (32 - j)));	// cette deuxieme ligne est la au cas ou on serait a cheval sur deux int du tab
			j -= size;
		}
//		print_map(&tmp, list->width, list->height);		// test pour imprimer la photo en map
//		write(1, "\n", 1);
//		print_bits(tmp >> 16, 32);						// test pour imprimer la photo en bits
		if (!((tmp >> 16) & list->tetribit))
			return ((list->position = i + 1));
		if (i % size == size - list->width)
			i += list->width - 1;
		i++;
	}
	return (0);
}

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

void	add_remove(unsigned int *map, t_fillist *list, int size, int pos)
{
	unsigned int	mask;
	unsigned int	tmp;
	int				j;
	int				i;

	mask = ~0u << (32 - list->width);
	tmp = 0;
	i = (list->height - 1) * list->width;
	j = (list->height - 1) * size + pos;
//	(void)map;
	// construit un tmp qui est une photo de la map de la taille du tetri a un emplacement donne
//	ft_putnbrendl(pos);
	while (j >= pos)
	{
		ft_putstr("j:"); ft_putnbr(j); ft_putstr(" (32 - j):"); ft_putnbr(32 - j); ft_putstr(" i:"); ft_putnbr(i); ft_putstr(" pos:"); ft_putnbrendl(pos);
		print_bits(map[j / 32], 32);
		print_bits(list->tetribit << 16, 32);
//		print_bits(mask >> i, 32);
//		print_bits((mask >> i & list->tetribit << 16), 32);
		print_bits((mask >> i & list->tetribit << 16) >> (j - i - 1), 32);
		print_bits((map[j / 32] | (mask >> i & list->tetribit << 16) >> (j - i - 1)), 32);

		print_bits(map[(j + list->width) / 32], 32);
		print_bits((mask >> i & list->tetribit << 16), 32);
		print_bits((mask >> i & list->tetribit << 16) << (i + (j + list->width) % 32), 32);
//		map[j / 32] |= ((list->tetribit >> (32 - j)) | map[j / 32]);
//		map[(j + size) / 32] |= ((list->tetribit << j) | map[(j + size) / 32]);	// cette deuxieme ligne est la au cas ou on serait a cheval sur deux int du tab
		j -= size;
		i -= list->width;
	}
	ft_putchar('\n');
}

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

int		fill_map(unsigned int *map, t_fillist *list, int size)
{
	if (!list)
		return (1);
	while (find_place(map, list, size))
	{
		add_remove(map, list, size, list->position);
		print_map(map, size, size);
		if (fill_map(map, list->next, size))
				return (1);
		add_remove(map, list, size, list->position);
		list->position++;
	}
	return (0);
}

/*
** function that init the map to the right size fill with int equal to zeros
*/

unsigned int	*init_map(int i)
{
	unsigned int	*new;
	int				size;

	size = (i * i) / 32 + 1;
	new = (unsigned int *)malloc(sizeof(*new) * size);
	while (size)
		new[size--] = 0;
	return (new);
}

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

void	search_map(t_fillist *list)
{
	t_fillist		*tmp;

	//////////////////////////// TEST ////////////////////////////
	// ce tableau permet de monter jusqu'a une map de 16*16
	unsigned int	print;
	unsigned int	tab[8];
	tab[0] = 2656554334;
	tab[1] = 1394456818 ^ (1 << 11 | 1 << 22);
	tab[2] = 1494256918;
	tab[3] = 2656554334;
	tab[4] = 1592453883;
	tab[5] = 1444352908;
	tab[6] = 2154339230;
	tab[7] = 1576493154;
	print_map(tab, 10, 10);
	tmp = list;
	while (tmp)
	{
		// imression pour tests
		print = tmp->tetribit;
		print <<= 16;
		print_map(&print, tmp->width, tmp->height);		// test, imprime le tetri
		ft_putnbrendl(find_place(tab, tmp, 10));
		ft_putchar('\n');
		tmp = tmp->next;
	}
	//////////////////////////// TEST ////////////////////////////

	////////////////////////// en cours //////////////////////////
	unsigned int	*map;
	int				size;
	int				i;

	size = 2;
	i = 1;
	tmp = list;
	// trouve le nombre de tetri en parcourant la liste chainee
	while ((tmp = tmp->next))
		i++;
	// trouve la taille minimale de la map
	while (size * size < i * 4)
		size++;
	map = init_map(size);

	// en cours de test :
	// quand add_remove_marchera la ligne d'apres imprimera la map avec les pixels du tetri rajoutes a la bonne place
	add_remove(tab, list, 10, find_place(tab, list, 10));
	add_remove(tab, list->next, 10, find_place(tab, list->next, 10));
	add_remove(tab, list->next->next, 10, find_place(tab, list->next->next, 10));
	print_map(tab, 10, 10);

	// lance la recursive fill_map en augmentant la taille de la map tant qu'il n'y a pas de solution
//	ft_putstr("test ");
//	ft_putnbrendl(size);
//	while (!fill_map(map, list, size))
//		map = init_map(size++);
	////////////////////////// en cours //////////////////////////
}