1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/OptimizeMeshes.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,182 @@
     1.4 +/*
     1.5 +Open Asset Import Library (assimp)
     1.6 +----------------------------------------------------------------------
     1.7 +
     1.8 +Copyright (c) 2006-2012, assimp team
     1.9 +All rights reserved.
    1.10 +
    1.11 +Redistribution and use of this software in source and binary forms, 
    1.12 +with or without modification, are permitted provided that the 
    1.13 +following conditions are met:
    1.14 +
    1.15 +* Redistributions of source code must retain the above
    1.16 +  copyright notice, this list of conditions and the
    1.17 +  following disclaimer.
    1.18 +
    1.19 +* Redistributions in binary form must reproduce the above
    1.20 +  copyright notice, this list of conditions and the
    1.21 +  following disclaimer in the documentation and/or other
    1.22 +  materials provided with the distribution.
    1.23 +
    1.24 +* Neither the name of the assimp team, nor the names of its
    1.25 +  contributors may be used to endorse or promote products
    1.26 +  derived from this software without specific prior
    1.27 +  written permission of the assimp team.
    1.28 +
    1.29 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
    1.30 +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 
    1.31 +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
    1.32 +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
    1.33 +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    1.34 +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
    1.35 +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    1.36 +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
    1.37 +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
    1.38 +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
    1.39 +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    1.40 +
    1.41 +----------------------------------------------------------------------
    1.42 +*/
    1.43 +
    1.44 +/** @file  OptimizeMeshes.h
    1.45 + *  @brief Declares a post processing step to join meshes, if possible 
    1.46 + */
    1.47 +#ifndef AI_OPTIMIZEMESHESPROCESS_H_INC
    1.48 +#define AI_OPTIMIZEMESHESPROCESS_H_INC
    1.49 +
    1.50 +#include "BaseProcess.h"
    1.51 +#include "assimp/types.h"
    1.52 +
    1.53 +struct aiMesh;
    1.54 +class OptimizeMeshesProcessTest;
    1.55 +namespace Assimp	{
    1.56 +
    1.57 +// ---------------------------------------------------------------------------
    1.58 +/** @brief Postprocessing step to optimize mesh usage
    1.59 + *
    1.60 + *  The implementation looks for meshes that could be joined and joins them.
    1.61 + *  Usually this will reduce the number of drawcalls.
    1.62 + *
    1.63 + *  @note Instanced meshes are currently not processed.
    1.64 + */
    1.65 +class OptimizeMeshesProcess : public BaseProcess
    1.66 +{
    1.67 +public:
    1.68 +
    1.69 +	OptimizeMeshesProcess();
    1.70 +	~OptimizeMeshesProcess();
    1.71 +
    1.72 +
    1.73 +	/** @brief Internal utility to store additional mesh info
    1.74 +	 */
    1.75 +	struct MeshInfo
    1.76 +	{
    1.77 +		MeshInfo()
    1.78 +			:	instance_cnt  (0)
    1.79 +			,	vertex_format (0)
    1.80 +			,	output_id	  (0xffffffff)
    1.81 +		{}
    1.82 +
    1.83 +		//! Number of times this mesh is referenced
    1.84 +		unsigned int instance_cnt;
    1.85 +
    1.86 +		//! Vertex format id
    1.87 +		unsigned int vertex_format;
    1.88 +
    1.89 +		//! Output ID
    1.90 +		unsigned int output_id;
    1.91 +	};
    1.92 +
    1.93 +public:
    1.94 +	// -------------------------------------------------------------------
    1.95 +	bool IsActive( unsigned int pFlags) const;
    1.96 +
    1.97 +	// -------------------------------------------------------------------
    1.98 +	void Execute( aiScene* pScene);
    1.99 +	
   1.100 +	// -------------------------------------------------------------------
   1.101 +	void SetupProperties(const Importer* pImp);
   1.102 +
   1.103 +
   1.104 +	// -------------------------------------------------------------------
   1.105 +	/** @brief Specify whether you want meshes with different 
   1.106 +	 *   primitive types to be merged as well.
   1.107 +	 *
   1.108 +	 *  IsActive() sets this property automatically to true if the
   1.109 +	 *  aiProcess_SortByPType flag is found.
   1.110 +	 */
   1.111 +	void EnablePrimitiveTypeSorting(bool enable) {
   1.112 +		pts = enable;
   1.113 +	}
   1.114 +
   1.115 +	// Getter 
   1.116 +	bool IsPrimitiveTypeSortingEnabled () const {
   1.117 +		return pts;
   1.118 +	}
   1.119 +
   1.120 +
   1.121 +	// -------------------------------------------------------------------
   1.122 +	/** @brief Specify a maximum size of a single output mesh.
   1.123 +	 *  
   1.124 +	 *  If a single input mesh already exceeds this limit, it won't
   1.125 +	 *  be split.
   1.126 +	 *  @param verts Maximum number of vertices per mesh
   1.127 +	 *  @param faces Maximum number of faces per mesh
   1.128 +	 */
   1.129 +	void SetPreferredMeshSizeLimit (unsigned int verts, unsigned int faces)
   1.130 +	{
   1.131 +		max_verts = verts;
   1.132 +		max_faces = faces;
   1.133 +	}
   1.134 +
   1.135 +
   1.136 +protected:
   1.137 +
   1.138 +	// -------------------------------------------------------------------
   1.139 +	/** @brief Do the actual optimization on all meshes of this node
   1.140 +	 *  @param pNode Node we're working with
   1.141 +	 */
   1.142 +	void ProcessNode( aiNode* pNode);
   1.143 +
   1.144 +	// -------------------------------------------------------------------
   1.145 +	/** @brief Returns true if b can be joined with a
   1.146 +	 *
   1.147 +	 *  @param verts Number of output verts up to now
   1.148 +	 *  @param faces Number of output faces up to now
   1.149 +	 */
   1.150 +	bool CanJoin ( unsigned int a, unsigned int b,
   1.151 +		unsigned int verts, unsigned int faces );
   1.152 +
   1.153 +	// -------------------------------------------------------------------
   1.154 +	/** @brief Find instanced meshes, for the moment we're excluding
   1.155 +	 *   them from all optimizations
   1.156 +	 */
   1.157 +	void FindInstancedMeshes (aiNode* pNode);
   1.158 +
   1.159 +private:
   1.160 +
   1.161 +	//! Scene we're working with
   1.162 +	aiScene* mScene;
   1.163 +
   1.164 +	//! Per mesh info
   1.165 +	std::vector<MeshInfo> meshes;
   1.166 +
   1.167 +	//! Next output mesh
   1.168 +	aiMesh* mesh;
   1.169 +
   1.170 +	//! Output meshes
   1.171 +	std::vector<aiMesh*> output;
   1.172 +
   1.173 +	//! @see EnablePrimitiveTypeSorting
   1.174 +	mutable bool pts;
   1.175 +
   1.176 +	//! @see SetPreferredMeshSizeLimit
   1.177 +	mutable unsigned int max_verts,max_faces;
   1.178 +
   1.179 +	//! Temporary storage
   1.180 +	std::vector<aiMesh*> merge_list;
   1.181 +};
   1.182 +
   1.183 +} // end of namespace Assimp
   1.184 +
   1.185 +#endif // AI_CALCTANGENTSPROCESS_H_INC