/*
 * vim:ts=8:sw=3:sts=8:noexpandtab:cino=>5n-3f0^-2{2
 */
#include "e.h"

void
e_place_zone_region_smart_cleanup(E_Zone *zone)
{
   E_Desk *desk;
   Evas_List *borders = NULL;
   E_Border_List *bl;
   E_Border *border;

   E_OBJECT_CHECK(zone);
   desk = e_desk_current_get(zone);
   bl = e_container_border_list_first(desk->zone->container);
   while ((border = e_container_border_list_next(bl)))
     {
	/* Build a list of windows on this desktop and not iconified. */
	if ((border->desk == desk) && !(border->iconic))
	  {
	     int area;
	     Evas_List *ll;

	     /* Ordering windows largest to smallest gives better results */
	     area = border->w * border->h;
	     for (ll = borders; ll; ll = ll->next)
	       {
		  int testarea;
		  E_Border *bd = ll->data;

		  testarea = bd->w * bd->h;
		  /* Insert the border if larger than the current border */
		  if (area >= testarea)
		    {
		       borders = evas_list_prepend_relative(borders, border, bd);
		       break;
		    }
	       }
	     /* Looped over all borders without placing, so place at end */
	     if (!ll) borders = evas_list_append(borders, border);
	  }
     }
   e_container_border_list_free(bl);

   /* Loop over the borders moving each one using the smart placement */
   while (borders)
     {
	int new_x, new_y;

	border = borders->data;
	e_place_zone_region_smart(zone, borders, border->x, border->y,
				  border->w, border->h, &new_x, &new_y);
	e_border_move(border, new_x, new_y);
	borders = evas_list_remove(borders, border);
     }
}

