Valve/source-sdk-2013
1
0
Fork 0
mirror of https://github.com/ValveSoftware/source-sdk-2013.git synced 2025-01-16 08:48:01 +03:00
Code Issues Packages Projects Releases Wiki Activity

Commented out false sharing debug counters

Browse Source
This commit is contained in:
deadhand 2017-10-03 08:42:18 -04:00
parent 0d8dceea43
commit 9b60581aa3
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
mp/src/raytrace/raytrace.cpp
View File

@ -233,7 +233,7 @@ void CacheOptimizedTriangle::ChangeIntoIntersectionFormat(void)
} }
int n_intersection_calculations=0; //int n_intersection_calculations=0;
int CacheOptimizedTriangle::ClassifyAgainstAxisSplit(int split_plane, float split_value) int CacheOptimizedTriangle::ClassifyAgainstAxisSplit(int split_plane, float split_value)
{ {
@ -476,7 +476,7 @@ void RayTracingEnvironment::Trace4Rays(const FourRays &rays, fltx4 TMin, fltx4 T
TriIntersectData_t const *tri = &( OptimizedTriangleList[tnum].m_Data.m_IntersectData ); TriIntersectData_t const *tri = &( OptimizedTriangleList[tnum].m_Data.m_IntersectData );
if ( ( mailboxids[mbox_slot] != tnum ) && ( tri->m_nTriangleID != skip_id ) ) if ( ( mailboxids[mbox_slot] != tnum ) && ( tri->m_nTriangleID != skip_id ) )
{ {
n_intersection_calculations++; //n_intersection_calculations++;
mailboxids[mbox_slot] = tnum; mailboxids[mbox_slot] = tnum;
// compute plane intersection // compute plane intersection

4
sp/src/raytrace/raytrace.cpp
View File

@ -233,7 +233,7 @@ void CacheOptimizedTriangle::ChangeIntoIntersectionFormat(void)
} }
int n_intersection_calculations=0; //int n_intersection_calculations=0;
int CacheOptimizedTriangle::ClassifyAgainstAxisSplit(int split_plane, float split_value) int CacheOptimizedTriangle::ClassifyAgainstAxisSplit(int split_plane, float split_value)
{ {
@ -476,7 +476,7 @@ void RayTracingEnvironment::Trace4Rays(const FourRays &rays, fltx4 TMin, fltx4 T
TriIntersectData_t const *tri = &( OptimizedTriangleList[tnum].m_Data.m_IntersectData ); TriIntersectData_t const *tri = &( OptimizedTriangleList[tnum].m_Data.m_IntersectData );
if ( ( mailboxids[mbox_slot] != tnum ) && ( tri->m_nTriangleID != skip_id ) ) if ( ( mailboxids[mbox_slot] != tnum ) && ( tri->m_nTriangleID != skip_id ) )
{ {
n_intersection_calculations++; //n_intersection_calculations++;
mailboxids[mbox_slot] = tnum; mailboxids[mbox_slot] = tnum;
// compute plane intersection // compute plane intersection