devxlogo

Avoid Pointer Derefencing Hell with Performance Applied Programming

Avoid Pointer Derefencing Hell with Performance Applied Programming

Have you ever had code like this?

for ( int i = 0 ; i < m_iNumElements ; i++ ){   m_fVector[i] = m_pcFrustum->m_psViewProj->m_psProjection->m_someArray[i];{

This can be very frustrating. For every iteration, the long deferencing will commence. This can be easily optimized to produce more efficient code, like this:

float* pmatProjection = m_pcFrustum->m_psViewProj->m_psProjection->m_someArray;for ( int i = 0 ; i < m_iNumElements ; ++i ){   m_fVector[i] = pmatProjection[i];}

Even better, if it's applicable, you can add this as this is a linear, incremental loop:

float* pmatProjection = m_pcFrustum->m_psViewProj->m_psProjection->m_someArray;for ( int i = 0 ; i < m_iNumElements ; ++i, ++pmatProjection ){   m_fVector[i] = *pmatProjection;}
See also  How to Create and Deploy QR Codes Online: A Comprehensive Guide
devxblackblue

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist