(*

 * Hedgewars, a free turn based strategy game

 * Copyright (c) 2004-2011 Andrey Korotaev <unC0Rr@gmail.com>

 *

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; version 2 of the License

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA

 *)

{$INCLUDE "options.inc"}

unit uLand;

interface

uses SDLh, uLandTemplates, uFloat, uConsts, GLunit, uTypes;

type direction = record x, y: LongInt; end;

const DIR_N: direction = (x: 0; y: -1);

    DIR_E: direction = (x: 1; y: 0);

    DIR_S: direction = (x: 0; y: 1);

    DIR_W: direction = (x: -1; y: 0);

procedure initModule;

procedure freeModule;

procedure DrawBottomBorder;

procedure GenMap;

function  GenPreview: TPreview;

implementation

uses uConsole, uStore, uRandom, uLandObjects, uIO, uLandTexture, sysutils,

     uVariables, uUtils, uCommands, Adler32, uDebug, uLandPainted, uTextures;

begin

    c := (a.x = b.x) and (a.y = b.y);

end;

type TPixAr = record

              Count: Longword;

              ar: array[0..Pred(cMaxEdgePoints)] of TPoint;

              end;

procedure DrawLine(X1, Y1, X2, Y2: LongInt; Color: Longword);

var

  eX, eY, dX, dY: LongInt;

  i, sX, sY, x, y, d: LongInt;

begin

eX:= 0;

eY:= 0;

dX:= X2 - X1;

dY:= Y2 - Y1;

if (dX > 0) then sX:= 1

else

  if (dX < 0) then

     begin

     sX:= -1;

     dX:= -dX

     end else sX:= dX;

if (dY > 0) then sY:= 1

  else

  if (dY < 0) then

     begin

     sY:= -1;

     dY:= -dY

     end else sY:= dY;

if (dX > dY) then d:= dX

             else d:= dY;

x:= X1;

y:= Y1;

for i:= 0 to d do

    begin

    inc(eX, dX);

    inc(eY, dY);

    if (eX > d) then

       begin

       dec(eX, d);

       inc(x, sX);

       end;

    if (eY > d) then

       begin

       dec(eY, d);

       inc(y, sY);

       end;

    if ((x and LAND_WIDTH_MASK) = 0) and ((y and LAND_HEIGHT_MASK) = 0) then

       Land[y, x]:= Color;

    end

end;

procedure DrawEdge(var pa: TPixAr; Color: Longword);

var i: LongInt;

begin

i:= 0;

with pa do

while i < LongInt(Count) - 1 do

    if (ar[i + 1].X = NTPX) then inc(i, 2)

       else begin

       DrawLine(ar[i].x, ar[i].y, ar[i + 1].x, ar[i + 1].y, Color);

       inc(i)

       end

end;

procedure Vector(p1, p2, p3: TPoint; var Vx, Vy: hwFloat);

var d1, d2, d: hwFloat;

begin

Vx:= int2hwFloat(p1.X - p3.X);

Vy:= int2hwFloat(p1.Y - p3.Y);

d:= DistanceI(p2.X - p1.X, p2.Y - p1.Y);

d1:= DistanceI(p2.X - p3.X, p2.Y - p3.Y);

d2:= Distance(Vx, Vy);

if d1 < d then d:= d1;

if d2 < d then d:= d2;

d:= d * _1div3;

if d2.QWordValue = 0 then

   begin

   Vx:= _0;

   Vy:= _0

   end else

   begin

   d2:= _1 / d2;

   Vx:= Vx * d2;

   Vy:= Vy * d2;

   Vx:= Vx * d;

   Vy:= Vy * d

   end

end;

procedure AddLoopPoints(var pa, opa: TPixAr; StartI, EndI: LongInt; Delta: hwFloat);

var i, pi, ni: LongInt;

    NVx, NVy, PVx, PVy: hwFloat;

    x1, x2, y1, y2: LongInt;

    tsq, tcb, t, r1, r2, r3, cx1, cx2, cy1, cy2: hwFloat;

    X, Y: LongInt;

begin

pi:= EndI;

i:= StartI;

ni:= Succ(StartI);

{$HINTS OFF}

Vector(opa.ar[pi], opa.ar[i], opa.ar[ni], NVx, NVy);

{$HINTS ON}

