99cb385f34
Pathfinding uses BHEAP_* (vector) operations from db.h, before this optimization each pathsearch resulted in an call to aMalloc() / aFree() which is quite costly as it fragments memory over time & may cause software stalls when the application's heap must be resized. Now it allocates the Heap once (& may grow it accordingly) and re-uses the allocated memory every time/call. This makes also tons of monsters less cpu-time intensive.
75 lines
2.4 KiB
C
75 lines
2.4 KiB
C
// Copyright (c) Athena Dev Teams - Licensed under GNU GPL
|
|
// For more information, see LICENCE in the main folder
|
|
|
|
#ifndef _PATH_H_
|
|
#define _PATH_H_
|
|
|
|
#include "map.h" // enum cell_chk
|
|
|
|
#define MOVE_COST 10
|
|
#define MOVE_DIAGONAL_COST 14
|
|
|
|
#define MAX_WALKPATH 32
|
|
|
|
struct walkpath_data {
|
|
unsigned char path_len,path_pos;
|
|
unsigned char path[MAX_WALKPATH];
|
|
};
|
|
|
|
struct shootpath_data {
|
|
int rx,ry,len;
|
|
int x[MAX_WALKPATH];
|
|
int y[MAX_WALKPATH];
|
|
};
|
|
|
|
enum directions{
|
|
DIR_CENTER = -1,
|
|
DIR_NORTH = 0,
|
|
DIR_NORTHWEST = 1,
|
|
DIR_WEST = 2,
|
|
DIR_SOUTHWEST = 3,
|
|
DIR_SOUTH = 4,
|
|
DIR_SOUTHEAST = 5,
|
|
DIR_EAST = 6,
|
|
DIR_NORTHEAST = 7,
|
|
DIR_MAX
|
|
};
|
|
|
|
#define check_distance_bl(bl1, bl2, distance) check_distance((bl1)->x - (bl2)->x, (bl1)->y - (bl2)->y, distance)
|
|
#define check_distance_blxy(bl, x1, y1, distance) check_distance((bl)->x-(x1), (bl)->y-(y1), distance)
|
|
#define check_distance_xy(x0, y0, x1, y1, distance) check_distance((x0)-(x1), (y0)-(y1), distance)
|
|
|
|
#define distance_bl(bl1, bl2) distance((bl1)->x - (bl2)->x, (bl1)->y - (bl2)->y)
|
|
#define distance_blxy(bl, x1, y1) distance((bl)->x-(x1), (bl)->y-(y1))
|
|
#define distance_xy(x0, y0, x1, y1) distance((x0)-(x1), (y0)-(y1))
|
|
|
|
#define check_distance_client_bl(bl1, bl2, distance) check_distance_client((bl1)->x - (bl2)->x, (bl1)->y - (bl2)->y, distance)
|
|
#define check_distance_client_blxy(bl, x1, y1, distance) check_distance_client((bl)->x-(x1), (bl)->y-(y1), distance)
|
|
#define check_distance_client_xy(x0, y0, x1, y1, distance) check_distance_client((x0)-(x1), (y0)-(y1), distance)
|
|
|
|
#define distance_client_bl(bl1, bl2) distance_client((bl1)->x - (bl2)->x, (bl1)->y - (bl2)->y)
|
|
#define distance_client_blxy(bl, x1, y1) distance_client((bl)->x-(x1), (bl)->y-(y1))
|
|
#define distance_client_xy(x0, y0, x1, y1) distance_client((x0)-(x1), (y0)-(y1))
|
|
|
|
// calculates destination cell for knockback
|
|
int path_blownpos(int16 m,int16 x0,int16 y0,int16 dx,int16 dy,int count);
|
|
|
|
// tries to find a walkable path
|
|
bool path_search(struct walkpath_data *wpd,int16 m,int16 x0,int16 y0,int16 x1,int16 y1,int flag,cell_chk cell);
|
|
|
|
// tries to find a shootable path
|
|
bool path_search_long(struct shootpath_data *spd,int16 m,int16 x0,int16 y0,int16 x1,int16 y1,cell_chk cell);
|
|
|
|
// distance related functions
|
|
bool check_distance(int dx, int dy, int distance);
|
|
unsigned int distance(int dx, int dy);
|
|
bool check_distance_client(int dx, int dy, int distance);
|
|
int distance_client(int dx, int dy);
|
|
|
|
//
|
|
void do_init_path();
|
|
void do_final_path();
|
|
|
|
|
|
#endif /* _PATH_H_ */
|