diff --git a/src/game/g_grid.pas b/src/game/g_grid.pas
index 280fd90f3fd967f0753a31ee69cb6386ceb5fd05..2dfb0ce43d4ff6cb49dece8b05fe3737ca7221b5 100644 (file)
--- a/src/game/g_grid.pas
+++ b/src/game/g_grid.pas
-(* Copyright (C) DooM 2D:Forever Developers
+(* Copyright (C) Doom 2D: Forever Developers
*
* 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, either version 3 of the License, or
- * (at your option) any later version.
+ * the Free Software Foundation, version 3 of the License ONLY.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
{.$DEFINE D2F_DEBUG_MOVER}
{$ENDIF}
{.$DEFINE GRID_USE_ORTHO_ACCEL}
+{$DEFINE LINEAABB2}
unit g_grid;
interface
+uses
+ mempool;
+
+(*
+ * In order to make this usable for kind-of-recursive calls,
+ * we'll use "frame memory pool" to return results. That is,
+ * we will allocate a memory pool that will be cleared on
+ * frame start, and then used as a simple "no-free" allocator.
+ * Grid will put results into this pool, and will never bother
+ * to free it. Caller should call "release" on result, and
+ * the pool will throw away everything.
+ * No more callbacks, of course.
+ *)
+
const
GridTileSize = 32; // must be power of two!
+type
+ PGridCellCoord = ^TGridCellCoord;
+ TGridCellCoord = record
+ x, y: Integer;
+ end;
+
+ CellCoordIter = specialize PoolIter<TGridCellCoord>;
+
+
type
TBodyProxyId = Integer;
- generic TBodyGridBase<ITP> = class(TObject)
+ generic TBodyGridBase<ITP> = class{$IFDEF USE_MEMPOOL}(TPoolObject){$ENDIF}
public
- type TGridQueryCB = function (obj: ITP; tag: Integer): Boolean is nested; // return `true` to stop
- type TGridRayQueryCB = function (obj: ITP; tag: Integer; x, y, prevx, prevy: Integer): Boolean is nested; // return `true` to stop
+ type PITP = ^ITP;
type TCellQueryCB = procedure (x, y: Integer) is nested; // top-left cell corner coords
+ type Iter = specialize PoolIter<ITP>;
+
const TagDisabled = $40000000;
const TagFullMask = $3fffffff;
mProxyFree: TBodyProxyId; // free
mProxyCount: Integer; // currently used
mProxyMaxCount: Integer;
- mInQuery: Boolean;
public
dbgShowTraceLog: Boolean;
function getBodyWH (body: TBodyProxyId; out rw, rh: Integer): Boolean; inline;
function getBodyDims (body: TBodyProxyId; out rx, ry, rw, rh: Integer): Boolean; inline;
- //WARNING: don't modify grid while any query is in progress (no checks are made!)
- // you can set enabled/disabled flag, tho (but iterator can still return objects disabled inside it)
- // no callback: return `true` on the first hit
- function forEachInAABB (x, y, w, h: Integer; cb: TGridQueryCB; tagmask: Integer=-1; allowDisabled: Boolean=false): ITP;
+ // return number of ITP thingys put into frame pool
+ // if `firstHit` is `true`, return on first hit (obviously)
+ function forEachInAABB (x, y, w, h: Integer; tagmask: Integer=-1; allowDisabled: Boolean=false; firstHit: Boolean=false): Iter;
- //WARNING: don't modify grid while any query is in progress (no checks are made!)
- // you can set enabled/disabled flag, tho (but iterator can still return objects disabled inside it)
- // no callback: return object on the first hit or nil
- function forEachAtPoint (x, y: Integer; cb: TGridQueryCB; tagmask: Integer=-1; exittag: PInteger=nil): ITP;
+ // return number of ITP thingys put into frame pool
+ // if `firstHit` is `true`, return on first hit (obviously)
+ function forEachAtPoint (x, y: Integer; tagmask: Integer=-1; allowDisabled: Boolean=false; firstHit: Boolean=false): Iter;
function atCellInPoint (x, y: Integer): TAtPointEnumerator;
- //WARNING: don't modify grid while any query is in progress (no checks are made!)
- // you can set enabled/disabled flag, tho (but iterator can still return objects disabled inside it)
- // cb with `(nil)` will be called before processing new tile
- // no callback: return object of the nearest hit or nil
- // if `inverted` is true, trace will register bodies *exluding* tagmask
- //WARNING: don't change tags in callbacks here!
- function traceRayOld (const x0, y0, x1, y1: Integer; cb: TGridRayQueryCB; tagmask: Integer=-1): ITP; overload;
- function traceRayOld (out ex, ey: Integer; const ax0, ay0, ax1, ay1: Integer; cb: TGridRayQueryCB; tagmask: Integer=-1): ITP;
-
- //WARNING: don't modify grid while any query is in progress (no checks are made!)
- // you can set enabled/disabled flag, tho (but iterator can still return objects disabled inside it)
- // cb with `(nil)` will be called before processing new tile
- // no callback: return object of the nearest hit or nil
- // if `inverted` is true, trace will register bodies *exluding* tagmask
- // `cb` is used unconvetionally here: if it returns `false`, tracer will ignore the object
- //WARNING: don't change tags in callbacks here!
- function traceRay (const x0, y0, x1, y1: Integer; cb: TGridQueryCB; tagmask: Integer=-1): ITP; overload;
- function traceRay (out ex, ey: Integer; const ax0, ay0, ax1, ay1: Integer; cb: TGridQueryCB; tagmask: Integer=-1): ITP;
+ // return object of the nearest hit or nil
+ function traceRay (const x0, y0, x1, y1: Integer; tagmask: Integer=-1): ITP; overload;
+ function traceRay (out ex, ey: Integer; const ax0, ay0, ax1, ay1: Integer; tagmask: Integer=-1): ITP;
// return `false` if we're still inside at the end
// line should be either strict horizontal, or strict vertical, otherwise an exception will be thrown
// `true`: endpoint will point at the last "inside" pixel
// `false`: endpoint will be (ax1, ay1)
- //WARNING: don't change tags in callbacks here!
function traceOrthoRayWhileIn (out ex, ey: Integer; ax0, ay0, ax1, ay1: Integer; tagmask: Integer=-1): Boolean;
- //WARNING: don't modify grid while any query is in progress (no checks are made!)
- // you can set enabled/disabled flag, tho (but iterator can still return objects disabled inside it)
- // trace line along the grid, calling `cb` for all objects in passed cells, in no particular order
- //WARNING: don't change tags in callbacks here!
- function forEachAlongLine (ax0, ay0, ax1, ay1: Integer; cb: TGridQueryCB; tagmask: Integer=-1; log: Boolean=false): ITP;
+ // trace line along the grid, put all objects from passed cells into frame pool, in no particular order
+ // return number of ITP thingys put into frame pool
+ function forEachAlongLine (ax0, ay0, ax1, ay1: Integer; tagmask: Integer=-1; log: Boolean=false): Iter;
// trace box with the given velocity; return object hit (if any)
// `cb` is used unconvetionally here: if it returns `false`, tracer will ignore the object
//WARNING: don't change tags in callbacks here!
- function traceBox (out ex, ey: Integer; const ax0, ay0, aw, ah: Integer; const dx, dy: Integer; cb: TGridQueryCB; tagmask: Integer=-1): ITP;
+ function traceBox (out ex, ey: Integer; const ax0, ay0, aw, ah: Integer; const dx, dy: Integer; tagmask: Integer=-1): ITP;
// debug
- procedure forEachBodyCell (body: TBodyProxyId; cb: TCellQueryCB);
- function forEachInCell (x, y: Integer; cb: TGridQueryCB): ITP;
+ function forEachBodyCell (body: TBodyProxyId): CellCoordIter; // this puts `TGridCellCoord` into frame pool for each cell
+ function forEachInCell (x, y: Integer): Iter; // this puts `ITP` into frame pool
procedure dumpStats ();
public
private
wx0, wy0, wx1, wy1: Integer; // window coordinates
stx, sty: Integer; // "steps" for x and y axes
- dx2, dy2: Integer; // "double lengthes" for x and y axes
+ stleft: Integer; // "steps left"
+ err, errinc, errmax: Integer;
xd, yd: Integer; // current coord
- e: Integer; // "error" (as in bresenham algo)
- term: Integer; // end for xd (xd = term: done)
- //xptr, yptr: PInteger;
- xyswapped: Boolean; // true: xd is y
+ horiz: Boolean;
public
// call `setyp` after this
// move to next tile; return `true` if the line is complete (and walker state is undefined then)
function stepToNextTile (): Boolean; inline;
- // hack for line-vs-aabb; NOT PROPERLY TESTED!
- procedure getPrevXY (out ox, oy: Integer); inline;
-
- // current coords
- function x (): Integer; inline;
- function y (): Integer; inline;
-
procedure getXY (out ox, oy: Integer); inline;
- // move directions; always [-1..1] (can be zero!)
- function dx (): Integer; inline;
- function dy (): Integer; inline;
+ public
+ // current coords
+ property x: Integer read xd;
+ property y: Integer read yd;
end;
-// you are not supposed to understand this
-// returns `true` if there is an intersection, and enter coords
-// enter coords will be equal to (x0, y0) if starting point is inside the box
-// if result is `false`, `inx` and `iny` are undefined
-function lineAABBIntersects (x0, y0, x1, y1: Integer; bx, by, bw, bh: Integer; out inx, iny: Integer): Boolean;
-
-// sweep two AABB's to see if and when they are overlapping
-// returns `true` if collision was detected (but boxes doesn't overlap)
-// u1 and u1 has no sense if no collision was detected
-// u0 = normalized time of first collision (i.e. collision starts at myMove*u0)
-// u1 = normalized time of second collision (i.e. collision stops after myMove*u1)
-// hitedge for `it`: 0: top; 1: right; 2: bottom; 3: left
-// enter/exit coords will form non-intersecting configuration (i.e. will be before/after the actual collision)
-function sweepAABB (mex0, mey0, mew, meh: Integer; medx, medy: Integer; itx0, ity0, itw, ith: Integer;
- u0: PSingle=nil; hitedge: PInteger=nil; u1: PSingle=nil): Boolean;
-
-function distanceSq (x0, y0, x1, y1: Integer): Integer; inline;
-
procedure swapInt (var a: Integer; var b: Integer); inline;
//function minInt (a, b: Integer): Integer; inline;
//function maxInt (a, b: Integer): Integer; inline;
implementation
uses
- SysUtils, e_log, g_console, utils;
+ SysUtils, e_log, g_console, geom, utils;
// ////////////////////////////////////////////////////////////////////////// //
@@ -328,8 +305,6 @@ procedure swapInt (var a: Integer; var b: Integer); inline; var t: Integer; begi
//function minInt (a, b: Integer): Integer; inline; begin if (a < b) then result := a else result := b; end;
//function maxInt (a, b: Integer): Integer; inline; begin if (a > b) then result := a else result := b; end;
-function distanceSq (x0, y0, x1, y1: Integer): Integer; inline; begin result := (x1-x0)*(x1-x0)+(y1-y0)*(y1-y0); end;
-
// ////////////////////////////////////////////////////////////////////////// //
constructor TLineWalker.Create (minx, miny, maxx, maxy: Integer);
wy1 := maxy;
end;
-function TLineWalker.done (): Boolean; inline; begin result := (xd = term); end;
-
-function TLineWalker.step (): Boolean; inline;
-begin
- if (e >= 0) then begin yd += sty; e -= dx2; end else e += dy2;
- xd += stx;
- result := (xd = term);
-end;
-
-function TLineWalker.stepToNextTile (): Boolean; inline;
+function TLineWalker.setup (x0, y0, x1, y1: Integer): Boolean;
var
- ex, ey: Integer;
- xwalk, ywalk, wklen: Integer; // to the respective edges
- lstx, lsty, lterm: Integer;
- le, ldx2, ldy2: Integer;
- lxd, lyd: Integer;
- f: Integer;
+ sx0, sy0, sx1, sy1: Single;
begin
- result := false;
-
- lstx := stx;
- lsty := sty;
- lterm := term;
- lxd := xd;
+ if (wx1 < wx0) or (wy1 < wy0) then begin stleft := 0; xd := x0; yd := y0; result := false; exit; end;
- // ortho?
- if (lsty = 0) then
+ if (x0 >= wx0) and (y0 >= wy0) and (x0 <= wx1) and (y0 <= wy1) and
+ (x1 >= wx0) and (y1 >= wy0) and (x1 <= wx1) and (y1 <= wy1) then
begin
- // only xd
- //assert(lsty <> 0);
- if (lstx < 0) then
- begin
- // xd: to left edge
- xd := (lxd and (not (TileSize-1)))-1;
- result := (lxd <= lterm);
- exit;
- end
- else
- begin
- // xd: to right edge
- xd := (lxd or (TileSize-1))+1;
- result := (lxd >= lterm);
- exit;
- end;
- end;
-
- // not ortho
- //assert(lstx <> 0); // invariant
-
- lyd := yd;
- le := e;
- ldx2 := dx2;
- ldy2 := dy2;
-
- // calculate xwalk
- if (lstx < 0) then
- begin
- ex := (lxd and (not (TileSize-1)))-1;
- xwalk := lxd-ex;
+ result := true;
end
else
begin
- ex := (lxd or (TileSize-1))+1;
- xwalk := ex-lxd;
+ sx0 := x0; sy0 := y0;
+ sx1 := x1; sy1 := y1;
+ result := clipLine(sx0, sy0, sx1, sy1, wx0, wy0, wx1, wy1);
+ if not result then begin stleft := 0; xd := x0; yd := y0; exit; end;
+ x0 := trunc(sx0); y0 := trunc(sy0);
+ x1 := trunc(sx1); y1 := trunc(sy1);
end;
- // calculate ywalk
- if (lsty < 0) then
+ // check for ortho lines
+ if (y0 = y1) then
begin
- ey := (lyd and (not (TileSize-1)))-1;
- ywalk := lyd-ey;
+ // horizontal
+ horiz := true;
+ stleft := abs(x1-x0)+1;
+ if (x0 < x1) then stx := 1 else stx := -1;
+ sty := 0;
+ errinc := 0;
+ errmax := 10; // anything that is greater than zero
end
- else
+ else if (x0 = x1) then
begin
- ey := (lyd or (TileSize-1))+1;
- ywalk := ey-lyd;
- end;
-
- while true do
+ // vertical
+ horiz := false;
+ stleft := abs(y1-y0)+1;
+ stx := 0;
+ if (y0 < y1) then sty := 1 else sty := -1;
+ errinc := 0;
+ errmax := 10; // anything that is greater than zero
+ end
+ else
begin
- // in which dir we want to walk?
- if (xwalk <= ywalk) then wklen := xwalk else wklen := ywalk;
- // walk x
- if (lstx < 0) then
+ // diagonal
+ if (abs(x1-x0) >= abs(y1-y0)) then
begin
- lxd -= wklen;
- if (lxd <= lterm) then begin xd := lxd; result := true; exit; end;
+ // horizontal
+ horiz := true;
+ stleft := abs(x1-x0)+1;
+ errinc := abs(y1-y0)+1;
end
else
begin
- lxd += wklen;
- if (lxd >= lterm) then begin xd := lxd; result := true; exit; end;
+ // vertical
+ horiz := false;
+ stleft := abs(y1-y0)+1;
+ errinc := abs(x1-x0)+1;
end;
- // walk y
- for f := 1 to wklen do if (le >= 0) then begin lyd += lsty; le -= ldx2; end else le += ldy2;
- if (lxd = ex) or (lyd = ey) then break;
- xwalk -= wklen; if (xwalk = 0) then xwalk := TileSize;
- ywalk -= wklen; if (ywalk = 0) then ywalk := TileSize;
+ if (x0 < x1) then stx := 1 else stx := -1;
+ if (y0 < y1) then sty := 1 else sty := -1;
+ errmax := stleft;
end;
- //assert((xd div TileSize <> lxd div TileSize) or (yd div TileSize <> lyd div TileSize));
- xd := lxd;
- yd := lyd;
- e := le;
+ xd := x0;
+ yd := y0;
+ err := -errmax;
end;
-// NOT TESTED!
-procedure TLineWalker.getPrevXY (out ox, oy: Integer); inline;
+function TLineWalker.done (): Boolean; inline; begin result := (stleft <= 0); end;
+
+// true: done
+function TLineWalker.step (): Boolean; inline;
begin
- //writeln('e=', e, '; dx2=', dx2, '; dy2=', dy2);
- if xyswapped then
+ if horiz then
begin
- if (e >= 0) then ox := yd-sty else ox := yd;
- oy := xd-stx;
+ xd += stx;
+ err += errinc;
+ if (err >= 0) then begin err -= errmax; yd += sty; end;
end
else
begin
- if (e >= 0) then oy := yd-sty else oy := yd;
- ox := xd-stx;
+ yd += sty;
+ err += errinc;
+ if (err >= 0) then begin err -= errmax; xd += stx; end;
end;
+ Dec(stleft);
+ result := (stleft <= 0);
end;
-function TLineWalker.x (): Integer; inline; begin if xyswapped then result := yd else result := xd; end;
-function TLineWalker.y (): Integer; inline; begin if xyswapped then result := xd else result := yd; end;
-procedure TLineWalker.getXY (out ox, oy: Integer); inline; begin if xyswapped then begin ox := yd; oy := xd; end else begin ox := xd; oy := yd; end; end;
-
-function TLineWalker.dx (): Integer; inline; begin if xyswapped then result := stx else result := sty; end;
-function TLineWalker.dy (): Integer; inline; begin if xyswapped then result := sty else result := stx; end;
-
-function TLineWalker.setup (x0, y0, x1, y1: Integer): Boolean;
- procedure swapInt (var a: Integer; var b: Integer); inline; begin a := a xor b; b := b xor a; a := a xor b; end;
+// true: done
+function TLineWalker.stepToNextTile (): Boolean; inline;
var
- dsx, dsy: Integer; // "lengthes" for x and y axes
- rem: Integer;
- xfixed: Boolean;
- temp: Integer;
+ ex, ey: Integer;
+ xwalk, ywalk, wklen: Integer; // to the respective edges
+ f: Integer;
begin
result := false;
- xyswapped := false;
-
- // horizontal setup
- if (x0 < x1) then
- begin
- // from left to right
- if (x0 > wx1) or (x1 < wx0) then exit; // out of screen
- stx := 1; // going right
- end
- else
- begin
- // from right to left
- if (x1 > wx1) or (x0 < wx0) then exit; // out of screen
- stx := -1; // going left
- x0 := -x0;
- x1 := -x1;
- wx0 := -wx0;
- wx1 := -wx1;
- swapInt(wx0, wx1);
- end;
- // vertical setup
- if (y0 < y1) then
- begin
- // from top to bottom
- if (y0 > wy1) or (y1 < wy0) then exit; // out of screen
- sty := 1; // going down
- end
- else
- begin
- // from bottom to top
- if (y1 > wy1) or (y0 < wy0) then exit; // out of screen
- sty := -1; // going up
- y0 := -y0;
- y1 := -y1;
- wy0 := -wy0;
- wy1 := -wy1;
- swapInt(wy0, wy1);
- end;
+ if (stleft < 2) then begin result := true; exit; end; // max one pixel left, nothing to do
- dsx := x1-x0;
- dsy := y1-y0;
-
- if (dsx < dsy) then
+ // strictly horizontal?
+ if (sty = 0) then
begin
- xyswapped := true;
- //xptr := @yd;
- //yptr := @xd;
- swapInt(x0, y0);
- swapInt(x1, y1);
- swapInt(dsx, dsy);
- swapInt(wx0, wy0);
- swapInt(wx1, wy1);
- swapInt(stx, sty);
- end
- else
- begin
- //xptr := @xd;
- //yptr := @yd;
- end;
-
- dx2 := 2*dsx;
- dy2 := 2*dsy;
- xd := x0;
- yd := y0;
- e := 2*dsy-dsx;
- term := x1;
-
- xfixed := false;
- if (y0 < wy0) then
- begin
- // clip at top
- temp := dx2*(wy0-y0)-dsx;
- xd += temp div dy2;
- rem := temp mod dy2;
- if (xd > wx1) then exit; // x is moved out of clipping rect, nothing to do
- if (xd+1 >= wx0) then
+ // only xd
+ if (stx < 0) then
begin
- yd := wy0;
- e -= rem+dsx;
- //if (rem > 0) then begin Inc(xd); e += dy2; end; //BUGGY
- if (xd < wx0) then begin xd += 1; e += dy2; end; //???
- xfixed := true;
+ // xd: to left edge
+ ex := (xd and (not (TileSize-1)))-1;
+ stleft -= xd-ex;
+ end
+ else
+ begin
+ // xd: to right edge
+ ex := (xd or (TileSize-1))+1;
+ stleft -= ex-xd;
end;
+ result := (stleft <= 0);
+ xd := ex;
+ exit;
end;
- if (not xfixed) and (x0 < wx0) then
- begin
- // clip at left
- temp := dy2*(wx0-x0);
- yd += temp div dx2;
- rem := temp mod dx2;
- if (yd > wy1) or (yd = wy1) and (rem >= dsx) then exit;
- xd := wx0;
- e += rem;
- if (rem >= dsx) then begin Inc(yd); e -= dx2; end;
- end;
-
- if (y1 > wy1) then
+ // strictly vertical?
+ if (stx = 0) then
begin
- // clip at bottom
- temp := dx2*(wy1-y0)+dsx;
- term := x0+temp div dy2;
- rem := temp mod dy2;
- if (rem = 0) then Dec(term);
- end;
-
- if (term > wx1) then term := wx1; // clip at right
-
- Inc(term); // draw last point (it is ok to inc here, as `term` sign will be changed later
- //if (term = xd) then exit; // this is the only point, get out of here
-
- if (sty = -1) then yd := -yd;
- if (stx = -1) then begin xd := -xd; term := -term; end;
- dx2 -= dy2;
-
- result := true;
-end;
-
-
-// ////////////////////////////////////////////////////////////////////////// //
-// you are not supposed to understand this
-// returns `true` if there is an intersection, and enter coords
-// enter coords will be equal to (x0, y0) if starting point is inside the box
-// if result is `false`, `inx` and `iny` are undefined
-function lineAABBIntersects (x0, y0, x1, y1: Integer; bx, by, bw, bh: Integer; out inx, iny: Integer): Boolean;
-var
- wx0, wy0, wx1, wy1: Integer; // window coordinates
- stx, sty: Integer; // "steps" for x and y axes
- dsx, dsy: Integer; // "lengthes" for x and y axes
- dx2, dy2: Integer; // "double lengthes" for x and y axes
- xd, yd: Integer; // current coord
- e: Integer; // "error" (as in bresenham algo)
- rem: Integer;
- //!term: Integer;
- d0, d1: PInteger;
- xfixed: Boolean;
- temp: Integer;
-begin
- result := false;
- // why not
- inx := x0;
- iny := y0;
- if (bw < 1) or (bh < 1) then exit; // impossible box
-
- if (x0 = x1) and (y0 = y1) then
- begin
- // check this point
- result := (x0 >= bx) and (y0 >= by) and (x0 < bx+bw) and (y0 < by+bh);
+ // only xd
+ if (sty < 0) then
+ begin
+ // yd: to top edge
+ ey := (yd and (not (TileSize-1)))-1;
+ stleft -= yd-ey;
+ end
+ else
+ begin
+ // yd: to bottom edge
+ ey := (yd or (TileSize-1))+1;
+ stleft -= ey-yd;
+ end;
+ result := (stleft <= 0);
+ yd := ey;
exit;
end;
- // check if staring point is inside the box
- if (x0 >= bx) and (y0 >= by) and (x0 < bx+bw) and (y0 < by+bh) then begin result := true; exit; end;
-
- // clip rectange
- wx0 := bx;
- wy0 := by;
- wx1 := bx+bw-1;
- wy1 := by+bh-1;
-
- // horizontal setup
- if (x0 < x1) then
- begin
- // from left to right
- if (x0 > wx1) or (x1 < wx0) then exit; // out of screen
- stx := 1; // going right
- end
- else
- begin
- // from right to left
- if (x1 > wx1) or (x0 < wx0) then exit; // out of screen
- stx := -1; // going left
- x0 := -x0;
- x1 := -x1;
- wx0 := -wx0;
- wx1 := -wx1;
- swapInt(wx0, wx1);
- end;
+ // diagonal
- // vertical setup
- if (y0 < y1) then
+ // calculate xwalk
+ if (stx < 0) then
begin
- // from top to bottom
- if (y0 > wy1) or (y1 < wy0) then exit; // out of screen
- sty := 1; // going down
+ ex := (xd and (not (TileSize-1)))-1;
+ xwalk := xd-ex;
end
else
begin
- // from bottom to top
- if (y1 > wy1) or (y0 < wy0) then exit; // out of screen
- sty := -1; // going up
- y0 := -y0;
- y1 := -y1;
- wy0 := -wy0;
- wy1 := -wy1;
- swapInt(wy0, wy1);
+ ex := (xd or (TileSize-1))+1;
+ xwalk := ex-xd;
end;
- dsx := x1-x0;
- dsy := y1-y0;
-
- if (dsx < dsy) then
+ // calculate ywalk
+ if (sty < 0) then
begin
- d0 := @yd;
- d1 := @xd;
- swapInt(x0, y0);
- swapInt(x1, y1);
- swapInt(dsx, dsy);
- swapInt(wx0, wy0);
- swapInt(wx1, wy1);
- swapInt(stx, sty);
+ ey := (yd and (not (TileSize-1)))-1;
+ ywalk := yd-ey;
end
else
begin
- d0 := @xd;
- d1 := @yd;
+ ey := (yd or (TileSize-1))+1;
+ ywalk := ey-yd;
end;
- dx2 := 2*dsx;
- dy2 := 2*dsy;
- xd := x0;
- yd := y0;
- e := 2*dsy-dsx;
- //!term := x1;
-
- xfixed := false;
- if (y0 < wy0) then
- begin
- // clip at top
- temp := dx2*(wy0-y0)-dsx;
- xd += temp div dy2;
- rem := temp mod dy2;
- if (xd > wx1) then exit; // x is moved out of clipping rect, nothing to do
- if (xd+1 >= wx0) then
- begin
- yd := wy0;
- e -= rem+dsx;
- //if (rem > 0) then begin Inc(xd); e += dy2; end; //BUGGY
- if (xd < wx0) then begin xd += 1; e += dy2; end; //???
- xfixed := true;
- end;
- end;
-
- if (not xfixed) and (x0 < wx0) then
- begin
- // clip at left
- temp := dy2*(wx0-x0);
- yd += temp div dx2;
- rem := temp mod dx2;
- if (yd > wy1) or (yd = wy1) and (rem >= dsx) then exit;
- xd := wx0;
- e += rem;
- if (rem >= dsx) then begin Inc(yd); e -= dx2; end;
- end;
-
- (*
- if (y1 > wy1) then
- begin
- // clip at bottom
- temp := dx2*(wy1-y0)+dsx;
- term := x0+temp div dy2;
- rem := temp mod dy2;
- if (rem = 0) then Dec(term);
- end;
-
- if (term > wx1) then term := wx1; // clip at right
-
- Inc(term); // draw last point
- //if (term = xd) then exit; // this is the only point, get out of here
- *)
-
- if (sty = -1) then yd := -yd;
- if (stx = -1) then begin xd := -xd; {!term := -term;} end;
- //!dx2 -= dy2;
-
- inx := d0^;
- iny := d1^;
- result := true;
-end;
-
-
-// ////////////////////////////////////////////////////////////////////////// //
-function sweepAABB (mex0, mey0, mew, meh: Integer; medx, medy: Integer; itx0, ity0, itw, ith: Integer;
- u0: PSingle=nil; hitedge: PInteger=nil; u1: PSingle=nil): Boolean;
-var
- tin, tout: Single;
-
- function axisOverlap (me0, me1, it0, it1, d, he0, he1: Integer): Boolean; inline;
- var
- t: Single;
+ {
+ while (xd <> ex) and (yd <> ey) do
begin
- result := false;
-
- if (me1 < it0) then
+ if horiz then
begin
- if (d >= 0) then exit; // oops, no hit
- t := (me1-it0+1)/d;
- if (t > tin) then begin tin := t; hitedge^ := he1; end;
+ xd += stx;
+ err += errinc;
+ if (err >= 0) then begin err -= errmax; yd += sty; end;
end
- else if (it1 < me0) then
+ else
begin
- if (d <= 0) then exit; // oops, no hit
- t := (me0-it1-1)/d;
- if (t > tin) then begin tin := t; hitedge^ := he0; end;
+ yd += sty;
+ err += errinc;
+ if (err >= 0) then begin err -= errmax; xd += stx; end;
end;
+ Dec(stleft);
+ if (stleft < 1) then begin result := true; exit; end;
+ end;
+ }
- if (d < 0) and (it1 > me0) then
+ if (xwalk <= ywalk) then wklen := xwalk else wklen := ywalk;
+ while true do
+ begin
+ // in which dir we want to walk?
+ stleft -= wklen;
+ if (stleft <= 0) then begin result := true; exit; end;
+ if horiz then
begin
- t := (me0-it1-1)/d;
- if (t < tout) then tout := t;
+ xd += wklen*stx;
+ for f := 1 to wklen do
+ begin
+ err += errinc;
+ if (err >= 0) then begin err -= errmax; yd += sty; end;
+ end;
end
- else if (d > 0) and (me1 > it0) then
+ else
begin
- t := (me1-it0+1)/d;
- if (t < tout) then tout := t;
+ yd += wklen*sty;
+ for f := 1 to wklen do
+ begin
+ err += errinc;
+ if (err >= 0) then begin err -= errmax; xd += stx; end;
+ end;
end;
-
- result := true;
- end;
-
-var
- mex1, mey1, itx1, ity1, vx, vy: Integer;
- htt: Integer = -1;
-begin
- result := false;
- if (u0 <> nil) then u0^ := -1.0;
- if (u1 <> nil) then u1^ := -1.0;
- if (hitedge = nil) then hitedge := @htt else hitedge^ := -1;
-
- if (mew < 1) or (meh < 1) or (itw < 1) or (ith < 1) then exit;
-
- mex1 := mex0+mew-1;
- mey1 := mey0+meh-1;
- itx1 := itx0+itw-1;
- ity1 := ity0+ith-1;
-
- // check if they are overlapping right now (SAT)
- //if (mex1 >= itx0) and (mex0 <= itx1) and (mey1 >= ity0) and (mey0 <= ity1) then begin result := true; exit; end;
-
- if (medx = 0) and (medy = 0) then exit; // both boxes are sationary
-
- // treat b as stationary, so invert v to get relative velocity
- vx := -medx;
- vy := -medy;
-
- tin := -100000000.0;
- tout := 100000000.0;
-
- if not axisOverlap(mex0, mex1, itx0, itx1, vx, 1, 3) then exit;
- if not axisOverlap(mey0, mey1, ity0, ity1, vy, 2, 0) then exit;
-
- if (u0 <> nil) then u0^ := tin;
- if (u1 <> nil) then u1^ := tout;
-
- if (tin <= tout) and (tin >= 0.0) and (tin <= 1.0) then
- begin
- result := true;
+ // check for walk completion
+ if (xd = ex) or (yd = ey) then exit;
+ wklen := 1;
end;
end;
+procedure TLineWalker.getXY (out ox, oy: Integer); inline; begin ox := xd; oy := yd; end;
+
// ////////////////////////////////////////////////////////////////////////// //
procedure TBodyGridBase.TBodyProxyRec.setup (aX, aY, aWidth, aHeight: Integer; aObj: ITP; aTag: Integer);
mProxyFree := 0;
mProxyCount := 0;
mProxyMaxCount := 0;
- e_WriteLog(Format('created grid with size: %dx%d (tile size: %d); pix: %dx%d', [mWidth, mHeight, mTileSize, mWidth*mTileSize, mHeight*mTileSize]), MSG_NOTIFY);
+ e_WriteLog(Format('created grid with size: %dx%d (tile size: %d); pix: %dx%d', [mWidth, mHeight, mTileSize, mWidth*mTileSize, mHeight*mTileSize]), TMsgType.Notify);
end;
end;
if (mcb < cnt) then mcb := cnt;
end;
- e_WriteLog(Format('grid size: %dx%d (tile size: %d); pix: %dx%d; used cells: %d; max bodies in cell: %d; max proxies allocated: %d; proxies used: %d', [mWidth, mHeight, mTileSize, mWidth*mTileSize, mHeight*mTileSize, mUsedCells, mcb, mProxyMaxCount, mProxyCount]), MSG_NOTIFY);
+ e_WriteLog(Format('grid size: %dx%d (tile size: %d); pix: %dx%d; used cells: %d; max bodies in cell: %d; max proxies allocated: %d; proxies used: %d', [mWidth, mHeight, mTileSize, mWidth*mTileSize, mHeight*mTileSize, mUsedCells, mcb, mProxyMaxCount, mProxyCount]), TMsgType.Notify);
end;
-procedure TBodyGridBase.forEachBodyCell (body: TBodyProxyId; cb: TCellQueryCB);
+function TBodyGridBase.forEachBodyCell (body: TBodyProxyId): CellCoordIter;
var
g, f, ccidx: Integer;
cc: PGridCell;
+ presobj: PGridCellCoord;
begin
- if (body < 0) or (body > High(mProxies)) or not assigned(cb) then exit;
+ result := CellCoordIter.Create(framePool);
+ if (body < 0) or (body > High(mProxies)) then begin result.finishIt(); exit; end;
for g := 0 to High(mGrid) do
begin
ccidx := mGrid[g];
for f := 0 to GridCellBucketSize-1 do
begin
if (cc.bodies[f] = -1) then break;
- if (cc.bodies[f] = body) then cb((g mod mWidth)*mTileSize+mMinX, (g div mWidth)*mTileSize+mMinY);
+ if (cc.bodies[f] = body) then
+ begin
+ presobj := PGridCellCoord(framePool.alloc(sizeof(TGridCellCoord)));
+ presobj^.x := (g mod mWidth)*mTileSize+mMinX;
+ presobj^.y := (g div mWidth)*mTileSize+mMinY;
+ //cb((g mod mWidth)*mTileSize+mMinX, (g div mWidth)*mTileSize+mMinY);
+ end;
end;
// next cell
ccidx := cc.next;
end;
end;
+ result.finishIt();
end;
-function TBodyGridBase.forEachInCell (x, y: Integer; cb: TGridQueryCB): ITP;
+function TBodyGridBase.forEachInCell (x, y: Integer): Iter;
var
f, ccidx: Integer;
cc: PGridCell;
+ presobj: PITP;
begin
- result := Default(ITP);
- if not assigned(cb) then exit;
+ result := Iter.Create(framePool);
Dec(x, mMinX);
Dec(y, mMinY);
- if (x < 0) or (y < 0) or (x >= mWidth*mTileSize) or (y > mHeight*mTileSize) then exit;
+ if (x < 0) or (y < 0) or (x >= mWidth*mTileSize) or (y > mHeight*mTileSize) then begin result.finishIt(); exit; end;
ccidx := mGrid[(y div mTileSize)*mWidth+(x div mTileSize)];
while (ccidx <> -1) do
begin
for f := 0 to GridCellBucketSize-1 do
begin
if (cc.bodies[f] = -1) then break;
- if cb(mProxies[cc.bodies[f]].mObj, mProxies[cc.bodies[f]].mTag) then begin result := mProxies[cc.bodies[f]].mObj; exit; end;
+ //if cb(mProxies[cc.bodies[f]].mObj, mProxies[cc.bodies[f]].mTag) then begin result := mProxies[cc.bodies[f]].mObj; exit; end;
+ presobj := PITP(framePool.alloc(sizeof(ITP)));
+ //presobj^ := mProxies[cc.bodies[f]].mObj;
+ Move(mProxies[cc.bodies[f]].mObj, presobj^, sizeof(ITP));
end;
// next cell
ccidx := cc.next;
end;
+ result.finishIt();
end;
// ////////////////////////////////////////////////////////////////////////// //
// no callback: return `true` on the first hit
-function TBodyGridBase.forEachAtPoint (x, y: Integer; cb: TGridQueryCB; tagmask: Integer=-1; exittag: PInteger=nil): ITP;
+function TBodyGridBase.forEachAtPoint (x, y: Integer; tagmask: Integer=-1; allowDisabled: Boolean=false; firstHit: Boolean=false): Iter;
var
f: Integer;
idx, curci: Integer;
px: PBodyProxyRec;
lq: LongWord;
ptag: Integer;
+ presobj: PITP;
begin
- result := Default(ITP);
- if (exittag <> nil) then exittag^ := 0;
+ result := Iter.Create(framePool);
tagmask := tagmask and TagFullMask;
- if (tagmask = 0) then exit;
+ if (tagmask = 0) then begin result.finishIt(); exit; end;
{$IF DEFINED(D2F_DEBUG_XXQ)}
if (assigned(cb)) then e_WriteLog(Format('0: grid pointquery: (%d,%d)', [x, y]), MSG_NOTIFY);
// make coords (0,0)-based
Dec(x, mMinX);
Dec(y, mMinY);
- if (x < 0) or (y < 0) or (x >= mWidth*mTileSize) or (y >= mHeight*mTileSize) then exit;
+ if (x < 0) or (y < 0) or (x >= mWidth*mTileSize) or (y >= mHeight*mTileSize) then begin result.finishIt(); exit; end;
curci := mGrid[(y div mTileSize)*mWidth+(x div mTileSize)];
while (curci <> -1) do
begin
{$IF DEFINED(D2F_DEBUG_XXQ)}
- if (assigned(cb)) then e_WriteLog(Format(' cell #%d', [curci]), MSG_NOTIFY);
+ //if (assigned(cb)) then e_WriteLog(Format(' cell #%d', [curci]), MSG_NOTIFY);
{$ENDIF}
cc := @mCells[curci];
for f := 0 to GridCellBucketSize-1 do
if (cc.bodies[f] = -1) then break;
px := @mProxies[cc.bodies[f]];
{$IF DEFINED(D2F_DEBUG_XXQ)}
- if (assigned(cb)) then e_WriteLog(Format(' proxy #%d; qm:%u; tag:%08x; tagflag:%d %u', [cc.bodies[f], px.mQueryMark, px.mTag, (px.mTag and tagmask), LongWord(px.mObj)]), MSG_NOTIFY);
+ //if (assigned(cb)) then e_WriteLog(Format(' proxy #%d; qm:%u; tag:%08x; tagflag:%d %u', [cc.bodies[f], px.mQueryMark, px.mTag, (px.mTag and tagmask), LongWord(px.mObj)]), MSG_NOTIFY);
{$ENDIF}
- // shit. has to do it this way, so i can change tag in callback
- if (px.mQueryMark <> lq) then
+ if (px.mQueryMark = lq) then continue;
+ px.mQueryMark := lq;
+ ptag := px.mTag;
+ if (not allowDisabled) and ((ptag and TagDisabled) <> 0) then continue;
+ if ((ptag and tagmask) = 0) then continue;
+ if (x >= px.mX) and (y >= px.mY) and (x < px.mX+px.mWidth) and (y < px.mY+px.mHeight) then
begin
- px.mQueryMark := lq;
- ptag := px.mTag;
- if ((ptag and TagDisabled) = 0) and ((ptag and tagmask) <> 0) and
- (x >= px.mX) and (y >= px.mY) and (x < px.mX+px.mWidth) and (y < px.mY+px.mHeight) then
- begin
- if assigned(cb) then
- begin
- if cb(px.mObj, ptag) then
- begin
- result := px.mObj;
- if (exittag <> nil) then exittag^ := ptag;
- exit;
- end;
- end
- else
- begin
- result := px.mObj;
- if (exittag <> nil) then exittag^ := ptag;
- exit;
- end;
- end;
+ presobj := PITP(framePool.alloc(sizeof(ITP)));
+ Move(px.mObj, presobj^, sizeof(ITP));
+ if (firstHit) then begin result.finishIt(); exit; end;
end;
end;
curci := cc.next;
end;
+ result.finishIt();
end;
// ////////////////////////////////////////////////////////////////////////// //
// no callback: return `true` on the first hit
-function TBodyGridBase.forEachInAABB (x, y, w, h: Integer; cb: TGridQueryCB; tagmask: Integer=-1; allowDisabled: Boolean=false): ITP;
+// return number of ITP thingys put into frame pool
+function TBodyGridBase.forEachInAABB (x, y, w, h: Integer; tagmask: Integer=-1; allowDisabled: Boolean=false; firstHit: Boolean=false): Iter;
var
idx: Integer;
gx, gy: Integer;
gw, gh: Integer;
x0, y0: Integer;
ptag: Integer;
+ presobj: PITP;
begin
- result := Default(ITP);
- if (w < 1) or (h < 1) then exit;
+ if (w = 1) and (h = 1) then
+ begin
+ result := forEachAtPoint(x, y, tagmask, allowDisabled, firstHit);
+ exit;
+ end;
+
+ result := Iter.Create(framePool);
+ if (w < 1) or (h < 1) then begin result.finishIt(); exit; end;
+
tagmask := tagmask and TagFullMask;
- if (tagmask = 0) then exit;
+ if (tagmask = 0) then begin result.finishIt(); exit; end;
x0 := x;
y0 := y;
gw := mWidth;
gh := mHeight;
- if (x+w <= 0) or (y+h <= 0) then exit;
- if (x >= gw*mTileSize) or (y >= gh*mTileSize) then exit;
+ if (x+w <= 0) or (y+h <= 0) then begin result.finishIt(); exit; end;
+ if (x >= gw*mTileSize) or (y >= gh*mTileSize) then begin result.finishIt(); exit; end;
sx := x div mTileSize;
sy := y div mTileSize;
if (sy < 0) then sy := 0 else if (sy >= gh) then sy := gh-1;
if (ex < 0) then ex := 0 else if (ex >= gw) then ex := gw-1;
if (ey < 0) then ey := 0 else if (ey >= gh) then ey := gh-1;
- if (sx > ex) or (sy > ey) then exit; // just in case
+ if (sx > ex) or (sy > ey) then begin result.finishIt(); exit; end; // just in case
// has something to do
- if mInQuery then raise Exception.Create('recursive queries aren''t supported');
- mInQuery := true;
// increase query counter
Inc(mLastQuery);
if ((ptag and tagmask) = 0) then continue;
if (x0 >= px.mX+px.mWidth) or (y0 >= px.mY+px.mHeight) then continue;
if (x0+w <= px.mX) or (y0+h <= px.mY) then continue;
- if assigned(cb) then
- begin
- if cb(px.mObj, ptag) then begin result := px.mObj; mInQuery := false; exit; end;
- end
- else
- begin
- result := px.mObj;
- mInQuery := false;
- exit;
- end;
+ presobj := PITP(framePool.alloc(sizeof(ITP)));
+ Move(px.mObj, presobj^, sizeof(ITP));
+ if (firstHit) then begin result.finishIt(); exit; end;
end;
curci := cc.next;
end;
end;
end;
-
- mInQuery := false;
+ result.finishIt();
end;
// ////////////////////////////////////////////////////////////////////////// //
-function TBodyGridBase.forEachAlongLine (ax0, ay0, ax1, ay1: Integer; cb: TGridQueryCB; tagmask: Integer=-1; log: Boolean=false): ITP;
+function TBodyGridBase.forEachAlongLine (ax0, ay0, ax1, ay1: Integer; tagmask: Integer=-1; log: Boolean=false): Iter;
var
lw: TLineWalker;
ccidx: Integer;
x1, y1: Integer;
cx, cy: Integer;
//px0, py0, px1, py1: Integer;
+ presobj: PITP;
begin
log := false;
- result := Default(ITP);
+ result := Iter.Create(framePool);
tagmask := tagmask and TagFullMask;
- if (tagmask = 0) or not assigned(cb) then exit;
+ if (tagmask = 0) then begin result.finishIt(); exit; end;
gw := mWidth;
gh := mHeight;
y1 := ay1-miny;
lw := TLineWalker.Create(0, 0, gw*mTileSize-1, gh*mTileSize-1);
- if not lw.setup(x0, y0, x1, y1) then exit; // out of screen
-
- if mInQuery then raise Exception.Create('recursive queries aren''t supported');
- mInQuery := true;
+ if not lw.setup(x0, y0, x1, y1) then begin result.finishIt(); exit; end; // out of screen
// increase query counter
Inc(mLastQuery);
if ((ptag and TagDisabled) = 0) and ((ptag and tagmask) <> 0) and (px.mQueryMark <> lq) then
begin
px.mQueryMark := lq; // mark as processed
- if cb(px.mObj, ptag) then
- begin
- result := px.mObj;
- mInQuery := false;
- exit;
- end;
+ presobj := PITP(framePool.alloc(sizeof(ITP)));
+ Move(px.mObj, presobj^, sizeof(ITP));
end;
end;
// next cell
end;
// done processing cells, move to next tile
until lw.stepToNextTile();
-
- mInQuery := false;
+ result.finishIt();
end;
// ////////////////////////////////////////////////////////////////////////// //
// trace box with the given velocity; return object hit (if any)
-// `cb` is used unconvetionally here: if it returns `false`, tracer will ignore the object
-function TBodyGridBase.traceBox (out ex, ey: Integer; const ax0, ay0, aw, ah: Integer; const dx, dy: Integer; cb: TGridQueryCB; tagmask: Integer=-1): ITP;
+function TBodyGridBase.traceBox (out ex, ey: Integer; const ax0, ay0, aw, ah: Integer; const dx, dy: Integer; tagmask: Integer=-1): ITP;
var
gx, gy: Integer;
ccidx: Integer;
// just in case
if (cx0 > cx1) or (cy0 > cy1) then exit;
- if mInQuery then raise Exception.Create('recursive queries aren''t supported');
- mInQuery := true;
-
// increase query counter
Inc(mLastQuery);
if (mLastQuery = 0) then
if ((ptag and TagDisabled) = 0) and ((ptag and tagmask) <> 0) and (px.mQueryMark <> lq) then
begin
px.mQueryMark := lq; // mark as processed
- if assigned(cb) then
- begin
- if not cb(px.mObj, ptag) then continue;
- end;
if not sweepAABB(ax0, ay0, aw, ah, dx, dy, px.mX, px.mY, px.mWidth, px.mHeight, @u0) then continue;
if (minu0 > u0) then
begin
begin
ex := ax0;
ey := ay0;
- mInQuery := false;
exit;
end;
end;
ey := ay0+trunc(dy*minu0);
end;
end;
-
- mInQuery := false;
end;
{$IF DEFINED(D2F_DEBUG_OTR)}
s: AnsiString = '';
{$ENDIF}
+ it: Iter;
begin
result := false;
ex := ax1;
tagmask := tagmask and TagFullMask;
if (tagmask = 0) then exit;
- if (forEachAtPoint(ax0, ay0, nil, tagmask) = nil) then exit;
+ it := forEachAtPoint(ax0, ay0, tagmask, false, true);
+ if (it.length = 0) then begin it.release(); exit; end;
+ it.release();
minx := mMinX;
miny := mMinY;
// ////////////////////////////////////////////////////////////////////////// //
-function TBodyGridBase.traceRay (const x0, y0, x1, y1: Integer; cb: TGridQueryCB; tagmask: Integer=-1): ITP;
+function TBodyGridBase.traceRay (const x0, y0, x1, y1: Integer; tagmask: Integer=-1): ITP;
var
ex, ey: Integer;
begin
- result := traceRay(ex, ey, x0, y0, x1, y1, cb, tagmask);
+ result := traceRay(ex, ey, x0, y0, x1, y1, tagmask);
end;
-// no callback: return `true` on the nearest hit
// you are not supposed to understand this
-function TBodyGridBase.traceRay (out ex, ey: Integer; const ax0, ay0, ax1, ay1: Integer; cb: TGridQueryCB; tagmask: Integer=-1): ITP;
+function TBodyGridBase.traceRay (out ex, ey: Integer; const ax0, ay0, ax1, ay1: Integer; tagmask: Integer=-1): ITP;
var
- lw, sweepw: TLineWalker;
+ lw: TLineWalker;
ccidx: Integer;
cc: PGridCell;
px: PBodyProxyRec;
lw := TLineWalker.Create(0, 0, gw*mTileSize-1, gh*mTileSize-1);
if not lw.setup(x0, y0, x1, y1) then exit; // out of screen
- sweepw := TLineWalker.Create(0, 0, 1, 1); // doesn't matter, just shut ups the compiler
-
lastDistSq := distanceSq(ax0, ay0, ax1, ay1)+1;
- if mInQuery then raise Exception.Create('recursive queries aren''t supported');
- mInQuery := true;
+ {$IF DEFINED(D2F_DEBUG)}
+ //if assigned(dbgRayTraceTileHitCB) then e_LogWritefln('*** traceRay: (%s,%s)-(%s,%s)', [x0, y0, x1, y1]);
+ {$ENDIF}
// increase query counter
Inc(mLastQuery);
repeat
lw.getXY(cx, cy);
+ {$IF DEFINED(D2F_DEBUG)}
+ if assigned(dbgRayTraceTileHitCB) then dbgRayTraceTileHitCB(cx+mMinX, cy+mMinY);
+ {$ENDIF}
// check tile
ccidx := mGrid[(cy div mTileSize)*gw+(cx div mTileSize)];
// process cells
if ((ptag and TagDisabled) = 0) and ((ptag and tagmask) <> 0) and (px.mQueryMark <> lq) then
begin
px.mQueryMark := lq; // mark as processed
- if assigned(cb) then
- begin
- if not cb(px.mObj, ptag) then continue;
- end;
// get adjusted proxy coords
px0 := px.mX-minx;
py0 := px.mY-miny;
px1 := px0+px.mWidth-1;
py1 := py0+px.mHeight-1;
+ {$IF DEFINED(D2F_DEBUG)}
+ //if assigned(dbgRayTraceTileHitCB) then e_LogWritefln(' cxy=(%s,%s); pan=(%s,%s)-(%s,%s)', [cx, cy, px0, py0, px1, py1]);
+ {$ENDIF}
// inside?
if firstCell and (x0 >= px0) and (y0 >= py0) and (x0 <= px1) and (y0 <= py1) then
begin
ex := ax0;
ey := ay0;
result := px.mObj;
- mInQuery := false;
+ {$IF DEFINED(D2F_DEBUG)}
+ if assigned(dbgRayTraceTileHitCB) then e_LogWriteln(' INSIDE!');
+ {$ENDIF}
exit;
end;
// do line-vs-aabb test
- sweepw.setClip(px0, py0, px1, py1);
- if sweepw.setup(x0, y0, x1, y1) then
+ if lineAABBIntersects(x0, y0, x1, y1, px0, py0, px1-px0+1, py1-py0+1, hx, hy) then
begin
// hit detected
- sweepw.getPrevXY(hx, hy);
distSq := distanceSq(x0, y0, hx, hy);
+ {$IF DEFINED(D2F_DEBUG)}
+ //if assigned(dbgRayTraceTileHitCB) then e_LogWritefln(' hit=(%s,%s); distSq=%s; lastDistSq=%s', [hx, hy, distSq, lastDistSq]);
+ {$ENDIF}
if (distSq < lastDistSq) then
begin
lastDistSq := distSq;
ex := hx+minx;
ey := hy+miny;
result := px.mObj;
- // if this is not a first cell, get outta here
- if not firstCell then begin mInQuery := false; exit; end;
wasHit := true;
end;
end;
end;
// done processing cells; exit if we registered a hit
// next cells can't have better candidates, obviously
- if wasHit then begin mInQuery := false; exit; end;
+ if wasHit then exit;
firstCell := false;
// move to next tile
until lw.stepToNextTile();
-
- mInQuery := false;
-end;
-
-
-// ////////////////////////////////////////////////////////////////////////// //
-// no callback: return `true` on the nearest hit
-function TBodyGridBase.traceRayOld (const x0, y0, x1, y1: Integer; cb: TGridRayQueryCB; tagmask: Integer=-1): ITP;
-var
- ex, ey: Integer;
-begin
- result := traceRayOld(ex, ey, x0, y0, x1, y1, cb, tagmask);
-end;
-
-
-// no callback: return `true` on the nearest hit
-// you are not supposed to understand this
-function TBodyGridBase.traceRayOld (out ex, ey: Integer; const ax0, ay0, ax1, ay1: Integer; cb: TGridRayQueryCB; tagmask: Integer=-1): ITP;
-var
- wx0, wy0, wx1, wy1: Integer; // window coordinates
- stx, sty: Integer; // "steps" for x and y axes
- dsx, dsy: Integer; // "lengthes" for x and y axes
- dx2, dy2: Integer; // "double lengthes" for x and y axes
- xd, yd: Integer; // current coord
- e: Integer; // "error" (as in bresenham algo)
- rem: Integer;
- term: Integer;
- xptr, yptr: PInteger;
- xfixed: Boolean;
- temp: Integer;
- prevx, prevy: Integer;
- lastDistSq: Integer;
- ccidx, curci: Integer;
- hasUntried: Boolean;
- lastGA: Integer = -1;
- ga, x, y: Integer;
- lastObj: ITP;
- wasHit: Boolean = false;
- gw, gh, minx, miny, maxx, maxy: Integer;
- cc: PGridCell;
- px: PBodyProxyRec;
- lq: LongWord;
- f, ptag, distSq: Integer;
- x0, y0, x1, y1: Integer;
- //swapped: Boolean = false; // true: xd is yd, and vice versa
- // horizontal walker
- {$IFDEF GRID_USE_ORTHO_ACCEL}
- wklen, wkstep: Integer;
- //wksign: Integer;
- hopt: Boolean;
- {$ENDIF}
- // skipper
- xdist, ydist: Integer;
-begin
- result := Default(ITP);
- lastObj := Default(ITP);
- tagmask := tagmask and TagFullMask;
- ex := ax1; // why not?
- ey := ay1; // why not?
- if (tagmask = 0) then exit;
-
- if (ax0 = ax1) and (ay0 = ay1) then
- begin
- result := forEachAtPoint(ax0, ay0, nil, tagmask, @ptag);
- if (result <> nil) then
- begin
- if assigned(cb) and not cb(result, ptag, ax0, ay0, ax0, ay0) then result := Default(ITP);
- end;
- exit;
- end;
-
- lastDistSq := distanceSq(ax0, ay0, ax1, ay1)+1;
-
- gw := mWidth;
- gh := mHeight;
- minx := mMinX;
- miny := mMinY;
- maxx := gw*mTileSize-1;
- maxy := gh*mTileSize-1;
-
- {$IF DEFINED(D2F_DEBUG_RAYTRACE)}
- if assigned(dbgRayTraceTileHitCB) then e_WriteLog(Format('TRACING: (%d,%d)-(%d,%d) [(%d,%d)-(%d,%d)]; maxdistsq=%d', [ax0, ay0, ax1, ay1, minx, miny, maxx, maxy, lastDistSq]), MSG_NOTIFY);
- {$ENDIF}
-
- x0 := ax0;
- y0 := ay0;
- x1 := ax1;
- y1 := ay1;
-
- // offset query coords to (0,0)-based
- Dec(x0, minx);
- Dec(y0, miny);
- Dec(x1, minx);
- Dec(y1, miny);
-
- // clip rectange
- wx0 := 0;
- wy0 := 0;
- wx1 := maxx;
- wy1 := maxy;
-
- // horizontal setup
- if (x0 < x1) then
- begin
- // from left to right
- if (x0 > wx1) or (x1 < wx0) then exit; // out of screen
- stx := 1; // going right
- end
- else
- begin
- // from right to left
- if (x1 > wx1) or (x0 < wx0) then exit; // out of screen
- stx := -1; // going left
- x0 := -x0;
- x1 := -x1;
- wx0 := -wx0;
- wx1 := -wx1;
- swapInt(wx0, wx1);
- end;
-
- // vertical setup
- if (y0 < y1) then
- begin
- // from top to bottom
- if (y0 > wy1) or (y1 < wy0) then exit; // out of screen
- sty := 1; // going down
- end
- else
- begin
- // from bottom to top
- if (y1 > wy1) or (y0 < wy0) then exit; // out of screen
- sty := -1; // going up
- y0 := -y0;
- y1 := -y1;
- wy0 := -wy0;
- wy1 := -wy1;
- swapInt(wy0, wy1);
- end;
-
- dsx := x1-x0;
- dsy := y1-y0;
-
- if (dsx < dsy) then
- begin
- //swapped := true;
- xptr := @yd;
- yptr := @xd;
- swapInt(x0, y0);
- swapInt(x1, y1);
- swapInt(dsx, dsy);
- swapInt(wx0, wy0);
- swapInt(wx1, wy1);
- swapInt(stx, sty);
- end
- else
- begin
- xptr := @xd;
- yptr := @yd;
- end;
-
- dx2 := 2*dsx;
- dy2 := 2*dsy;
- xd := x0;
- yd := y0;
- e := 2*dsy-dsx;
- term := x1;
-
- xfixed := false;
- if (y0 < wy0) then
- begin
- // clip at top
- temp := dx2*(wy0-y0)-dsx;
- xd += temp div dy2;
- rem := temp mod dy2;
- if (xd > wx1) then exit; // x is moved out of clipping rect, nothing to do
- if (xd+1 >= wx0) then
- begin
- yd := wy0;
- e -= rem+dsx;
- //if (rem > 0) then begin Inc(xd); e += dy2; end; //BUGGY
- if (xd < wx0) then begin xd += 1; e += dy2; end; //???
- xfixed := true;
- end;
- end;
-
- if (not xfixed) and (x0 < wx0) then
- begin
- // clip at left
- temp := dy2*(wx0-x0);
- yd += temp div dx2;
- rem := temp mod dx2;
- if (yd > wy1) or (yd = wy1) and (rem >= dsx) then exit;
- xd := wx0;
- e += rem;
- if (rem >= dsx) then begin Inc(yd); e -= dx2; end;
- end;
-
- if (y1 > wy1) then
- begin
- // clip at bottom
- temp := dx2*(wy1-y0)+dsx;
- term := x0+temp div dy2;
- rem := temp mod dy2;
- if (rem = 0) then Dec(term);
- end;
-
- if (term > wx1) then term := wx1; // clip at right
-
- Inc(term); // draw last point
- //if (term = xd) then exit; // this is the only point, get out of here
-
- if (sty = -1) then yd := -yd;
- if (stx = -1) then begin xd := -xd; term := -term; end;
- dx2 -= dy2;
-
- // first move, to skip starting point
- // DON'T DO THIS! loop will take care of that
- if (xd = term) then
- begin
- //FIXME!
- result := forEachAtPoint(ax0, ay0, nil, tagmask, @ptag);
- if (result <> nil) then
- begin
- if assigned(cb) then
- begin
- if cb(result, ptag, ax0, ay0, ax0, ay0) then
- begin
- ex := ax0;
- ey := ay0;
- end
- else
- begin
- result := nil;
- end;
- end
- else
- begin
- ex := ax0;
- ey := ay0;
- end;
- end;
- exit;
- end;
-
- prevx := xptr^+minx;
- prevy := yptr^+miny;
- (*
- // move coords
- if (e >= 0) then begin yd += sty; e -= dx2; end else e += dy2;
- xd += stx;
- // done?
- if (xd = term) then exit;
- *)
-
- {$IF DEFINED(D2F_DEBUG)}
- if (xptr^ < 0) or (yptr^ < 0) or (xptr^ >= gw*mTileSize) and (yptr^ >= gh*mTileSize) then raise Exception.Create('raycaster internal error (0)');
- {$ENDIF}
- // DON'T DO THIS! loop will take care of that
- //lastGA := (yptr^ div tsize)*gw+(xptr^ div tsize);
- //ccidx := mGrid[lastGA];
-
- {$IF DEFINED(D2F_DEBUG_RAYTRACE)}
- //if assigned(dbgRayTraceTileHitCB) then e_WriteLog('1:TRACING!', MSG_NOTIFY);
- {$ENDIF}
-
- //if (dbgShowTraceLog) then e_WriteLog(Format('raycast start: (%d,%d)-(%d,%d); xptr^=%d; yptr^=%d', [ax0, ay0, ax1, ay1, xptr^, yptr^]), MSG_NOTIFY);
-
- if mInQuery then raise Exception.Create('recursive queries aren''t supported');
- mInQuery := true;
-
- // increase query counter
- Inc(mLastQuery);
- if (mLastQuery = 0) then
- begin
- // just in case of overflow
- mLastQuery := 1;
- for f := 0 to High(mProxies) do mProxies[f].mQueryMark := 0;
- end;
- lq := mLastQuery;
-
- {$IFDEF GRID_USE_ORTHO_ACCEL}
- // if this is strict horizontal/vertical trace, use optimized codepath
- if (ax0 = ax1) or (ay0 = ay1) then
- begin
- // horizontal trace: walk the whole tiles, calculating mindist once for each proxy in cell
- // stx < 0: going left, otherwise `stx` is > 0, and we're going right
- // vertical trace: walk the whole tiles, calculating mindist once for each proxy in cell
- // stx < 0: going up, otherwise `stx` is > 0, and we're going down
- hopt := (ay0 = ay1); // horizontal?
- if (stx < 0) then begin {wksign := -1;} wklen := -(term-xd); end else begin {wksign := 1;} wklen := term-xd; end;
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln('optimized htrace; wklen=%d', [wklen]);
- {$ENDIF}
- ga := (yptr^ div mTileSize)*gw+(xptr^ div mTileSize);
- // one of those will never change
- x := xptr^+minx;
- y := yptr^+miny;
- while (wklen > 0) do
- begin
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' htrace; ga=%d; x=%d, y=%d; y=%d; y=%d', [ga, xptr^+minx, yptr^+miny, y, ay0]);
- {$ENDIF}
- // new tile?
- if (ga <> lastGA) then
- begin
- lastGA := ga;
- ccidx := mGrid[lastGA];
- // convert coords to map (to avoid ajdusting coords inside the loop)
- if hopt then x := xptr^+minx else y := yptr^+miny;
- while (ccidx <> -1) do
- begin
- cc := @mCells[ccidx];
- for f := 0 to GridCellBucketSize-1 do
- begin
- if (cc.bodies[f] = -1) then break;
- px := @mProxies[cc.bodies[f]];
- ptag := px.mTag;
- if ((ptag and TagDisabled) = 0) and ((ptag and tagmask) <> 0) and (px.mQueryMark <> lq) and
- // constant coord should be inside
- ((hopt and (y >= px.y0) and (y <= px.y1)) or
- ((not hopt) and (x >= px.x0) and (x <= px.x1))) then
- begin
- px.mQueryMark := lq; // mark as processed
- // inside the proxy?
- if (hopt and (x > px.x0) and (x < px.x1)) or
- ((not hopt) and (y > px.y0) and (y < px.y1)) then
- begin
- // setup prev[xy]
- if assigned(cb) then
- begin
- if cb(px.mObj, ptag, x, y, x, y) then
- begin
- result := px.mObj;
- ex := x;
- ey := y;
- mInQuery := false;
- exit;
- end;
- end
- else
- begin
- distSq := distanceSq(ax0, ay0, x, y);
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' EMBEDDED hhit(%d): a=(%d,%d), h=(%d,%d), distsq=%d; lastsq=%d', [cc.bodies[f], ax0, ay0, x, y, distSq, lastDistSq]);
- {$ENDIF}
- if (distSq < lastDistSq) then
- begin
- ex := x;
- ey := y;
- result := px.mObj;
- mInQuery := false;
- exit;
- end;
- end;
- continue;
- end;
- // remember this hitpoint if it is nearer than an old one
- // setup prev[xy]
- if hopt then
- begin
- // horizontal trace
- prevy := y;
- y := yptr^+miny;
- if (stx < 0) then
- begin
- // going left
- if (x < px.x1) then continue; // not on the right edge
- x := px.x1;
- prevx := x+1;
- end
- else
- begin
- // going right
- if (x > px.x0) then continue; // not on the left edge
- x := px.x0;
- prevx := x-1;
- end;
- end
- else
- begin
- // vertical trace
- prevx := x;
- x := xptr^+minx;
- if (stx < 0) then
- begin
- // going up
- if (y < px.y1) then continue; // not on the bottom edge
- y := px.y1;
- prevy := x+1;
- end
- else
- begin
- // going down
- if (y > px.y0) then continue; // not on the top edge
- y := px.y0;
- prevy := y-1;
- end;
- end;
- if assigned(cb) then
- begin
- if cb(px.mObj, ptag, x, y, prevx, prevy) then
- begin
- result := px.mObj;
- ex := prevx;
- ey := prevy;
- mInQuery := false;
- exit;
- end;
- end
- else
- begin
- distSq := distanceSq(ax0, ay0, prevx, prevy);
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' hhit(%d): a=(%d,%d), h=(%d,%d), p=(%d,%d), distsq=%d; lastsq=%d', [cc.bodies[f], ax0, ay0, x, y, prevx, prevy, distSq, lastDistSq]);
- {$ENDIF}
- if (distSq < lastDistSq) then
- begin
- wasHit := true;
- lastDistSq := distSq;
- ex := prevx;
- ey := prevy;
- lastObj := px.mObj;
- end;
- end;
- end;
- end;
- // next cell
- ccidx := cc.next;
- end;
- if wasHit and not assigned(cb) then begin result := lastObj; mInQuery := false; exit; end;
- if assigned(cb) and cb(nil, 0, x, y, x, y) then begin result := lastObj; mInQuery := false; exit; end;
- end;
- // skip to next tile
- if hopt then
- begin
- if (stx > 0) then
- begin
- // to the right
- wkstep := ((xptr^ or (mTileSize-1))+1)-xptr^;
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' right step: wklen=%d; wkstep=%d', [wklen, wkstep]);
- {$ENDIF}
- if (wkstep >= wklen) then break;
- Inc(xptr^, wkstep);
- Inc(ga);
- end
- else
- begin
- // to the left
- wkstep := xptr^-((xptr^ and (not (mTileSize-1)))-1);
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' left step: wklen=%d; wkstep=%d', [wklen, wkstep]);
- {$ENDIF}
- if (wkstep >= wklen) then break;
- Dec(xptr^, wkstep);
- Dec(ga);
- end;
- end
- else
- begin
- if (stx > 0) then
- begin
- // to the down
- wkstep := ((yptr^ or (mTileSize-1))+1)-yptr^;
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' down step: wklen=%d; wkstep=%d', [wklen, wkstep]);
- {$ENDIF}
- if (wkstep >= wklen) then break;
- Inc(yptr^, wkstep);
- Inc(ga, mWidth);
- end
- else
- begin
- // to the up
- wkstep := yptr^-((yptr^ and (not (mTileSize-1)))-1);
- {$IF DEFINED(D2F_DEBUG)}
- if dbgShowTraceLog then e_LogWritefln(' up step: wklen=%d; wkstep=%d', [wklen, wkstep]);
- {$ENDIF}
- if (wkstep >= wklen) then break;
- Dec(yptr^, wkstep);
- Dec(ga, mWidth);
- end;
- end;
- Dec(wklen, wkstep);
- end;
- // we can travel less than one cell
- if wasHit and not assigned(cb) then result := lastObj else begin ex := ax1; ey := ay1; end;
- mInQuery := false;
- exit;
- end;
- {$ENDIF}
-
- {$IF DEFINED(D2F_DEBUG_RAYTRACE)}
- if assigned(dbgRayTraceTileHitCB) then dbgRayTraceTileHitCB((xptr^ div mTileSize*mTileSize)+minx, (yptr^ div mTileSize*mTileSize)+miny);
- {$ENDIF}
-
- //e_LogWritefln('*********************', []);
- ccidx := -1;
- // can omit checks
- while (xd <> term) do
- begin
- // check cell(s)
- {$IF DEFINED(D2F_DEBUG)}
- if (xptr^ < 0) or (yptr^ < 0) or (xptr^ >= gw*mTileSize) and (yptr^ >= gh*mTileSize) then raise Exception.Create('raycaster internal error (0)');
- {$ENDIF}
- // new tile?
- ga := (yptr^ div mTileSize)*gw+(xptr^ div mTileSize);
- {$IF DEFINED(D2F_DEBUG_RAYTRACE)}
- if assigned(dbgRayTraceTileHitCB) then e_WriteLog(Format(' xd=%d; term=%d; gx=%d; gy=%d; ga=%d; lastga=%d', [xd, term, xptr^, yptr^, ga, lastGA]), MSG_NOTIFY);
- {$ENDIF}
- if (ga <> lastGA) then
- begin
- // yes
- {$IF DEFINED(D2F_DEBUG)}
- if assigned(dbgRayTraceTileHitCB) then dbgRayTraceTileHitCB((xptr^ div mTileSize*mTileSize)+minx, (yptr^ div mTileSize*mTileSize)+miny);
- {$ENDIF}
- if (ccidx <> -1) then
- begin
- // signal cell completion
- if assigned(cb) then
- begin
- if cb(nil, 0, xptr^+minx, yptr^+miny, prevx, prevy) then begin result := lastObj; mInQuery := false; exit; end;
- end
- else if wasHit then
- begin
- result := lastObj;
- mInQuery := false;
- exit;
- end;
- end;
- lastGA := ga;
- ccidx := mGrid[lastGA];
- end;
- // has something to process in this tile?
- if (ccidx <> -1) then
- begin
- // process cell
- curci := ccidx;
- hasUntried := false; // this will be set to `true` if we have some proxies we still want to process at the next step
- // convert coords to map (to avoid ajdusting coords inside the loop)
- x := xptr^+minx;
- y := yptr^+miny;
- // process cell list
- while (curci <> -1) do
- begin
- cc := @mCells[curci];
- for f := 0 to GridCellBucketSize-1 do
- begin
- if (cc.bodies[f] = -1) then break;
- px := @mProxies[cc.bodies[f]];
- ptag := px.mTag;
- if ((ptag and TagDisabled) = 0) and ((ptag and tagmask) <> 0) and (px.mQueryMark <> lq) then
- begin
- // can we process this proxy?
- if (x >= px.mX) and (y >= px.mY) and (x < px.mX+px.mWidth) and (y < px.mY+px.mHeight) then
- begin
- px.mQueryMark := lq; // mark as processed
- if assigned(cb) then
- begin
- if cb(px.mObj, ptag, x, y, prevx, prevy) then
- begin
- result := px.mObj;
- ex := prevx;
- ey := prevy;
- mInQuery := false;
- exit;
- end;
- end
- else
- begin
- // remember this hitpoint if it is nearer than an old one
- distSq := distanceSq(ax0, ay0, prevx, prevy);
- {$IF DEFINED(D2F_DEBUG_RAYTRACE)}
- if assigned(dbgRayTraceTileHitCB) then e_WriteLog(Format(' hit(%d): a=(%d,%d), h=(%d,%d), p=(%d,%d); distsq=%d; lastsq=%d', [cc.bodies[f], ax0, ay0, x, y, prevx, prevy, distSq, lastDistSq]), MSG_NOTIFY);
- {$ENDIF}
- if (distSq < lastDistSq) then
- begin
- wasHit := true;
- lastDistSq := distSq;
- ex := prevx;
- ey := prevy;
- lastObj := px.mObj;
- end;
- end;
- end
- else
- begin
- // this is possibly interesting proxy, set "has more to check" flag
- hasUntried := true;
- end;
- end;
- end;
- // next cell
- curci := cc.next;
- end;
- // still has something interesting in this cell?
- if not hasUntried then
- begin
- // nope, don't process this cell anymore; signal cell completion
- ccidx := -1;
- if assigned(cb) then
- begin
- if cb(nil, 0, x, y, prevx, prevy) then begin result := lastObj; mInQuery := false; exit; end;
- end
- else if wasHit then
- begin
- result := lastObj;
- mInQuery := false;
- exit;
- end;
- end;
- end;
- if (ccidx = -1) then
- begin
- // move to cell edge, as we have nothing to trace here anymore
- if (stx < 0) then xdist := xd and (not (mTileSize-1)) else xdist := xd or (mTileSize-1);
- if (sty < 0) then ydist := yd and (not (mTileSize-1)) else ydist := yd or (mTileSize-1);
- //e_LogWritefln('0: swapped=%d; xd=%d; yd=%d; stx=%d; sty=%d; e=%d; dx2=%d; dy2=%d; term=%d; xdist=%d; ydist=%d', [swapped, xd, yd, stx, sty, e, dx2, dy2, term, xdist, ydist]);
- while (xd <> xdist) and (yd <> ydist) do
- begin
- // step
- xd += stx;
- if (e >= 0) then begin yd += sty; e -= dx2; end else e += dy2;
- //e_LogWritefln(' xd=%d; yd=%d', [xd, yd]);
- if (xd = term) then break;
- end;
- //e_LogWritefln('1: swapped=%d; xd=%d; yd=%d; stx=%d; sty=%d; e=%d; dx2=%d; dy2=%d; term=%d; xdist=%d; ydist=%d', [swapped, xd, yd, stx, sty, e, dx2, dy2, term, xdist, ydist]);
- if (xd = term) then break;
- end;
- //putPixel(xptr^, yptr^);
- // move coords
- prevx := xptr^+minx;
- prevy := yptr^+miny;
- if (e >= 0) then begin yd += sty; e -= dx2; end else e += dy2;
- xd += stx;
- end;
- // we can travel less than one cell
- if wasHit and not assigned(cb) then
- begin
- result := lastObj;
- end
- else
- begin
- ex := ax1; // why not?
- ey := ay1; // why not?
- end;
-
- mInQuery := false;
end;