gl_vertex_list.cpp File Reference

#include "gfxlib_struct.h"
#include "vegastrike.h"
#include "vs_globals.h"
#include "vsfilesystem.h"
#include <assert.h>
#include "gl_globals.h"
#include "gnuhash.h"
#include <map>

Go to the source code of this file.

Classes
struct	VertexCompare

Functions
void	GFXOptimizeList (GFXVertex *old, int numV, GFXVertex **nw, int *nnewV, unsigned int **ind)
	Optimizes a list to reuse repeated vertices! More...

Variables
GFXVertexList *	next

Function Documentation

void GFXOptimizeList	(	GFXVertex *	old,
		int	numV,
		GFXVertex **	nw,
		int *	nnewV,
		unsigned int **	ind
	)

Optimizes a list to reuse repeated vertices!

Definition at line 68 of file gl_vertex_list.cpp.

References i, VsnetOSS::memcpy(), and VSFileSystem::vs_dprintf().

Referenced by Mesh::PostProcessLoading().

{
    std::map< GFXVertex*, int, VertexCompare >vtxcache;
    
    *ind   = (unsigned int*) malloc( sizeof (unsigned int)*numV );
    *nw    = (GFXVertex*) malloc( numV*sizeof (GFXVertex) );
    int _nnewV = *nnewV = 0;
    int i;
    bool quickpath = true;
    for (i = 0; i < numV; i++) {
        std::map< GFXVertex*, int, VertexCompare >::const_iterator it = vtxcache.find( old+i );
        if ( it != vtxcache.end() ) {
            if (quickpath && i > 0) {
                quickpath = false;
                memcpy( *nw, old, sizeof(GFXVertex)*size_t(i) );
            }
            (*ind)[i] = it->second;
        } else {
            if (!quickpath)
                memcpy( (*nw)+_nnewV, old+i, sizeof (GFXVertex) );
            vtxcache[old+i] = ( (*ind)[i] ) = _nnewV;
            ++_nnewV;
        }
    }
    if (quickpath && i > 0)
        memcpy( *nw, old, sizeof(GFXVertex)*size_t(i) );
    *nnewV = _nnewV;
    
    VSFileSystem::vs_dprintf(3, "Optimized vertex list - vertices: %d -> %d\n", numV, *nnewV);
}

Variable Documentation

GFXVertexList* next

Definition at line 41 of file gl_vertex_list.cpp.

Referenced by commandI::fexecute(), and NavigationSystem::ParseFile().