73 lines
1.6 KiB
C++
73 lines
1.6 KiB
C++
/*
|
|
* Backtrack.hpp
|
|
*
|
|
* Created on: May 15, 2018
|
|
* Author: bencat07
|
|
*/
|
|
|
|
#pragma once
|
|
#include "common.hpp"
|
|
#include <boost/circular_buffer.hpp>
|
|
|
|
namespace hacks::shared::backtrack
|
|
{
|
|
extern settings::Int latency;
|
|
extern settings::Boolean enable;
|
|
|
|
struct hitboxData
|
|
{
|
|
Vector center{ 0.0f, 0.0f, 0.0f };
|
|
Vector min{ 0.0f, 0.0f, 0.0f };
|
|
Vector max{ 0.0f, 0.0f, 0.0f };
|
|
};
|
|
|
|
struct BacktrackData
|
|
{
|
|
int tickcount{ 0 };
|
|
std::array<hitboxData, 18> hitboxes;
|
|
hitboxData collidable{};
|
|
float viewangles{ 0.0f };
|
|
float simtime{ 0.0f };
|
|
Vector entorigin{ 0.0f, 0.0f, 0.0f };
|
|
int index{ 0 };
|
|
matrix3x4_t bones[128]{};
|
|
};
|
|
struct BestTickData
|
|
{
|
|
int tickcount{ 0 };
|
|
int tick{ 0 };
|
|
bool operator<(const BestTickData &rhs) const
|
|
{
|
|
return tickcount < rhs.tickcount;
|
|
}
|
|
};
|
|
void Init();
|
|
void AddLatencyToNetchan(INetChannel *);
|
|
void UpdateIncomingSequences();
|
|
extern int lastincomingsequencenumber;
|
|
extern int BestTick;
|
|
extern int iBestTarget;
|
|
struct CIncomingSequence
|
|
{
|
|
CIncomingSequence(int instate, int seqnr, float time)
|
|
{
|
|
inreliablestate = instate;
|
|
sequencenr = seqnr;
|
|
curtime = time;
|
|
}
|
|
int inreliablestate;
|
|
int sequencenr;
|
|
float curtime;
|
|
};
|
|
typedef boost::circular_buffer_space_optimized<CIncomingSequence> circular_buf;
|
|
extern circular_buf sequences;
|
|
extern BacktrackData headPositions[33][66];
|
|
|
|
extern bool isBacktrackEnabled;
|
|
extern bool Vischeck_Success;
|
|
float getLatency();
|
|
float getRealLatency();
|
|
int getTicks();
|
|
bool ValidTick(BacktrackData &i, CachedEntity *ent);
|
|
} // namespace hacks::shared::backtrack
|