/**
** Find new path.
**
** The destination could be a unit or a field.
** Range gives how far we must reach the goal.
**
** @note The destination could become negative coordinates!
**
** @param unit Path for this unit.
**
** @return >0 remaining path length, 0 wait for path, -1
** reached goal, -2 can't reach the goal.
*/
static int NewPath(PathFinderInput &input, PathFinderOutput &output)
{
char *path = output.Path;
int i = AStarFindPath(input.GetUnitPos(),
input.GetGoalPos(),
input.GetGoalSize().x, input.GetGoalSize().y,
input.GetUnitSize().x, input.GetUnitSize().y,
input.GetMinRange(), input.GetMaxRange(),
path, PathFinderOutput::MAX_PATH_LENGTH,
*input.GetUnit());
input.PathRacalculated();
if (i == PF_FAILED) {
i = PF_UNREACHABLE;
}
// Update path if it was requested. Otherwise we may only want
// to know if there exists a path.
if (path != NULL) {
output.Length = std::min<int>(i, PathFinderOutput::MAX_PATH_LENGTH);
if (output.Length == 0) {
++output.Length;
}
}
return i;
}
