| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434 | //-----------------------------------------------------------------------------// Copyright (c) 2012 GarageGames, LLC//// Permission is hereby granted, free of charge, to any person obtaining a copy// of this software and associated documentation files (the "Software"), to// deal in the Software without restriction, including without limitation the// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or// sell copies of the Software, and to permit persons to whom the Software is// furnished to do so, subject to the following conditions://// The above copyright notice and this permission notice shall be included in// all copies or substantial portions of the Software.//// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS// IN THE SOFTWARE.//-----------------------------------------------------------------------------#include "gfx/gfxDevice.h"#include "scene/pathManager.h"#include "sim/netConnection.h"#include "core/stream/bitStream.h"#include "scene/simPath.h"#include "math/mathIO.h"#include "scene/sceneRenderState.h"#include "scene/sceneManager.h"#include "platform/profiler.h"#include "core/module.h"#include "console/engineAPI.h"extern bool gEditingMission;namespace {U32 countNumBits(U32 n){   U32 count = 0;   while (n != 0) {      n >>= 1;      count++;   }   return count ? count : 1;}} // namespace {}MODULE_BEGIN( PathManager )   MODULE_INIT   {      AssertFatal(gClientPathManager == NULL && gServerPathManager == NULL, "Error, already initialized the path manager!");      gClientPathManager = new PathManager(false);      gServerPathManager = new PathManager(true);   }   MODULE_SHUTDOWN   {      AssertFatal(gClientPathManager != NULL && gServerPathManager != NULL, "Error, path manager not initialized!");      delete gClientPathManager;      gClientPathManager = NULL;      delete gServerPathManager;      gServerPathManager = NULL;   }MODULE_END;//--------------------------------------------------------------------------//-------------------------------------- PathManagerEvent//class PathManagerEvent : public NetEvent{  public:   U32  modifiedPath;   bool clearPaths;   PathManager::PathEntry path;  public:   typedef NetEvent Parent;   PathManagerEvent() : modifiedPath(0), clearPaths(false) { }   void pack(NetConnection*, BitStream*);   void write(NetConnection*, BitStream*);   void unpack(NetConnection*, BitStream*);   void process(NetConnection*);   DECLARE_CONOBJECT(PathManagerEvent);};void PathManagerEvent::pack(NetConnection*, BitStream* stream){   // Write out the modified path...   stream->write(modifiedPath);   stream->writeFlag(clearPaths);   stream->write(path.totalTime);   stream->write(path.positions.size());   // This is here for safety. You can remove it if you want to try your luck at bigger sizes. -- BJG   AssertWarn(path.positions.size() < 1500/40, "Warning! Path size is pretty big - may cause packet overrun!");   // Each one of these is about 8 floats and 2 ints   // so we'll say it's about 40 bytes in size, which is where the 40 in the above calc comes from.   for (U32 j = 0; j < path.positions.size(); j++)   {      mathWrite(*stream, path.positions[j]);      mathWrite(*stream, path.rotations[j]);      stream->write(path.msToNext[j]);      stream->write(path.smoothingType[j]);   }}void PathManagerEvent::write(NetConnection*nc, BitStream *stream){   pack(nc, stream);}void PathManagerEvent::unpack(NetConnection*, BitStream* stream){   // Read in the modified path...   stream->read(&modifiedPath);   clearPaths = stream->readFlag();   stream->read(&path.totalTime);   U32 numPoints;   stream->read(&numPoints);   path.positions.setSize(numPoints);   path.rotations.setSize(numPoints);   path.msToNext.setSize(numPoints);   path.smoothingType.setSize(numPoints);   for (U32 j = 0; j < path.positions.size(); j++)   {      mathRead(*stream, &path.positions[j]);      mathRead(*stream, &path.rotations[j]);      stream->read(&path.msToNext[j]);      stream->read(&path.smoothingType[j]);   }}void PathManagerEvent::process(NetConnection*){   if (clearPaths)   {      // Clear out all the client's paths...      gClientPathManager->clearPaths();   }   AssertFatal(modifiedPath <= gClientPathManager->mPaths.size(), "Error out of bounds path!");   if (modifiedPath == gClientPathManager->mPaths.size()) {      PathManager::PathEntry *pe = new PathManager::PathEntry;      *pe = path;      gClientPathManager->mPaths.push_back(pe);   }   else      *(gClientPathManager->mPaths[modifiedPath]) = path;}IMPLEMENT_CO_NETEVENT_V1(PathManagerEvent);// Will be internalized once the @internal tag is workingConsoleDocClass( PathManagerEvent,   "@brief Class responsible for the registration, transmission, and management "   "of paths on client and server.\n\n"   "For internal use only, not intended for use in TorqueScript or game development\n\n"   "@internal\n");//--------------------------------------------------------------------------//-------------------------------------- PathManager Implementation//PathManager* gClientPathManager = NULL;PathManager* gServerPathManager = NULL;//--------------------------------------------------------------------------PathManager::PathManager(const bool isServer){   VECTOR_SET_ASSOCIATION(mPaths);   mIsServer  = isServer;}PathManager::~PathManager(){   clearPaths();}void PathManager::clearPaths(){   for (U32 i = 0; i < mPaths.size(); i++)      delete mPaths[i];   mPaths.setSize(0);#ifdef TORQUE_DEBUG   // This gets rid of the memory used by the vector.   // Prevents it from showing up in memory leak logs.   mPaths.compact();#endif}DefineConsoleFunction( clearServerPaths, void, ( ), , ""){   gServerPathManager->clearPaths();}DefineConsoleFunction( clearClientPaths, void, ( ), , ""){   gClientPathManager->clearPaths();}//--------------------------------------------------------------------------U32 PathManager::allocatePathId(){   mPaths.increment();   mPaths.last() = new PathEntry;   return (mPaths.size() - 1);}void PathManager::updatePath(const U32              id,                             const Vector<Point3F>& positions,                             const Vector<QuatF>&   rotations,                             const Vector<U32>&     times,                             const Vector<U32>&     smoothingTypes){   AssertFatal(mIsServer == true, "PathManager::updatePath: Error, must be called on the server side");   AssertFatal(id < mPaths.size(), "PathManager::updatePath: error, id out of range");   AssertFatal(positions.size() == times.size() && positions.size() == smoothingTypes.size(), "Error, times and positions must match!");   PathEntry& rEntry = *mPaths[id];   rEntry.positions = positions;   rEntry.rotations = rotations;   rEntry.msToNext  = times;   rEntry.smoothingType = smoothingTypes;   rEntry.totalTime = 0;   for (S32 i = 0; i < S32(rEntry.msToNext.size()); i++)      rEntry.totalTime += rEntry.msToNext[i];   transmitPath(id);}//--------------------------------------------------------------------------void PathManager::transmitPaths(NetConnection* nc){   AssertFatal(mIsServer, "Error, cannot call transmitPaths on client path manager!");   // Send over paths   for(S32 i = 0; i < mPaths.size(); i++)   {      PathManagerEvent* event = new PathManagerEvent;      event->clearPaths       = (i == 0);      event->modifiedPath = i;      event->path = *(mPaths[i]);      nc->postNetEvent(event);   }}void PathManager::transmitPath(const U32 id){   AssertFatal(mIsServer, "Error, cannot call transmitNewPath on client path manager!");   // Post to all active clients that have already received their paths...   //   SimGroup* pClientGroup = Sim::getClientGroup();   for (SimGroup::iterator itr = pClientGroup->begin(); itr != pClientGroup->end(); itr++) {      NetConnection* nc = dynamic_cast<NetConnection*>(*itr);      if (nc && nc->missionPathsSent())      {         // Transmit the updated path...         PathManagerEvent* event = new PathManagerEvent;         event->modifiedPath     = id;         event->clearPaths       = false;         event->path             = *(mPaths[id]);         nc->postNetEvent(event);      }   }}void PathManager::getPathPosition(const U32 id,                                  const F64 msPosition,                                  Point3F&  rPosition,                                  QuatF &rotation){   AssertFatal(isValidPath(id), "Error, this is not a valid path!");   PROFILE_START(PathManGetPos);   // Ok, query holds our path information...   F64 ms = msPosition;   if (ms > mPaths[id]->totalTime)      ms = mPaths[id]->totalTime;   S32 startNode = 0;   while (ms > mPaths[id]->msToNext[startNode]) {      ms -= mPaths[id]->msToNext[startNode];      startNode++;   }   S32 endNode = (startNode + 1) % mPaths[id]->positions.size();   Point3F& rStart = mPaths[id]->positions[startNode];   Point3F& rEnd   = mPaths[id]->positions[endNode];   F64 interp = ms / F32(mPaths[id]->msToNext[startNode]);   if(mPaths[id]->smoothingType[startNode] == Marker::SmoothingTypeLinear)   {      rPosition = (rStart * (1.0 - interp)) + (rEnd * interp);   }   else if(mPaths[id]->smoothingType[startNode] == Marker::SmoothingTypeAccelerate)   {      interp = mSin(interp * M_PI - (M_PI / 2)) * 0.5 + 0.5;      rPosition = (rStart * (1.0 - interp)) + (rEnd * interp);   }   else if(mPaths[id]->smoothingType[startNode] == Marker::SmoothingTypeSpline)   {      S32 preStart = startNode - 1;      S32 postEnd = endNode + 1;      if(postEnd >= mPaths[id]->positions.size())         postEnd = 0;      if(preStart < 0)         preStart = mPaths[id]->positions.size() - 1;      Point3F p0 = mPaths[id]->positions[preStart];      Point3F p1 = rStart;      Point3F p2 = rEnd;      Point3F p3 = mPaths[id]->positions[postEnd];      rPosition.x = mCatmullrom(interp, p0.x, p1.x, p2.x, p3.x);      rPosition.y = mCatmullrom(interp, p0.y, p1.y, p2.y, p3.y);      rPosition.z = mCatmullrom(interp, p0.z, p1.z, p2.z, p3.z);   }   rotation.interpolate( mPaths[id]->rotations[startNode], mPaths[id]->rotations[endNode], interp );   PROFILE_END();}U32 PathManager::getPathTotalTime(const U32 id) const{   AssertFatal(isValidPath(id), "Error, this is not a valid path!");   return mPaths[id]->totalTime;}U32 PathManager::getPathNumWaypoints(const U32 id) const{   AssertFatal(isValidPath(id), "Error, this is not a valid path!");   return mPaths[id]->positions.size();}U32 PathManager::getWaypointTime(const U32 id, const U32 wayPoint) const{   AssertFatal(isValidPath(id), "Error, this is not a valid path!");   AssertFatal(wayPoint < getPathNumWaypoints(id), "Invalid waypoint!");   U32 time = 0;   for (U32 i = 0; i < wayPoint; i++)      time += mPaths[id]->msToNext[i];   return time;}U32 PathManager::getPathTimeBits(const U32 id){   AssertFatal(isValidPath(id), "Error, this is not a valid path!");   return countNumBits(mPaths[id]->totalTime);}U32 PathManager::getPathWaypointBits(const U32 id){   AssertFatal(isValidPath(id), "Error, this is not a valid path!");   return countNumBits(mPaths[id]->positions.size());}bool PathManager::dumpState(BitStream* stream) const{   stream->write(mPaths.size());   for (U32 i = 0; i < mPaths.size(); i++) {      const PathEntry& rEntry = *mPaths[i];      stream->write(rEntry.totalTime);      stream->write(rEntry.positions.size());      for (U32 j = 0; j < rEntry.positions.size(); j++) {         mathWrite(*stream, rEntry.positions[j]);         stream->write(rEntry.msToNext[j]);      }   }   return stream->getStatus() == Stream::Ok;}bool PathManager::readState(BitStream* stream){   U32 i;   for (i = 0; i < mPaths.size(); i++)      delete mPaths[i];   U32 numPaths;   stream->read(&numPaths);   mPaths.setSize(numPaths);   for (i = 0; i < mPaths.size(); i++) {      mPaths[i] = new PathEntry;      PathEntry& rEntry = *mPaths[i];      stream->read(&rEntry.totalTime);      U32 numPositions;      stream->read(&numPositions);      rEntry.positions.setSize(numPositions);      rEntry.msToNext.setSize(numPositions);      for (U32 j = 0; j < rEntry.positions.size(); j++) {         mathRead(*stream, &rEntry.positions[j]);         stream->read(&rEntry.msToNext[j]);      }   }   return stream->getStatus() == Stream::Ok;}
 |