1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372
|
/* This file is part of the Spring engine (GPL v2 or later), see LICENSE.html */
#include "LuaPathFinder.h"
#include "LuaInclude.h"
#include "LuaHandle.h"
#include "LuaUtils.h"
#include "Sim/Path/IPathManager.h"
#include "Sim/MoveTypes/MoveDefHandler.h"
#include <stdlib.h>
#include <algorithm>
#include <vector>
struct NodeCostOverlay {
NodeCostOverlay(): sizex(0), sizez(0) {}
void Init(unsigned int sx, unsigned int sz) {
costs.resize(sx * sz, 0.0f);
sizex = sx;
sizez = sz;
}
void Clear() { costs.clear(); }
bool Empty() const { return costs.empty(); }
unsigned int Size() const { return costs.size(); }
std::vector<float> costs;
unsigned int sizex;
unsigned int sizez;
};
static std::map<unsigned int, NodeCostOverlay> costArrayMapSynced;
static std::map<unsigned int, NodeCostOverlay> costArrayMapUnsynced;
static void CreatePathMetatable(lua_State* L);
/******************************************************************************/
/******************************************************************************/
bool LuaPathFinder::PushEntries(lua_State* L)
{
CreatePathMetatable(L);
#define REGISTER_LUA_CFUNC(x) \
lua_pushstring(L, #x); \
lua_pushcfunction(L, x); \
lua_rawset(L, -3)
REGISTER_LUA_CFUNC(RequestPath);
REGISTER_LUA_CFUNC(InitPathNodeCostsArray);
REGISTER_LUA_CFUNC(FreePathNodeCostsArray);
REGISTER_LUA_CFUNC(SetPathNodeCosts);
REGISTER_LUA_CFUNC(GetPathNodeCosts);
REGISTER_LUA_CFUNC(SetPathNodeCost);
REGISTER_LUA_CFUNC(GetPathNodeCost);
return true;
}
int LuaPathFinder::PushPathNodes(lua_State* L, const int pathID)
{
if (pathID == 0) {
return 0;
}
vector<float3> points;
vector<int> starts;
pathManager->GetPathWayPoints(pathID, points, starts);
const int pointCount = points.size();
const int startCount = starts.size();
{
lua_newtable(L);
for (int i = 0; i < pointCount; i++) {
lua_newtable(L); {
const float3& p = points[i];
lua_pushnumber(L, p.x); lua_rawseti(L, -2, 1);
lua_pushnumber(L, p.y); lua_rawseti(L, -2, 2);
lua_pushnumber(L, p.z); lua_rawseti(L, -2, 3);
}
lua_rawseti(L, -2, i + 1);
}
}
{
lua_newtable(L);
for (int i = 0; i < startCount; i++) {
lua_pushnumber(L, starts[i] + 1);
lua_rawseti(L, -2, i + 1);
}
}
return 2;
}
/******************************************************************************/
static int path_next(lua_State* L)
{
const int* idPtr = (int*)luaL_checkudata(L, 1, "Path");
const int pathID = *idPtr;
if (pathID == 0) {
return 0;
}
const int args = lua_gettop(L);
float3 callerPos = ZeroVector;
if (args >= 4) {
callerPos.x = luaL_checkfloat(L, 2);
callerPos.y = luaL_checkfloat(L, 3);
callerPos.z = luaL_checkfloat(L, 4);
}
const float minDist = luaL_optfloat(L, 5, 0.0f);
const bool synced = CLuaHandle::GetHandleSynced(L);
const float3 point = pathManager->NextWayPoint(NULL, pathID, 0, callerPos, minDist, synced);
if ((point.x == -1.0f) &&
(point.y == -1.0f) &&
(point.z == -1.0f)) {
return 0;
}
lua_pushnumber(L, point.x);
lua_pushnumber(L, point.y);
lua_pushnumber(L, point.z);
return 3;
}
static int path_nodes(lua_State* L)
{
const int* idPtr = (int*)luaL_checkudata(L, 1, "Path");
const int pathID = *idPtr;
return (LuaPathFinder::PushPathNodes(L, pathID));
}
static int path_index(lua_State* L)
{
const int* idPtr = (int*)luaL_checkudata(L, 1, "Path");
const int pathID = *idPtr;
if (pathID == 0) {
return 0;
}
const string key = luaL_checkstring(L, 2);
if (key == "Next") {
lua_pushcfunction(L, path_next);
return 1;
}
else if (key == "GetPathWayPoints") {
lua_pushcfunction(L, path_nodes);
return 1;
}
return 0;
}
static int path_newindex(lua_State* L)
{
return 0;
}
static int path_gc(lua_State* L)
{
int* idPtr = (int*)luaL_checkudata(L, 1, "Path");
const int pathID = *idPtr;
if (pathID == 0) {
return 0;
}
pathManager->DeletePath(*idPtr);
*idPtr = 0;
return 0;
}
static void CreatePathMetatable(lua_State* L)
{
luaL_newmetatable(L, "Path");
HSTR_PUSH_CFUNC(L, "__gc", path_gc);
HSTR_PUSH_CFUNC(L, "__index", path_index);
HSTR_PUSH_CFUNC(L, "__newindex", path_newindex);
lua_pop(L, 1);
}
/******************************************************************************/
/******************************************************************************/
int LuaPathFinder::RequestPath(lua_State* L)
{
const MoveDef* moveDef = NULL;
if (lua_israwstring(L, 1)) {
moveDef = moveDefHandler->GetMoveDefByName(lua_tostring(L, 1));
} else {
const unsigned int pathType = luaL_checkint(L, 1);
if (pathType >= moveDefHandler->GetNumMoveDefs()) {
luaL_error(L, "Invalid moveID passed to RequestPath");
}
moveDef = moveDefHandler->GetMoveDefByPathType(pathType);
}
if (moveDef == NULL) {
return 0;
}
const float3 start(luaL_checkfloat(L, 2),
luaL_checkfloat(L, 3),
luaL_checkfloat(L, 4));
const float3 end(luaL_checkfloat(L, 5),
luaL_checkfloat(L, 6),
luaL_checkfloat(L, 7));
const float radius = luaL_optfloat(L, 8, 8.0f);
const bool synced = CLuaHandle::GetHandleSynced(L);
const int pathID = pathManager->RequestPath(NULL, moveDef, start, end, radius, synced);
if (pathID == 0) {
return 0;
}
int* idPtr = (int*)lua_newuserdata(L, sizeof(int));
luaL_getmetatable(L, "Path");
lua_setmetatable(L, -2);
*idPtr = pathID;
return 1;
}
int LuaPathFinder::InitPathNodeCostsArray(lua_State* L)
{
const unsigned int array = luaL_checkint(L, 1);
const unsigned int sizex = luaL_checkint(L, 2);
const unsigned int sizez = luaL_checkint(L, 3);
const bool synced = CLuaHandle::GetHandleSynced(L);
std::map<unsigned int, NodeCostOverlay>& map = synced?
costArrayMapSynced:
costArrayMapUnsynced;
NodeCostOverlay& overlay = map[array];
if (sizex == 0 || sizez == 0) {
lua_pushboolean(L, false);
return 1;
}
if (!overlay.Empty()) {
// no resizing of existing overlays
lua_pushboolean(L, false);
return 1;
}
overlay.Init(sizex, sizez);
lua_pushboolean(L, true);
return 1;
}
int LuaPathFinder::FreePathNodeCostsArray(lua_State* L)
{
const unsigned int array = luaL_checkint(L, 1);
const bool synced = CLuaHandle::GetHandleSynced(L);
std::map<unsigned int, NodeCostOverlay>& map = synced?
costArrayMapSynced:
costArrayMapUnsynced;
NodeCostOverlay& overlay = map[array];
if (overlay.Empty()) {
// not an existing overlay
lua_pushboolean(L, false);
return 1;
}
// nullify the active cost-overlay if we are freeing it
if (pathManager->GetNodeExtraCosts(synced) == &overlay.costs[0]) {
pathManager->SetNodeExtraCosts(NULL, 1, 1, synced);
}
overlay.Clear();
map.erase(array);
lua_pushboolean(L, true);
return 1;
}
int LuaPathFinder::SetPathNodeCosts(lua_State* L)
{
const unsigned int array = luaL_checkint(L, 1);
const bool synced = CLuaHandle::GetHandleSynced(L);
std::map<unsigned int, NodeCostOverlay>& map = synced?
costArrayMapSynced:
costArrayMapUnsynced;
NodeCostOverlay& overlay = map[array];
if (overlay.Empty()) {
lua_pushboolean(L, false);
return 1;
}
// set the active cost-overlay to <overlay>
lua_pushboolean(L, pathManager->SetNodeExtraCosts(&overlay.costs[0], overlay.sizex, overlay.sizez, synced));
return 1;
}
int LuaPathFinder::GetPathNodeCosts(lua_State* L)
{
// not implemented
return 0;
}
int LuaPathFinder::SetPathNodeCost(lua_State* L)
{
const unsigned int array = luaL_checkint(L, 1);
const unsigned int index = luaL_checkint(L, 2);
const float cost = luaL_checkfloat(L, 3);
const bool synced = CLuaHandle::GetHandleSynced(L);
std::map<unsigned int, NodeCostOverlay>& map = synced?
costArrayMapSynced:
costArrayMapUnsynced;
NodeCostOverlay& overlay = map[array];
if (overlay.Empty()) {
// invalid array ID (possibly created through map::operator[]), fallback
// lua_pushboolean(L, pathManager->SetNodeExtraCost(hmx, hmz, cost, synced));
lua_pushboolean(L, false);
} else {
// modify only the cost-overlay (whether it is active or not)
if (index < overlay.Size())
overlay.costs[index] = cost;
lua_pushboolean(L, (index < overlay.Size()));
}
return 1;
}
int LuaPathFinder::GetPathNodeCost(lua_State* L)
{
const unsigned int hmx = luaL_checkint(L, 1);
const unsigned int hmz = luaL_checkint(L, 2);
const bool synced = CLuaHandle::GetHandleSynced(L);
// reads from overlay if PathNodeStateBuffer::extraCosts != NULL
const float cost = pathManager->GetNodeExtraCost(hmx, hmz, synced);
lua_pushnumber(L, cost);
return 1;
}
/******************************************************************************/
/******************************************************************************/
|