}
c = (size_t)&( ( (brush_t*) 0 )->sides[ numSides ] );*/
c = sizeof(*bb) + (numSides > 6 ? sizeof(side_t)*(numSides - 6) : 0);
- bb = safe_malloc( c );
- memset( bb, 0, c );
+ bb = safe_malloc0( c );
if ( numthreads == 1 ) {
numActiveBrushes++;
}
tree_t *AllocTree( void ){
tree_t *tree;
- tree = safe_malloc( sizeof( *tree ) );
- memset( tree, 0, sizeof( *tree ) );
+ tree = safe_malloc0( sizeof( *tree ) );
ClearBounds( tree->mins, tree->maxs );
return tree;
node_t *AllocNode( void ){
node_t *node;
- node = safe_malloc( sizeof( *node ) );
- memset( node, 0, sizeof( *node ) );
+ node = safe_malloc0( sizeof( *node ) );
return node;
}