Parent Directory
| 
Revision Log
[ ] Bugfix
[ ] New Feature
[x] Cleanup
[ ] Documentation
[ ] Breaks existing applications
Description: Remove chunk-based allocation in plyModel octtree
generation for better memory fragmentation behaviour
/* Copyright (c) 2006-2007, Stefan Eilemann <[email protected]> All rights reserved. - Adapted code for Equalizer usage. - Improved malloc fragmentation behaviour */ /****************************************************************************** * * * Copyright (c) 2002 Silicon Graphics, Inc. All Rights Reserved. * * * * The recipient ("Recipient") of this software, including as modified * * ("Software") may reproduce, redistribute, use, and derive works from the * * Software without restriction, subject to the following conditions: * * * * - Redistribution of the Software in any form must reproduce this entire * * notice, including as modified in accordance with these provisions * * ("Notice"); * * - Any Recipient who modifies and subsequently redistributes the Software * * shall add information to this Notice to sufficiently identify the * * Recipient's modifications; * * - Recipient may not use the name(s) of any previous Recipient to endorse * * or promote any products derived from the Software without prior express * * written permission from such previous Recipient. * * * * THE SOFTWARE IS PROVIDED "AS IS," WITHOUT ANY EXPRESS OR IMPLIED WARRANTY * * OR CONDITION, INCLUDING WITHOUT LIMITATION ANY WARRANTIES OR CONDITIONS OF * * MERCHANTABILITY, SECURITY, SATISFACTORY QUALITY, FITNESS FOR A PARTICULAR * * PURPOSE, AND NONINFRINGEMENT. PATENT LICENSES, IF ANY, PROVIDED HEREIN * * DO NOT APPLY TO COMBINATIONS OF THIS PROGRAM WITH OTHER SOFTWARE, OR ANY * * OTHER PRODUCT WHATSOEVER. IN NO EVENT WILL THE ORIGINATOR OR SUBSEQUENT * * RECIPIENT OF THE SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES ARISING IN RELATION TO THE * * SOFTWARE, ITS USE, OR THESE PROVISIONS, HOWEVER CAUSED AND ON ANY THEORY * * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR NEGLIGENCE OR * * OTHER TORT, EVEN IF PRE-ADVISED OF THE PROSPECT OF SUCH DAMAGES. * * * * This Software was developed at private expense; if acquired under an * * agreement with the USA government or any contractor thereto, it is * * acquired as "commercial computer software" subject to the provisions of * * this license agreement, as specified in (a) 48 CFR 12.212 of the FAR; or, * * if acquired for Department of Defense units, (b) 48 CFR 227-7202 of the * * DoD FAR Supplement; or sections succeeding thereto. * * * * * * Originator: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy, * * Mountain View, CA 94043. http://www.sgi.com * * * ******************************************************************************/ #include "plyModel.h" #include <eq/eq.h> #include <float.h> #include <math.h> #define MAXDEPTH 256 #define PLYFILEVERSION 20 using namespace std; //--------------------------------------------------------------------------- // PlyModel //--------------------------------------------------------------------------- template<class FaceType> PlyModel<FaceType>::PlyModel( void ) : _nFaces(0), _faces(0) { _bbox.parent = 0; _bbox.next = 0; _bbox.children = 0; _bbox.faces = 0; _bbox.nFaces = 0; } //--------------------------------------------------------------------------- // ~PlyModel //--------------------------------------------------------------------------- template<class FaceType> PlyModel<FaceType>::~PlyModel() { if( _faces != 0 ) free( _faces ); _faces = 0; freeBBoxes( _bbox ); } //--------------------------------------------------------------------------- // setFaces //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::setFaces( size_t nFaces, FaceType *faces, size_t bboxFaceThreshold ) { if( _faces != 0 ) free( _faces ); if( nFaces == 0 ) return; // coordinates Vertex bbox[2]; calculateBBox( nFaces, faces, bbox ); memcpy( _bbox.pos, bbox, 2*sizeof(Vertex) ); memcpy( _bbox.cullBox, bbox, 2*sizeof(Vertex) ); _faces = (FaceType *)malloc( nFaces * sizeof(FaceType) ); _nFaces = 0; EQINFO << eqBase::disableHeader << "Filling bounding boxes"; _bbox.children = 0; _bbox.parent = 0; _bbox.next = 0; _bbox.range[0] = 0.0f; _bbox.range[1] = 1.0f - numeric_limits<float>::epsilon(); fillBBox( nFaces, faces, _bbox, bboxFaceThreshold, 0 ); EQINFO << eqBase::enableHeader << endl; if( _nFaces != nFaces ) EQWARN << "Used " << nFaces << " faces of " << _nFaces << " input faces" << endl; } //--------------------------------------------------------------------------- // calculateBBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::calculateBBox( size_t nFaces, FaceType *faces, Vertex bbox[2] ) { bbox[0].pos[0] = faces[0].vertices[0].pos[0]; bbox[1].pos[0] = faces[0].vertices[0].pos[0]; bbox[0].pos[1] = faces[0].vertices[0].pos[1]; bbox[1].pos[1] = faces[0].vertices[0].pos[1]; bbox[0].pos[2] = faces[0].vertices[0].pos[2]; bbox[1].pos[2] = faces[0].vertices[0].pos[2]; for( size_t i=1; i<nFaces; i++ ) { FaceType &face = faces[i]; Vertex *vertex = &face.vertices[0]; if( vertex->pos[0] < bbox[0].pos[0] ) bbox[0].pos[0] = vertex->pos[0]; if( vertex->pos[1] < bbox[0].pos[1] ) bbox[0].pos[1] = vertex->pos[1]; if( vertex->pos[2] < bbox[0].pos[2] ) bbox[0].pos[2] = vertex->pos[2]; if( vertex->pos[0] > bbox[1].pos[0] ) bbox[1].pos[0] = vertex->pos[0]; if( vertex->pos[1] > bbox[1].pos[1] ) bbox[1].pos[1] = vertex->pos[1]; if( vertex->pos[2] > bbox[1].pos[2] ) bbox[1].pos[2] = vertex->pos[2]; vertex = &face.vertices[1]; if( vertex->pos[0] < bbox[0].pos[0] ) bbox[0].pos[0] = vertex->pos[0]; if( vertex->pos[1] < bbox[0].pos[1] ) bbox[0].pos[1] = vertex->pos[1]; if( vertex->pos[2] < bbox[0].pos[2] ) bbox[0].pos[2] = vertex->pos[2]; if( vertex->pos[0] > bbox[1].pos[0] ) bbox[1].pos[0] = vertex->pos[0]; if( vertex->pos[1] > bbox[1].pos[1] ) bbox[1].pos[1] = vertex->pos[1]; if( vertex->pos[2] > bbox[1].pos[2] ) bbox[1].pos[2] = vertex->pos[2]; vertex = &face.vertices[2]; if( vertex->pos[0] < bbox[0].pos[0] ) bbox[0].pos[0] = vertex->pos[0]; if( vertex->pos[1] < bbox[0].pos[1] ) bbox[0].pos[1] = vertex->pos[1]; if( vertex->pos[2] < bbox[0].pos[2] ) bbox[0].pos[2] = vertex->pos[2]; if( vertex->pos[0] > bbox[1].pos[0] ) bbox[1].pos[0] = vertex->pos[0]; if( vertex->pos[1] > bbox[1].pos[1] ) bbox[1].pos[1] = vertex->pos[1]; if( vertex->pos[2] > bbox[1].pos[2] ) bbox[1].pos[2] = vertex->pos[2]; } // make bbox a bit bigger for faceInBBox test of 'on-the-border' faces bbox[1].pos[0] *= 1.01; bbox[1].pos[1] *= 1.01; bbox[1].pos[2] *= 1.01; } //--------------------------------------------------------------------------- // fillBBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::fillBBox( size_t nFaces, FaceType *faces, BBox &bbox, size_t bboxFaceThreshold, int depth ) { #ifndef NDEBUG static size_t filled = 0; if( filled%100 == 0 ) EQINFO << "." << eqBase::forceFlush; ++filled; #endif vector<FaceType> bboxFaces; for( size_t i=0; i<nFaces; i++ ) { FaceType &face = faces[i]; Vertex faceBBox[2]; calculateFaceBBox( face, faceBBox ); if( faceInBBox( bbox.pos, faceBBox )) { expandBox( bbox.cullBox, faceBBox ); bboxFaces.push_back( face ); } } calculateCullSphere( bbox ); // update range if( bboxFaces.empty( )) // end pos bbox.range[1] = bbox.range[0]; else { const float start = bbox.range[0]; // start pos set by previous or init const float range = bbox.range[1]; // parents range span set in init bbox.range[1] = start + range * bboxFaces.size() / nFaces; } if( bbox.next != 0 ) // start range position of next child bbox.next->range[0] = bbox.range[1]; bbox.faces = &_faces[_nFaces]; bbox.nFaces = bboxFaces.size(); if( bbox.nFaces < bboxFaceThreshold || depth > MAXDEPTH ) { if( bboxFaces.empty( )) return; memcpy( &_faces[_nFaces], &bboxFaces.front(), bbox.nFaces * sizeof( FaceType )); _nFaces += bbox.nFaces; } else { // recursive-fill children bboxes createBBoxChildren( bbox ); size_t cnf = 0; for( int j=0; j<8; j++ ) { fillBBox( bboxFaces.size(), &bboxFaces.front(), bbox.children[j], bboxFaceThreshold, depth+1 ); cnf += bbox.children[j].nFaces; } EQASSERT( cnf == bbox.nFaces ); } } //--------------------------------------------------------------------------- // createBBoxChildren //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::createBBoxChildren( BBox &bbox ) { bbox.children = (BBox *)calloc( 1, 8*sizeof(BBox) ); const float range = bbox.range[1] - bbox.range[0]; for( int i=0; i<8; i++ ) { bbox.children[i].parent = &bbox; bbox.children[i].range[1] = range; if( i<7 ) bbox.children[i].next = &bbox.children[i+1]; else bbox.children[i].next = 0; } // range start (child updates next child when filling bbox) bbox.children[0].range[0] = bbox.range[0]; // child positions Vertex *pos = bbox.pos; Vertex middle; Vertex childPos[2]; Vertex cullBox[2]; middle.pos[0] = (pos[0].pos[0] + pos[1].pos[0])/2.; middle.pos[1] = (pos[0].pos[1] + pos[1].pos[1])/2.; middle.pos[2] = (pos[0].pos[2] + pos[1].pos[2])/2.; cullBox[0].pos[0] = FLT_MAX; cullBox[0].pos[1] = FLT_MAX; cullBox[0].pos[2] = FLT_MAX; cullBox[1].pos[0] = -FLT_MAX; cullBox[1].pos[1] = -FLT_MAX; cullBox[1].pos[2] = -FLT_MAX; childPos[0].pos[0] = pos[0].pos[0]; childPos[0].pos[1] = pos[0].pos[1]; childPos[0].pos[2] = pos[0].pos[2]; childPos[1].pos[0] = middle.pos[0]; childPos[1].pos[1] = middle.pos[1]; childPos[1].pos[2] = middle.pos[2]; memcpy( bbox.children[0].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[0].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = middle.pos[0]; childPos[1].pos[0] = pos[1].pos[0]; memcpy( bbox.children[1].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[1].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = pos[0].pos[0]; childPos[1].pos[0] = middle.pos[0]; childPos[0].pos[1] = middle.pos[1]; childPos[1].pos[1] = pos[1].pos[1]; memcpy( bbox.children[2].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[2].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = middle.pos[0]; childPos[1].pos[0] = pos[1].pos[0]; memcpy( bbox.children[3].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[3].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = pos[0].pos[0]; childPos[0].pos[1] = pos[0].pos[1]; childPos[1].pos[0] = middle.pos[0]; childPos[1].pos[1] = middle.pos[1]; childPos[0].pos[2] = middle.pos[2]; childPos[1].pos[2] = pos[1].pos[2]; memcpy( bbox.children[4].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[4].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = middle.pos[0]; childPos[1].pos[0] = pos[1].pos[0]; memcpy( bbox.children[5].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[5].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = pos[0].pos[0]; childPos[1].pos[0] = middle.pos[0]; childPos[0].pos[1] = middle.pos[1]; childPos[1].pos[1] = pos[1].pos[1]; memcpy( bbox.children[6].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[6].cullBox, cullBox, 2*sizeof(Vertex) ); childPos[0].pos[0] = middle.pos[0]; childPos[1].pos[0] = pos[1].pos[0]; memcpy( bbox.children[7].pos, childPos, 2*sizeof(Vertex) ); memcpy( bbox.children[7].cullBox, cullBox, 2*sizeof(Vertex) ); } //--------------------------------------------------------------------------- // calculateCullSphere //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::calculateCullSphere( BBox &bbox ) { bbox.cullSphere.center.x = (bbox.cullBox[0].pos[0] + bbox.cullBox[1].pos[0]) * 0.5f; bbox.cullSphere.center.y = (bbox.cullBox[0].pos[1] + bbox.cullBox[1].pos[1]) * 0.5f; bbox.cullSphere.center.z = (bbox.cullBox[0].pos[2] + bbox.cullBox[1].pos[2]) * 0.5f; float v[3]; v[0] = bbox.cullSphere.center.x - bbox.cullBox[0].pos[0]; v[1] = bbox.cullSphere.center.y - bbox.cullBox[0].pos[1]; v[2] = bbox.cullSphere.center.z - bbox.cullBox[0].pos[2]; bbox.cullSphere.radius = sqrtf( v[0]*v[0] + v[1]*v[1] + v[2]*v[2] ); } //--------------------------------------------------------------------------- // calculateFaceBBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::calculateFaceBBox( FaceType &face, Vertex bbox[2] ) { float *vertex = face.vertices[0].pos; bbox[0].pos[0] = vertex[0]; bbox[1].pos[0] = vertex[0]; bbox[0].pos[1] = vertex[1]; bbox[1].pos[1] = vertex[1]; bbox[0].pos[2] = vertex[2]; bbox[1].pos[2] = vertex[2]; vertex = face.vertices[1].pos; if( vertex[0] < bbox[0].pos[0] ) bbox[0].pos[0] = vertex[0]; if( vertex[1] < bbox[0].pos[1] ) bbox[0].pos[1] = vertex[1]; if( vertex[2] < bbox[0].pos[2] ) bbox[0].pos[2] = vertex[2]; if( vertex[0] > bbox[1].pos[0] ) bbox[1].pos[0] = vertex[0]; if( vertex[1] > bbox[1].pos[1] ) bbox[1].pos[1] = vertex[1]; if( vertex[2] > bbox[1].pos[2] ) bbox[1].pos[2] = vertex[2]; vertex = face.vertices[2].pos; if( vertex[0] < bbox[0].pos[0] ) bbox[0].pos[0] = vertex[0]; if( vertex[1] < bbox[0].pos[1] ) bbox[0].pos[1] = vertex[1]; if( vertex[2] < bbox[0].pos[2] ) bbox[0].pos[2] = vertex[2]; if( vertex[0] > bbox[1].pos[0] ) bbox[1].pos[0] = vertex[0]; if( vertex[1] > bbox[1].pos[1] ) bbox[1].pos[1] = vertex[1]; if( vertex[2] > bbox[1].pos[2] ) bbox[1].pos[2] = vertex[2]; } //--------------------------------------------------------------------------- // faceInBBox // a face is in the bbox if it touches the bbox, and all points are 'bigger' // then the bbox min point. //--------------------------------------------------------------------------- template<class FaceType> bool PlyModel<FaceType>::faceInBBox( Vertex bbox[2], Vertex faceBBox[2] ) { bool touchesBBox = false; // first see if it touches the bbox if( ( (faceBBox[0].pos[0] < bbox[1].pos[0]) && (faceBBox[1].pos[0] >= bbox[0].pos[0]) ) && ( (faceBBox[0].pos[1] < bbox[1].pos[1]) && (faceBBox[1].pos[1] >= bbox[0].pos[1]) ) && ( (faceBBox[0].pos[2] < bbox[1].pos[2]) && (faceBBox[1].pos[2] >= bbox[0].pos[2]) ) ) touchesBBox = true; if( !touchesBBox ) return false; // see if it is 'left' outside the bbox if( faceBBox[0].pos[0] < bbox[0].pos[0] || faceBBox[0].pos[1] < bbox[0].pos[1] || faceBBox[0].pos[2] < bbox[0].pos[2] ) return false; return true; } //--------------------------------------------------------------------------- // expandBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::expandBox( Vertex bbox[2], Vertex faceBBox[2]) { if( bbox[0].pos[0] > faceBBox[0].pos[0] ) bbox[0].pos[0] = faceBBox[0].pos[0]; if( bbox[0].pos[1] > faceBBox[0].pos[1] ) bbox[0].pos[1] = faceBBox[0].pos[1]; if( bbox[0].pos[2] > faceBBox[0].pos[2] ) bbox[0].pos[2] = faceBBox[0].pos[2]; if( bbox[1].pos[0] < faceBBox[1].pos[0] ) bbox[1].pos[0] = faceBBox[1].pos[0]; if( bbox[1].pos[1] < faceBBox[1].pos[1] ) bbox[1].pos[1] = faceBBox[1].pos[1]; if( bbox[1].pos[2] < faceBBox[1].pos[2] ) bbox[1].pos[2] = faceBBox[1].pos[2]; } //--------------------------------------------------------------------------- // scale //--------------------------------------------------------------------------- struct ScaleData { float scale; vmml::Vector3f offset; }; template<class FaceType> void PlyModel<FaceType>::normalize( void ) { ScaleData data = { _getScaleFactor( _bbox.pos ), vmml::Vector3f( (_bbox.pos[0].pos[0] + _bbox.pos[1].pos[0])*.5f, (_bbox.pos[0].pos[1] + _bbox.pos[1].pos[1])*.5f, (_bbox.pos[0].pos[2] + _bbox.pos[1].pos[2])*.5f ) }; scaleModel( data.scale, data.offset ); traverseBBox( &_bbox, scaleBBoxCB, scaleBBoxCB, 0, &data ); } template<class FaceType> float PlyModel<FaceType>::_getScaleFactor( const Vertex bbox[2] ) { const float xScale = bbox[1].pos[0] - bbox[0].pos[0]; const float yScale = bbox[1].pos[1] - bbox[0].pos[1]; const float zScale = bbox[1].pos[2] - bbox[0].pos[2]; float scale = xScale; if( yScale > scale ) scale = yScale; if( zScale > scale ) scale = zScale; return 1.f/scale; } template<class FaceType> void PlyModel<FaceType>::scaleModel( const float scale, const vmml::Vector3f& offset ) { for( size_t i=0; i<_nFaces; i++ ) { _faces[i].vertices[0].pos[0] -= offset.x; _faces[i].vertices[0].pos[1] -= offset.y; _faces[i].vertices[0].pos[2] -= offset.z; _faces[i].vertices[0].pos[0] *= scale; _faces[i].vertices[0].pos[1] *= scale; _faces[i].vertices[0].pos[2] *= scale; _faces[i].vertices[1].pos[0] -= offset.x; _faces[i].vertices[1].pos[1] -= offset.y; _faces[i].vertices[1].pos[2] -= offset.z; _faces[i].vertices[1].pos[0] *= scale; _faces[i].vertices[1].pos[1] *= scale; _faces[i].vertices[1].pos[2] *= scale; _faces[i].vertices[2].pos[0] -= offset.x; _faces[i].vertices[2].pos[1] -= offset.y; _faces[i].vertices[2].pos[2] -= offset.z; _faces[i].vertices[2].pos[0] *= scale; _faces[i].vertices[2].pos[1] *= scale; _faces[i].vertices[2].pos[2] *= scale; } } template<class FaceType> void PlyModel<FaceType>::scaleBBoxCB( typename PlyModel< FaceType >::BBox *bbox, void *data ) { const ScaleData* scaleData = (const ScaleData*)data; const vmml::Vector3f& offset = scaleData->offset; const float scale = scaleData->scale; bbox->cullSphere.center.x -= offset.x; bbox->cullSphere.center.y -= offset.y; bbox->cullSphere.center.z -= offset.z; bbox->cullSphere *= scale; bbox->cullBox[0].pos[0] -= offset.x; bbox->cullBox[0].pos[1] -= offset.y; bbox->cullBox[0].pos[2] -= offset.z; bbox->cullBox[1].pos[0] -= offset.x; bbox->cullBox[1].pos[1] -= offset.y; bbox->cullBox[1].pos[2] -= offset.z; bbox->cullBox[0].pos[0] *= scale; bbox->cullBox[0].pos[1] *= scale; bbox->cullBox[0].pos[2] *= scale; bbox->cullBox[1].pos[0] *= scale; bbox->cullBox[1].pos[1] *= scale; bbox->cullBox[1].pos[2] *= scale; } //--------------------------------------------------------------------------- // freeBBoxes //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::freeBBoxes( BBox &bbox ) { bbox.faces = 0; if( bbox.children == 0 ) return; for( int i=0; i<8; i++ ) freeBBoxes( bbox.children[i] ); free( bbox.children ); bbox.children = 0; } //--------------------------------------------------------------------------- // traverseBBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::traverseBBox( const BBox *top, TraverseCB preCB, TraverseCB leafCB, TraverseCB postCB, void *userData ) { // UGLY traverseBBox( const_cast< BBox* >( top ), preCB, leafCB, preCB, userData ); } template<class FaceType> void PlyModel<FaceType>::traverseBBox( BBox *top, TraverseCB preCB, TraverseCB leafCB, TraverseCB postCB, void *userData ) { if ( top->children == 0 ) { if ( leafCB ) leafCB( top, userData ); return; } BBox *bbox, *next, *parent, *child; bbox = top; while( true ) { parent = bbox->parent; next = bbox->next; child = (bbox->children==0) ? 0 : &bbox->children[0]; //---------- down-right traversal if ( child == 0 ) // leaf { if ( leafCB ) leafCB( bbox, userData ); bbox = next; } else // node { if( preCB != 0 ) preCB( bbox, userData ); bbox = child; } //---------- up-right traversal if( bbox == 0 && parent == 0 ) return; while ( bbox == 0 ) { bbox = parent; parent = bbox->parent; next = bbox->next; if( postCB ) postCB( bbox, userData ); if ( bbox == top ) return; bbox = next; } } } //--------------------------------------------------------------------------- // toStream //--------------------------------------------------------------------------- template<class FaceType> void PlyModel< FaceType >::toStream(ostream& os) { int version = PLYFILEVERSION; os.write( (char *)&version, sizeof(int) ); os.write( (char *)&_nFaces, sizeof(size_t) ); if( _nFaces > 0 ) os.write( (char *)_faces, (ssize_t)( _nFaces * sizeof( FaceType )) ); writeBBox( os, _bbox ); } //--------------------------------------------------------------------------- // fromMemory //--------------------------------------------------------------------------- #define MEM_READ( dst, len ) { memcpy( dst, *addr, len ); *addr += len; } template<class FaceType> bool PlyModel<FaceType>::fromMemory( char *start ) { char **addr = &start; int version; MEM_READ( (char *)&version, sizeof(int) ); if( version != PLYFILEVERSION ) { EQERROR << "Read version " << version <<", expected " << PLYFILEVERSION << endl; return false; } MEM_READ( (char *)&_nFaces, sizeof(size_t) ); if( _nFaces > 0) { const size_t size = _nFaces*sizeof( FaceType ); _faces = (FaceType *)malloc( size ); MEM_READ( (char *)_faces, size ); EQINFO << _nFaces << " faces at " << _faces << endl; } readBBox( addr, _bbox ); return true; } //--------------------------------------------------------------------------- // writeBBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::writeBBox( ostream& os, BBox &bbox ) { os.write( (char *)&bbox.nFaces, sizeof(size_t) ); if( bbox.nFaces > 0 ) { size_t ndx = (size_t)( (size_t)((char *)bbox.faces - (char *)_faces) / sizeof(FaceType) ); EQASSERT( ndx + bbox.nFaces <= _nFaces ); os.write( (char *)&ndx, sizeof(size_t) ); } os.write( (char *)bbox.pos, 2*sizeof(Vertex) ); os.write( (char *)bbox.cullBox, 2*sizeof(Vertex) ); os.write( (char *)&bbox.cullSphere, sizeof(bbox.cullSphere) ); os.write( (char *)bbox.range, 2*sizeof(float) ); int nChildren = 8; if( bbox.children == 0 ) nChildren = 0; os.write( (char *)&nChildren, sizeof(int) ); for( int i=0; i<nChildren; i++ ) writeBBox( os, bbox.children[i] ); } //--------------------------------------------------------------------------- // readBBox //--------------------------------------------------------------------------- template<class FaceType> void PlyModel<FaceType>::readBBox( char** addr, BBox &bbox ) { MEM_READ( (char *)&bbox.nFaces, sizeof(size_t) ); if( bbox.nFaces > 0 ) { size_t ndx; MEM_READ( (char *)&ndx, sizeof(size_t) ); EQASSERT( ndx + bbox.nFaces <= _nFaces ); bbox.faces = &_faces[ndx]; } MEM_READ( (char *)bbox.pos, 2*sizeof(Vertex) ); MEM_READ( (char *)bbox.cullBox, 2*sizeof(Vertex) ); MEM_READ( (char *)&bbox.cullSphere, sizeof(bbox.cullSphere) ); MEM_READ( (char *)bbox.range, 2*sizeof(float) ); int nChildren; MEM_READ( (char *)&nChildren, sizeof(int) ); if( nChildren == 0 ) return; createBBoxChildren( bbox ); for( int i=0; i<nChildren; ++i ) readBBox( addr, bbox.children[i] ); }
| Back to Equalizer website | ViewVC Help |
| Powered by ViewVC 1.0.3 |