C++: Heap error

Damn, 10 seconds after I submitted my posting I have found the solution ;) I accidently read the array outside the valid boundaries. Guess I was just confused that the error occured at the allocation of new memory rather than during the wrong access of the array...

Further to that, have you considered what will happen if cullingLODDesc.patchSize == 0 somehow? :)

Also, have you considered not doing all the memory allocation work yourself, but instead using a smart container such as std::vector? And what exactly do you need this strange allocation pattern for, anyway?

Modern C++ code would look more like (never minding the question of why you need these specific amounts of allocated space :) )

struct LODIndexPair {  DWORD Std, Mod;};std::vector<std::vector<DWORD> > Patch::indicesLOD;UINT LODQuadCount = cullingLODDesc.patchSize - 1;UINT LODIndexCount = LODQuadCount * LODQuadCount * 6;for(UINT LOD = 0; LOD < LODCount; LOD++, LODIndexCount /= 4) {   Patch::indicesLOD.push_back(std::vector<DWORD>(LODIndexCount));}// The index counts are implicit; vectors know their own size.// Do you even need a separate LODCount? Do you perhaps just want to keep// going until the number of quads at that "level" is zero?

Quote:

Original post by Zahlman struct LODIndexPair { DWORD Std, Mod;};

Struct of arrays might actually be desirable in this case - it depends on actual algorithm.

While vector is one solution, it might actually be advantageous to not use them in this case (excluding the typical implementation bugs).

IMHO, if this is pre-calculation step and these structures will not change later (but geometry may be in use a lot), I would determine all array sizes in advance, then allocate a single array big enough to hold everything, then resolve the pointers into that array.

This however is a process which could be conveniently wrapped into a class to take care of not only the process, but also allocation issues.

It's also possible that a more optimal representation exists. For example, indicesLODStd and indicesLODMod contain identical values.

This is one of those problems where YMMV.

Quote:

Original post by Zahlman Further to that, have you considered what will happen if cullingLODDesc.patchSize == 0 somehow? :)

Yes. An assert will handle this case;)

Quote:

Also, have you considered not doing all the memory allocation work yourself, but instead using a smart container such as std::vector? And what exactly do you need this strange allocation pattern for, anyway?

Well yes, but I dont see many advantages of using STL containers so I prefer using simple pointers/arrays. Since I only read and write these arrays I have no use of the "advanced" operations provided by the STL containers. And to be honest I generally don't like the STL that much;)

If you had used a range check version of std::vector in debug mode, such as that provided by recent versions of MSVC, rather than using raw arrays in this case, it would have asserted when reading from the vector giving you a better idea of where the error in your code was.