5fce286267
This changes the detail sampling to find height data by using the flood fill method for polygons that were merged because of a border vertex removal. This could potentially cause overlapping polygons to receive the same region IDs which would later make the fast-path sampling in getHeightData sample the wrong heights. Also includes optimizations for this path and getHeightData itself. Previously the seeding was responsible for 25% of the total time spent in getHeightData in these cases. We now use the direction and prefer moving directly towards the center of the polygon. This makes the overhead of seedArrayWithPolyCenter virtually nonexistent (~2% according to profiling). Fix #146
85 lines
2.6 KiB
C++
85 lines
2.6 KiB
C++
//
|
|
// Copyright (c) 2009-2010 Mikko Mononen memon@inside.org
|
|
//
|
|
// This software is provided 'as-is', without any express or implied
|
|
// warranty. In no event will the authors be held liable for any damages
|
|
// arising from the use of this software.
|
|
// Permission is granted to anyone to use this software for any purpose,
|
|
// including commercial applications, and to alter it and redistribute it
|
|
// freely, subject to the following restrictions:
|
|
// 1. The origin of this software must not be misrepresented; you must not
|
|
// claim that you wrote the original software. If you use this software
|
|
// in a product, an acknowledgment in the product documentation would be
|
|
// appreciated but is not required.
|
|
// 2. Altered source versions must be plainly marked as such, and must not be
|
|
// misrepresented as being the original software.
|
|
// 3. This notice may not be removed or altered from any source distribution.
|
|
//
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "RecastAlloc.h"
|
|
|
|
static void *rcAllocDefault(int size, rcAllocHint)
|
|
{
|
|
return malloc(size);
|
|
}
|
|
|
|
static void rcFreeDefault(void *ptr)
|
|
{
|
|
free(ptr);
|
|
}
|
|
|
|
static rcAllocFunc* sRecastAllocFunc = rcAllocDefault;
|
|
static rcFreeFunc* sRecastFreeFunc = rcFreeDefault;
|
|
|
|
/// @see rcAlloc, rcFree
|
|
void rcAllocSetCustom(rcAllocFunc *allocFunc, rcFreeFunc *freeFunc)
|
|
{
|
|
sRecastAllocFunc = allocFunc ? allocFunc : rcAllocDefault;
|
|
sRecastFreeFunc = freeFunc ? freeFunc : rcFreeDefault;
|
|
}
|
|
|
|
/// @see rcAllocSetCustom
|
|
void* rcAlloc(int size, rcAllocHint hint)
|
|
{
|
|
return sRecastAllocFunc(size, hint);
|
|
}
|
|
|
|
/// @par
|
|
///
|
|
/// @warning This function leaves the value of @p ptr unchanged. So it still
|
|
/// points to the same (now invalid) location, and not to null.
|
|
///
|
|
/// @see rcAllocSetCustom
|
|
void rcFree(void* ptr)
|
|
{
|
|
if (ptr)
|
|
sRecastFreeFunc(ptr);
|
|
}
|
|
|
|
/// @class rcIntArray
|
|
///
|
|
/// While it is possible to pre-allocate a specific array size during
|
|
/// construction or by using the #resize method, certain methods will
|
|
/// automatically resize the array as needed.
|
|
///
|
|
/// @warning The array memory is not initialized to zero when the size is
|
|
/// manually set during construction or when using #resize.
|
|
|
|
/// @par
|
|
///
|
|
/// Using this method ensures the array is at least large enough to hold
|
|
/// the specified number of elements. This can improve performance by
|
|
/// avoiding auto-resizing during use.
|
|
void rcIntArray::doResize(int n)
|
|
{
|
|
if (!m_cap) m_cap = n;
|
|
while (m_cap < n) m_cap *= 2;
|
|
int* newData = (int*)rcAlloc(m_cap*sizeof(int), RC_ALLOC_TEMP);
|
|
if (m_size && newData) memcpy(newData, m_data, m_size*sizeof(int));
|
|
rcFree(m_data);
|
|
m_data = newData;
|
|
}
|
|
|