repeat

    inc(pi);

    if pi > EndI then pi:= StartI;

    inc(i);

    if i > EndI then i:= StartI;

    inc(ni);

    if ni > EndI then ni:= StartI;

    PVx:= NVx;

    PVy:= NVy;

    Vector(opa.ar[pi], opa.ar[i], opa.ar[ni], NVx, NVy);

    x1:= opa.ar[pi].x;

    y1:= opa.ar[pi].y;

    x2:= opa.ar[i].x;

    y2:= opa.ar[i].y;

    cx1:= int2hwFloat(x1) - PVx;

    cy1:= int2hwFloat(y1) - PVy;

    cx2:= int2hwFloat(x2) + NVx;

    cy2:= int2hwFloat(y2) + NVy;

    t:= _0;

    while t.Round = 0 do

          begin

          tsq:= t * t;

          tcb:= tsq * t;

          r1:= (_1 - t*3 + tsq*3 - tcb);

          r2:= (     t*3 - tsq*6 + tcb*3);

          r3:= (           tsq*3 - tcb*3);

          X:= hwRound(r1 * x1 + r2 * cx1 + r3 * cx2 + tcb * x2);

          Y:= hwRound(r1 * y1 + r2 * cy1 + r3 * cy2 + tcb * y2);

          t:= t + Delta;

          pa.ar[pa.Count].x:= X;

          pa.ar[pa.Count].y:= Y;

          inc(pa.Count);

          TryDo(pa.Count <= cMaxEdgePoints, 'Edge points overflow', true)

          end;

until i = StartI;

pa.ar[pa.Count].x:= opa.ar[StartI].X;

pa.ar[pa.Count].y:= opa.ar[StartI].Y;

inc(pa.Count)

end;

procedure BezierizeEdge(var pa: TPixAr; Delta: hwFloat);

var i, StartLoop: LongInt;

    opa: TPixAr;

begin

opa:= pa;

pa.Count:= 0;

i:= 0;

StartLoop:= 0;

while i < LongInt(opa.Count) do

    if (opa.ar[i + 1].X = NTPX) then

       begin

       AddLoopPoints(pa, opa, StartLoop, i, Delta);

       inc(i, 2);

       StartLoop:= i;

       pa.ar[pa.Count].X:= NTPX;

       pa.ar[pa.Count].Y:= 0;

       inc(pa.Count);

       end else inc(i)

end;

procedure FillLand(x, y: LongInt);

var Stack: record

           Count: Longword;

           points: array[0..8192] of record

                                     xl, xr, y, dir: LongInt;

                                     end

           end;

    procedure Push(_xl, _xr, _y, _dir: LongInt);

    begin

    TryDo(Stack.Count <= 8192, 'FillLand: stack overflow', true);

    _y:= _y + _dir;

    if (_y < 0) or (_y >= LAND_HEIGHT) then exit;

    with Stack.points[Stack.Count] do

         begin

         xl:= _xl;

         xr:= _xr;

         y:= _y;

         dir:= _dir

         end;

    inc(Stack.Count)

    end;

    procedure Pop(var _xl, _xr, _y, _dir: LongInt);

    begin

    dec(Stack.Count);

    with Stack.points[Stack.Count] do

         begin

         _xl:= xl;

         _xr:= xr;

         _y:= y;

         _dir:= dir

         end

    end;

var xl, xr, dir: LongInt;

begin

Stack.Count:= 0;

xl:= x - 1;

xr:= x;

Push(xl, xr, y, -1);

Push(xl, xr, y,  1);

dir:= 0;

while Stack.Count > 0 do

      begin

      Pop(xl, xr, y, dir);

      while (xl > 0) and (Land[y, xl] <> 0) do dec(xl);

      while (xr < LAND_WIDTH - 1) and (Land[y, xr] <> 0) do inc(xr);

      while (xl < xr) do

            begin

            while (xl <= xr) and (Land[y, xl] = 0) do inc(xl);

            x:= xl;

            while (xl <= xr) and (Land[y, xl] <> 0) do

                  begin

                  Land[y, xl]:= 0;

                  inc(xl)

                  end;

            if x < xl then

               begin

               Push(x, Pred(xl), y, dir);

               Push(x, Pred(xl), y,-dir);

               end;

            end;

      end;

end;

procedure ColorizeLand(Surface: PSDL_Surface);

var tmpsurf: PSDL_Surface;

    r, rr: TSDL_Rect;

    x, yd, yu: LongInt;

