summaryrefslogtreecommitdiff
path: root/src/map/path.c
diff options
context:
space:
mode:
authorHaruna <haru@dotalux.com>2015-09-12 19:55:55 +0200
committerHaruna <haru@dotalux.com>2015-09-12 19:55:55 +0200
commit41ba7b50888610d43dcf3bcccb77ee3debe13532 (patch)
tree8abd38674459f4c53a077684521ec9de883d7782 /src/map/path.c
parentd8caa7c8e7296a87072b6775902b985a1faebadf (diff)
parent23f06359b540d369eff74d5454d2fe58b38b9630 (diff)
downloadhercules-41ba7b50888610d43dcf3bcccb77ee3debe13532.tar.gz
hercules-41ba7b50888610d43dcf3bcccb77ee3debe13532.tar.bz2
hercules-41ba7b50888610d43dcf3bcccb77ee3debe13532.tar.xz
hercules-41ba7b50888610d43dcf3bcccb77ee3debe13532.zip
Merge pull request #713 from 4144/pathext
Add to path search functions source bl for plugins usage.
Diffstat (limited to 'src/map/path.c')
-rw-r--r--src/map/path.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/map/path.c b/src/map/path.c
index 723fd8e8f..d56994fb4 100644
--- a/src/map/path.c
+++ b/src/map/path.c
@@ -69,7 +69,7 @@ static const unsigned char walk_choices [3][3] =
* Find the closest reachable cell, 'count' cells away from (x0,y0) in direction (dx,dy).
* Income after the coordinates of the blow
*------------------------------------------*/
-int path_blownpos(int16 m,int16 x0,int16 y0,int16 dx,int16 dy,int count)
+int path_blownpos(struct block_list *bl, int16 m,int16 x0,int16 y0,int16 dx,int16 dy,int count)
{
struct map_data *md;
@@ -102,7 +102,7 @@ int path_blownpos(int16 m,int16 x0,int16 y0,int16 dx,int16 dy,int count)
/*==========================================
* is ranged attack from (x0,y0) to (x1,y1) possible?
*------------------------------------------*/
-bool path_search_long(struct shootpath_data *spd,int16 m,int16 x0,int16 y0,int16 x1,int16 y1,cell_chk cell)
+bool path_search_long(struct shootpath_data *spd,struct block_list *bl,int16 m,int16 x0,int16 y0,int16 x1,int16 y1,cell_chk cell)
{
int dx, dy;
int wx = 0, wy = 0;
@@ -236,7 +236,7 @@ static int add_path(struct node_heap *heap, struct path_node *tp, int16 x, int16
* flag: &1 = easy path search only
* cell: type of obstruction to check for
*------------------------------------------*/
-bool path_search(struct walkpath_data *wpd, int16 m, int16 x0, int16 y0, int16 x1, int16 y1, int flag, cell_chk cell)
+bool path_search(struct walkpath_data *wpd, struct block_list *bl, int16 m, int16 x0, int16 y0, int16 x1, int16 y1, int flag, cell_chk cell)
{
register int i, j, x, y, dx, dy;
struct map_data *md;