int
e_place_zone_region_smart(E_Zone *zone, Evas_List *skiplist, int x, int y, int w, int h, int *rx, int *ry)
{
   int                 a_w = 0, a_h = 0;
   int                *a_x = NULL, *a_y = NULL;
   Evas_List          *ll;
   E_Border_List      *bl;
   E_Border           *bd;

   a_w = 2;
   a_h = 2;
   a_x = E_NEW(int, 2);
   a_y = E_NEW(int, 2);

   x -= zone->x;
   y -= zone->y;
   
   a_x[0] = 0;
   a_x[1] = zone->w;
   a_y[0] = 0;
   a_y[1] = zone->h;

   bl = e_container_border_list_first(zone->container);
   while ((bd = e_container_border_list_next(bl)))
     {
	int ok;
	
	ok = 1;
	for (ll = skiplist; ll; ll = ll->next)
	  {
	     if (ll->data == bd)
	       {
		  ok = 0;
		  break;
	       }
	  }
	if ((ok) && (bd->visible))
	  {
	     if (E_INTERSECTS((bd->x - zone->x), (bd->y - zone->y),
			      bd->w, bd->h, 0, 0, zone->w, zone->h))
	       {
		  int i, j;

		  for (i = 0; i < a_w; i++)
		    {
		       int                 ok = 1;

		       if ((bd->x - zone->x) > 0)
			 {
			    if (a_x[i] == (bd->x - zone->x))
			       ok = 0;
			    else if (a_x[i] > (bd->x - zone->x))
			      {
				 a_w++;
				 E_REALLOC(a_x, int, a_w);

				 for (j = a_w - 1; j > i; j--)
				    a_x[j] = a_x[j - 1];
				 a_x[i] = (bd->x - zone->x);
				 ok = 0;
			      }
			 }
		       if (!ok)
			  break;
		    }
		  for (i = 0; i < a_w; i++)
		    {
		       int ok = 1;

		       if ((bd->x - zone->x) + bd->w < zone->w)
			 {
			    if (a_x[i] == (bd->x - zone->x) + bd->w)
			       ok = 0;
			    else if (a_x[i] > (bd->x - zone->x) + bd->w)
			      {
				 a_w++;
				 E_REALLOC(a_x, int, a_w);

				 for (j = a_w - 1; j > i; j--)
				    a_x[j] = a_x[j - 1];
				 a_x[i] = (bd->x - zone->x) + bd->w;
				 ok = 0;
			      }
			 }
		       if (!ok)
			  break;
		    }
		  for (i = 0; i < a_h; i++)
		    {
		       int ok = 1;

		       if ((bd->y - zone->y) > 0)
			 {
			    if (a_y[i] == (bd->y - zone->y))
			       ok = 0;
			    else if (a_y[i] > (bd->y - zone->y))
			      {
				 a_h++;
				 E_REALLOC(a_y, int, a_h);

				 for (j = a_h - 1; j > i; j--)
				    a_y[j] = a_y[j - 1];
				 a_y[i] = (bd->y - zone->y);
				 ok = 0;
			      }
			 }
		       if (!ok)
			  break;
		    }
		  for (i = 0; i < a_h; i++)
		    {
		       int ok = 1;

		       if ((bd->y - zone->y) + bd->h < zone->h)
			 {
			    if (a_y[i] == (bd->y - zone->y) + bd->h)
			       ok = 0;
			    else if (a_y[i] > (bd->y - zone->y) + bd->h)
			      {
				 a_h++;
				 E_REALLOC(a_y, int, a_h);

				 for (j = a_h - 1; j > i; j--)
				    a_y[j] = a_y[j - 1];
				 a_y[i] = (bd->y - zone->y) + bd->h;
				 ok = 0;
			      }
			 }
		       if (!ok)
			  break;
		    }
	       }
	  }
     }
   e_container_border_list_free(bl);

   {
      int                 i, j;
      int                 area = 0x7fffffff;

      for (j = 0; j < a_h - 1; j++)
	{
	   for (i = 0; i < a_w - 1; i++)
	     {
		if ((a_x[i] < (zone->w - w)) &&
		    (a_y[j] < (zone->h - h)))
		  {
		     int ar = 0;

		     bl = e_container_border_list_first(zone->container);
		     while ((bd = e_container_border_list_next(bl)))
		       {
			  int x1, y1, w1, h1, x2, y2, w2, h2;
			  int ok;
			  
			  ok = 1;
			  x1 = a_x[i];
			  y1 = a_y[j];
			  w1 = w;
			  h1 = h;
			  x2 = (bd->x - zone->x);
			  y2 = (bd->y - zone->y);
			  w2 = bd->w;
			  h2 = bd->h;
			  for (ll = skiplist; ll; ll = ll->next)
			    {
			       if (ll->data == bd)
				 {
				    ok = 0;
				    break;
				 }
			    }
			  if ((ok) && (bd->visible) &&
			      E_INTERSECTS(x1, y1, w1, h1, x2, y2, w2, h2))
			    {
			       int                 iw, ih;
			       int                 x0, x00, y0, y00;

			       x0 = x1;
			       if (x1 < x2)
				  x0 = x2;
			       x00 = (x1 + w1);
			       if ((x2 + w2) < (x1 + w1))
				  x00 = (x2 + w2);

			       y0 = y1;
			       if (y1 < y2)
				  y0 = y2;
			       y00 = (y1 + h1);
			       if ((y2 + h2) < (y1 + h1))
				  y00 = (y2 + h2);

			       iw = x00 - x0;
			       ih = y00 - y0;
			       ar += (iw * ih);
			    }
		       }
		     e_container_border_list_free(bl);

		     if (ar < area)
		       {
			  area = ar;
			  *rx = a_x[i];
			  *ry = a_y[j];
			  if (ar == 0)
			     goto done;
		       }
		  }
		if ((a_x[i + 1] - w > 0) && (a_y[j] < (zone->h - h)))
		  {
		     int ar = 0;

		     bl = e_container_border_list_first(zone->container);
		     while ((bd = e_container_border_list_next(bl)))
		       {
			  int x1, y1, w1, h1, x2, y2, w2, h2;
			  int ok;
			  
			  ok = 1;
			  x1 = a_x[i + 1] - w;
			  y1 = a_y[j];
			  w1 = w;
			  h1 = h;
			  x2 = (bd->x - zone->x);
			  y2 = (bd->y - zone->y);
			  w2 = bd->w;
			  h2 = bd->h;
			  for (ll = skiplist; ll; ll = ll->next)
			    {
			       if (ll->data == bd)
				 {
				    ok = 0;
				    break;
				 }
			    }
			  if ((ok) && (bd->visible) &&
			      E_INTERSECTS(x1, y1, w1, h1, x2, y2, w2, h2))
			    {
			       int                 iw, ih;
			       int                 x0, x00, y0, y00;

			       x0 = x1;
			       if (x1 < x2)
				  x0 = x2;
			       x00 = (x1 + w1);
			       if ((x2 + w2) < (x1 + w1))
				  x00 = (x2 + w2);

			       y0 = y1;
			       if (y1 < y2)
				  y0 = y2;
			       y00 = (y1 + h1);
			       if ((y2 + h2) < (y1 + h1))
				  y00 = (y2 + h2);

			       iw = x00 - x0;
			       ih = y00 - y0;
			       ar += (iw * ih);
			    }
		       }
		     e_container_border_list_free(bl);

		     if (ar < area)
		       {
			  area = ar;
			  *rx = a_x[i + 1] - w;
			  *ry = a_y[j];
			  if (ar == 0)
			     goto done;
		       }
		  }
		if ((a_x[i + 1] - w > 0) && (a_y[j + 1] - h > 0))
		  {
		     int ar = 0;

		     bl = e_container_border_list_first(zone->container);
		     while ((bd = e_container_border_list_next(bl)))
		       {
			  int x1, y1, w1, h1, x2, y2, w2, h2;
			  int ok;
			  
			  ok = 1;
			  x1 = a_x[i + 1] - w;
			  y1 = a_y[j + 1] - h;
			  w1 = w;
			  h1 = h;
			  x2 = (bd->x - zone->x);
			  y2 = (bd->y - zone->y);
			  w2 = bd->w;
			  h2 = bd->h;
			  for (ll = skiplist; ll; ll = ll->next)
			    {
			       if (ll->data == bd)
				 {
				    ok = 0;
				    break;
				 }
			    }
			  if ((ok) && (bd->visible) &&
			      E_INTERSECTS(x1, y1, w1, h1, x2, y2, w2, h2))
			    {
			       int                 iw, ih;
			       int                 x0, x00, y0, y00;

			       x0 = x1;
			       if (x1 < x2)
				  x0 = x2;
			       x00 = (x1 + w1);
			       if ((x2 + w2) < (x1 + w1))
				  x00 = (x2 + w2);

			       y0 = y1;
			       if (y1 < y2)
				  y0 = y2;
			       y00 = (y1 + h1);
			       if ((y2 + h2) < (y1 + h1))
				  y00 = (y2 + h2);

			       iw = x00 - x0;
			       ih = y00 - y0;
			       ar += (iw * ih);
			    }
		       }
		     e_container_border_list_free(bl);

		     if (ar < area)
		       {
			  area = ar;
			  *rx = a_x[i + 1] - w;
			  *ry = a_y[j + 1] - h;
			  if (ar == 0)
			     goto done;
		       }
		  }
		if ((a_x[i] < (zone->w - w)) && (a_y[j + 1] - h > 0))
		  {
		     int ar = 0;

		     bl = e_container_border_list_first(zone->container);
		     while ((bd = e_container_border_list_next(bl)))
		       {
			  int x1, y1, w1, h1, x2, y2, w2, h2;
			  int ok;
			  
			  ok = 1;
			  x1 = a_x[i];
			  y1 = a_y[j + 1] - h;
			  w1 = w;
			  h1 = h;
			  x2 = (bd->x - zone->x);
			  y2 = (bd->y - zone->y);
			  w2 = bd->w;
			  h2 = bd->h;
			  for (ll = skiplist; ll; ll = ll->next)
			    {
			       if (ll->data == bd)
				 {
				    ok = 0;
				    break;
				 }
			    }
			  if ((ok) && (bd->visible) &&
			      E_INTERSECTS(x1, y1, w1, h1, x2, y2, w2, h2))
			    {
			       int                 iw, ih;
			       int                 x0, x00, y0, y00;

			       x0 = x1;
			       if (x1 < x2)
				  x0 = x2;
			       x00 = (x1 + w1);
			       if ((x2 + w2) < (x1 + w1))
				  x00 = (x2 + w2);

			       y0 = y1;
			       if (y1 < y2)
				  y0 = y2;
			       y00 = (y1 + h1);
			       if ((y2 + h2) < (y1 + h1))
				  y00 = (y2 + h2);

			       iw = x00 - x0;
			       ih = y00 - y0;
			       ar += (iw * ih);
			    }
		       }
		     e_container_border_list_free(bl);

		     if (ar < area)
		       {
			  area = ar;
			  *rx = a_x[i];
			  *ry = a_y[j + 1] - h;
			  if (ar == 0)
			     goto done;
		       }
		  }
	     }
	}
   }
 done:
   E_FREE(a_x);
   E_FREE(a_y);
   *rx += zone->x;
   *ry += zone->y;
   return 1;
}