begin

    tmpsurf:= LoadImage(UserPathz[ptCurrTheme] + '/LandTex', ifIgnoreCaps);

    if tmpsurf = nil then tmpsurf:= LoadImage(Pathz[ptCurrTheme] + '/LandTex', ifCritical or ifIgnoreCaps);

    r.y:= 0;

    while r.y < LAND_HEIGHT do

    begin

        r.x:= 0;

        while r.x < LAND_WIDTH do

        begin

            SDL_UpperBlit(tmpsurf, nil, Surface, @r);

            inc(r.x, tmpsurf^.w)

        end;

        inc(r.y, tmpsurf^.h)

    end;

    SDL_FreeSurface(tmpsurf);

    // freed in freeModule() below

    LandBackSurface:= LoadImage(UserPathz[ptCurrTheme] + '/LandBackTex', ifIgnoreCaps or ifTransparent);

    if LandBackSurface = nil then LandBackSurface:= LoadImage(Pathz[ptCurrTheme] + '/LandBackTex', ifIgnoreCaps or ifTransparent);

    if (LandBackSurface <> nil) and cGrayScale then Surface2GrayScale(LandBackSurface);

    tmpsurf:= LoadImage(UserPathz[ptCurrTheme] + '/Border', ifIgnoreCaps or ifTransparent);

    if tmpsurf = nil then tmpsurf:= LoadImage(Pathz[ptCurrTheme] + '/Border', ifCritical or ifIgnoreCaps or ifTransparent);

    for x:= 0 to LAND_WIDTH - 1 do

    begin

        yd:= LAND_HEIGHT - 1;

        repeat

            while (yd > 0) and (Land[yd, x] =  0) do dec(yd);

            if (yd < 0) then yd:= 0;

            while (yd < LAND_HEIGHT) and (Land[yd, x] <> 0) do inc(yd);

            dec(yd);

            yu:= yd;

            while (yu > 0  ) and (Land[yu, x] <> 0) do dec(yu);

            while (yu < yd ) and (Land[yu, x] =  0) do inc(yu);

            if (yd < LAND_HEIGHT - 1) and ((yd - yu) >= 16) then

            begin

                rr.x:= x;

                rr.y:= yd - 15;

                r.x:= x mod tmpsurf^.w;

                r.y:= 16;

                r.w:= 1;

                r.h:= 16;

                SDL_UpperBlit(tmpsurf, @r, Surface, @rr);

            end;

            if (yu > 0) then

            begin

                rr.x:= x;

                rr.y:= yu;

                r.x:= x mod tmpsurf^.w;

                r.y:= 0;

                r.w:= 1;

                r.h:= Min(16, yd - yu + 1);

                SDL_UpperBlit(tmpsurf, @r, Surface, @rr);

            end;

            yd:= yu - 1;

        until yd < 0;

    end;

    SDL_FreeSurface(tmpsurf);

end;

procedure SetPoints(var Template: TEdgeTemplate; var pa: TPixAr);

var i: LongInt;

begin

with Template do

     begin

     pa.Count:= BasePointsCount;

     for i:= 0 to pred(pa.Count) do

         begin

         pa.ar[i].x:= BasePoints^[i].x + LongInt(GetRandom(BasePoints^[i].w));

         if pa.ar[i].x <> NTPX then

            pa.ar[i].x:= pa.ar[i].x + ((LAND_WIDTH - Template.TemplateWidth) div 2);

         pa.ar[i].y:= BasePoints^[i].y + LongInt(GetRandom(BasePoints^[i].h)) + LAND_HEIGHT - LongInt(Template.TemplateHeight)

         end;

     if canMirror then

        if getrandom(2) = 0 then

           begin

           for i:= 0 to pred(BasePointsCount) do

             if pa.ar[i].x <> NTPX then

               pa.ar[i].x:= LAND_WIDTH - 1 - pa.ar[i].x;

           for i:= 0 to pred(FillPointsCount) do

               FillPoints^[i].x:= LAND_WIDTH - 1 - FillPoints^[i].x;

           end;

(*  Experiment in making this option more useful

     if ((not isNegative) and (cTemplateFilter = 4)) or

        (canFlip and (getrandom(2) = 0)) then

           begin

           for i:= 0 to pred(BasePointsCount) do

               begin

               pa.ar[i].y:= LAND_HEIGHT - 1 - pa.ar[i].y + (LAND_HEIGHT - TemplateHeight) * 2;

               if pa.ar[i].y > LAND_HEIGHT - 1 then

                   pa.ar[i].y:= LAND_HEIGHT - 1;

               end;

           for i:= 0 to pred(FillPointsCount) do

               begin

               FillPoints^[i].y:= LAND_HEIGHT - 1 - FillPoints^[i].y + (LAND_HEIGHT - TemplateHeight) * 2;

               if FillPoints^[i].y > LAND_HEIGHT - 1 then

                   FillPoints^[i].y:= LAND_HEIGHT - 1;

               end;

           end;

     end

*)

