reHLDS/rehlds
2
0
Fork 0
mirror of https://github.com/rehlds/rehlds.git synced 2024-12-29 08:05:50 +03:00
Code Issues Projects Releases Wiki Activity

SV_RecursiveHullCheck: fix typo

Browse Source 
DELTA_TestDelta: reverse engineering mistake.
This commit is contained in:
s1lent 2017-05-04 04:28:06 +07:00
parent f48ddcfadd
commit 1f355d6a5b
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
rehlds/engine/delta.cpp
View File

@ -462,12 +462,12 @@ int DELTA_TestDelta(unsigned char *from, unsigned char *to, delta_t *pFields)
st2 = (char*)&to[pTest->fieldOffset]; st2 = (char*)&to[pTest->fieldOffset];
if (!(!*st1 && !*st2 || *st1 && *st2 && !Q_stricmp(st1, st2))) // Not sure why it is case insensitive, but it looks so if (!(!*st1 && !*st2 || *st1 && *st2 && !Q_stricmp(st1, st2))) // Not sure why it is case insensitive, but it looks so
{ {
#ifdef REHLDS_FIXES #ifndef REHLDS_FIXES
pTest->flags |= FDT_MARK;
#endif // REHLDS_FIXES
different = TRUE; different = TRUE;
length = Q_strlen(st2) * 8; length = Q_strlen(st2) * 8;
#else // REHLDS_FIXES
length = Q_strlen(st2);
#endif // REHLDS_FIXES
} }
break; break;
default: default:

4
rehlds/engine/world.cpp
View File

@ -854,7 +854,7 @@ qboolean SV_RecursiveHullCheck(hull_t *hull, int num, float p1f, float p2f, cons
if (midf < 0.0f) if (midf < 0.0f)
break; break;
frac = pdif * midf + p1f; frac = pdif * midf + p1f;
mid[0] = (p2[0] - p1[1]) * midf + p1[0]; mid[0] = (p2[0] - p1[0]) * midf + p1[0];
mid[1] = (p2[1] - p1[1]) * midf + p1[1]; mid[1] = (p2[1] - p1[1]) * midf + p1[1];
mid[2] = (p2[2] - p1[2]) * midf + p1[2]; mid[2] = (p2[2] - p1[2]) * midf + p1[2];
} }
@ -1008,7 +1008,7 @@ qboolean SV_RecursiveHullCheck(hull_t *hull, int num, float p1f, float p2f, cons
if (midf < 0.0f) if (midf < 0.0f)
break; break;
frac = pdif * midf + p1f; frac = pdif * midf + p1f;
mid[0] = (p2[0] - p1[1]) * midf + p1[0]; mid[0] = (p2[0] - p1[0]) * midf + p1[0];
mid[1] = (p2[1] - p1[1]) * midf + p1[1]; mid[1] = (p2[1] - p1[1]) * midf + p1[1];
mid[2] = (p2[2] - p1[2]) * midf + p1[2]; mid[2] = (p2[2] - p1[2]) * midf + p1[2];
} }