// template recycling.  Pull these off the floor a bit

     if (not isNegative) and (cTemplateFilter = 4) then

           begin

           for i:= 0 to pred(BasePointsCount) do

               begin

               dec(pa.ar[i].y, 100);

               if pa.ar[i].y < 0 then

                   pa.ar[i].y:= 0;

               end;

           for i:= 0 to pred(FillPointsCount) do

               begin

               dec(FillPoints^[i].y, 100);

               if FillPoints^[i].y < 0 then

                   FillPoints^[i].y:= 0;

               end;

           end;

     if (canFlip and (getrandom(2) = 0)) then

           begin

           for i:= 0 to pred(BasePointsCount) do

               pa.ar[i].y:= LAND_HEIGHT - 1 - pa.ar[i].y;

           for i:= 0 to pred(FillPointsCount) do

               FillPoints^[i].y:= LAND_HEIGHT - 1 - FillPoints^[i].y;

           end;

     end

end;

function CheckIntersect(V1, V2, V3, V4: TPoint): boolean;

var c1, c2, dm: LongInt;

begin

dm:= (V4.y - V3.y) * (V2.x - V1.x) - (V4.x - V3.x) * (V2.y - V1.y);

c1:= (V4.x - V3.x) * (V1.y - V3.y) - (V4.y - V3.y) * (V1.x - V3.x);

if dm = 0 then exit(false);

c2:= (V2.x - V3.x) * (V1.y - V3.y) - (V2.y - V3.y) * (V1.x - V3.x);

if dm > 0 then

   begin

   if (c1 < 0) or (c1 > dm) then exit(false);

   if (c2 < 0) or (c2 > dm) then exit(false)

   end else

   begin

   if (c1 > 0) or (c1 < dm) then exit(false);

   if (c2 > 0) or (c2 < dm) then exit(false)

   end;

//AddFileLog('1  (' + inttostr(V1.x) + ',' + inttostr(V1.y) + ')x(' + inttostr(V2.x) + ',' + inttostr(V2.y) + ')');

//AddFileLog('2  (' + inttostr(V3.x) + ',' + inttostr(V3.y) + ')x(' + inttostr(V4.x) + ',' + inttostr(V4.y) + ')');

CheckIntersect:= true

end;

function CheckSelfIntersect(var pa: TPixAr; ind: Longword): boolean;

var i: Longword;

begin

if (ind <= 0) or (ind >= Pred(pa.Count)) then exit(false);

for i:= 1 to pa.Count - 3 do

    if (i <= ind - 1) or (i >= ind + 2) then

      begin

      if (i <> ind - 1) and

         CheckIntersect(pa.ar[ind], pa.ar[ind - 1], pa.ar[i], pa.ar[i - 1]) then exit(true);

      if (i <> ind + 2) and

         CheckIntersect(pa.ar[ind], pa.ar[ind + 1], pa.ar[i], pa.ar[i - 1]) then exit(true);

      end;

CheckSelfIntersect:= false

end;

procedure RandomizePoints(var pa: TPixAr);

const cEdge = 55;

      cMinDist = 8;

var radz: array[0..Pred(cMaxEdgePoints)] of LongInt;

    i, k, dist, px, py: LongInt;

begin

for i:= 0 to Pred(pa.Count) do

  begin

  radz[i]:= 0;

  with pa.ar[i] do

    if x <> NTPX then

      begin

      radz[i]:= Min(Max(x - cEdge, 0), Max(LAND_WIDTH - cEdge - x, 0));

      radz[i]:= Min(radz[i], Min(Max(y - cEdge, 0), Max(LAND_HEIGHT - cEdge - y, 0)));

      if radz[i] > 0 then

        for k:= 0 to Pred(i) do

          begin

          dist:= Max(abs(x - pa.ar[k].x), abs(y - pa.ar[k].y));

          radz[k]:= Max(0, Min((dist - cMinDist) div 2, radz[k]));

          radz[i]:= Max(0, Min(dist - radz[k] - cMinDist, radz[i]))

        end

      end;

  end;

for i:= 0 to Pred(pa.Count) do

  with pa.ar[i] do

    if ((x and LAND_WIDTH_MASK) = 0) and ((y and LAND_HEIGHT_MASK) = 0) then