1 #define SOLID_MAX_SIDES 512
2 #define VMF_FLAG_IS_PROP 0x1
3 #define VMF_FLAG_IS_INSTANCE 0x2
4 #define VMF_FLAG_BRUSH_ENT 0x4
6 typedef struct vmf_solid vmf_solid
;
7 typedef struct vmf_vert vmf_vert
;
8 typedef struct vmf_mat vmf_mat
;
9 typedef struct vmf_face vmf_face
;
10 typedef struct vmf_userdata vmf_userdata
;
11 typedef struct vmf_map vmf_map
;
13 typedef enum ESolidResult ESolidResult
;
18 k_ESolidResult_maxsides
,
19 k_ESolidResult_invalid
,
20 k_ESolidResult_errnomem
,
21 k_ESolidResult_corrupt
,
22 k_ESolidResult_degenerate
83 void solidgen_ctx_reset( vmf_solid
*ctx
)
85 csr_sb_clear( ctx
->verts
);
86 csr_sb_clear( ctx
->indices
);
89 void solidgen_ctx_init( vmf_solid
*ctx
)
91 const u32 init_size
= 128;
93 ctx
->verts
= csr_sb_reserve( NULL
, init_size
, sizeof(vmf_vert
) );
94 ctx
->indices
= csr_sb_reserve( NULL
, init_size
, sizeof(u32
) );
97 void solidgen_ctx_free( vmf_solid
*ctx
)
99 csr_sb_free( ctx
->verts
);
100 csr_sb_free( ctx
->indices
);
103 // Compute bounds of solid gen ctx
104 void solidgen_bounds( vmf_solid
*ctx
, boxf box
)
106 v3f mine
= { INFINITY
, INFINITY
, INFINITY
};
107 v3f maxe
= {-INFINITY
,-INFINITY
,-INFINITY
};
109 for( int i
= 0; i
< csr_sb_count( ctx
->verts
); i
++ )
111 vmf_vert
*vert
= ctx
->verts
+ i
;
112 v3_minv( mine
, vert
->co
, mine
);
113 v3_maxv( maxe
, vert
->co
, maxe
);
116 v3_copy( mine
, box
[0] );
117 v3_copy( maxe
, box
[1] );
124 double planes
[ SOLID_MAX_SIDES
*4 ];
129 // put an extra plane into the planes list
130 void vmf_addbisector( double p
[4] )
132 double *plane
= vmf_api
.planes
+ vmf_api
.bisectors
* 4;
139 vmf_api
.bisectors
++;
142 void vmf_clearbisectors( void )
144 vmf_api
.bisectors
= 0;
147 void vmf_ignore_mat( const char *material
)
149 vmf_api
.blacklist
= csr_sb_reserve( vmf_api
.blacklist
, 1, sizeof( vmf_mat
) );
150 vmf_mat
*mat
= (vmf_mat
*)csr_sb_use( vmf_api
.blacklist
);
152 mat
->str
= csr_malloc( strlen( material
) + 1 );
153 strcpy( mat
->str
, material
);
155 mat
->hash
= djb2( ( const unsigned char * )material
);
158 void vmf_clearignore( void )
160 for( int i
= 0; i
< csr_sb_count( vmf_api
.blacklist
); i
++ )
162 free( vmf_api
.blacklist
[ i
].str
);
165 csr_sb_free( vmf_api
.blacklist
);
166 vmf_api
.blacklist
= NULL
;
169 int mat_blacklisted( const char *material
)
171 u32 hash
= djb2((const u8
*)material
);
173 for( int j
= 0; j
< csr_sb_count( vmf_api
.blacklist
); j
++ )
175 if( vmf_api
.blacklist
[ j
].hash
== hash
)
177 if( !strcmp( material
, vmf_api
.blacklist
[ j
].str
) )
187 void sort_coplanar( double p
[4], vmf_vert
*points
, u32
*indices
, u32 count
)
189 v3f center
= {0.f
, 0.f
, 0.f
};
192 v3_normalize( norm
);
194 for( int i
= 0; i
< count
; i
++ )
196 v3_add( points
[ indices
[i
] ].co
, center
, center
);
198 v3_divs( center
, count
, center
);
201 v3_sub( points
[ indices
[0] ].co
, center
, ref
);
203 // Calc angles compared to ref
204 float *angles
= (float*)alloca( sizeof(float)*count
);
205 for( int i
= 0; i
< count
; i
++ )
210 v3_sub( points
[ indices
[i
] ].co
, center
, diff
);
211 v3_cross( diff
, ref
, c
);
214 atan2f( v3_length(c
), v3_dot( diff
, ref
) )
215 * (v3_dot( c
, norm
) < 0.f
? -1.f
: 1.f
);
218 // Temporary local indexes
219 u32
*temp_indices
= (u32
*)alloca( sizeof(u32
)*count
);
220 for( u32 i
= 0; i
< count
; i
++ ) temp_indices
[i
] = i
;
222 // Slow sort on large vertex counts
227 for( int i
= 0; i
< count
-1; i
++ )
229 int s0
= i
; int s1
= i
+ 1;
231 if( angles
[temp_indices
[s0
]] > angles
[temp_indices
[s1
]] )
233 // swap indices and mirror on local
234 u32 temp
= indices
[s1
];
235 indices
[s1
] = indices
[s0
];
238 temp
= temp_indices
[s1
];
239 temp_indices
[s1
] = temp_indices
[s0
];
240 temp_indices
[s0
] = temp
;
247 if( !modified
) break;
251 int solid_has_displacement( vdf_node
*node
)
256 while( (pSide
= vdf_next(node
, "side", &it
)) )
258 if( vdf_next( pSide
, "dispinfo", NULL
) )
266 void solid_disp_tri( vmf_solid
*ctx
, u32 a
, u32 b
, u32 c
)
268 *((u32
*)csr_sb_use( ctx
->indices
)) = a
;
269 *((u32
*)csr_sb_use( ctx
->indices
)) = b
;
270 *((u32
*)csr_sb_use( ctx
->indices
)) = c
;
273 void face_add_indice( vmf_face
*f
, u32 idx
)
275 f
->indices
= csr_sb_reserve( f
->indices
, 1, sizeof( u32
) );
276 *((u32
*)csr_sb_use( f
->indices
)) = idx
;
279 ESolidResult
solidgen_push( vmf_solid
*ctx
, vdf_node
*node
)
281 ESolidResult flag
= k_ESolidResult_valid
;
283 double planes
[ SOLID_MAX_SIDES
*4 ];
284 vmf_face faces
[ SOLID_MAX_SIDES
];
286 int is_displacement
= solid_has_displacement( node
);
291 while( (pSide
= vdf_next(node
, "side", &it
)) )
293 if( num_planes
>= SOLID_MAX_SIDES
)
295 flag
= k_ESolidResult_maxsides
;
296 fprintf( stderr
, "Solid over maxsides limit (%i)\n", SOLID_MAX_SIDES
);
302 vmf_face
*face
= faces
+ num_planes
;
303 face
->indices
= NULL
;
304 face
->dispinfo
= vdf_next( pSide
, "dispinfo", NULL
);
305 face
->material
= kv_get( pSide
, "material", "" );
306 face
->blacklisted
= mat_blacklisted( face
->material
);
308 kv_double_array( pSide
, "plane", 9, points
);
310 tri_to_plane( points
+6, points
+3, points
+0, planes
+ num_planes
* 4 );
314 // Compute plane intersections
316 csr_comb_init( 3, i
);
318 v3f center
= { 0.f
, 0.f
, 0.f
};
320 u32 vert_start
= csr_sb_count( ctx
->verts
);
324 // DO something with i j k
327 if( (faces
[ i
[0] ].blacklisted
&& faces
[ i
[1] ].blacklisted
&& faces
[ i
[2] ].blacklisted
) )
330 if( !plane_intersect( planes
+i
[0]*4, planes
+i
[1]*4, planes
+i
[2]*4, p
) )
333 // Check for illegal verts (eg: got clipped by bisectors)
335 for( int m
= 0; m
< num_planes
; m
++ )
337 if( plane_polarity( planes
+m
*4, p
) > 1e-6f
)
346 ctx
->verts
= csr_sb_reserve( ctx
->verts
, 3, sizeof( vmf_vert
) );
348 // Take the vertex position and add it for centering base on average
350 v3_add( (v3f
){ p
[0], p
[1], p
[2] }, center
, center
);
352 // Store point / respecive normal for each plane that triggered the collision
353 for( int k
= 0; k
< 3; k
++ )
355 if( !faces
[ i
[k
] ].blacklisted
)
357 u32 c
= csr_sb_count( ctx
->verts
);
359 face_add_indice( faces
+ i
[k
], c
);
361 v3d_v3f( p
, ctx
->verts
[ c
].co
);
362 v3d_v3f( planes
+i
[k
]*4, ctx
->verts
[ c
].nrm
);
364 csr_sb_inc( ctx
->verts
, 1 );
369 while( csr_comb( 3, num_planes
, i
) );
371 // Retrospectively set the center for each point
372 v3_divs( center
, (float)numpoints
, center
);
373 for( ; vert_start
< csr_sb_count( ctx
->verts
); vert_start
++ )
375 v2_copy( center
, ctx
->verts
[ vert_start
].xy
);
378 // Sort each faces and trianglulalate them
379 for( int k
= 0; k
< num_planes
; k
++ )
381 vmf_face
*face
= faces
+ k
;
383 if( face
->blacklisted
) continue;
385 if( csr_sb_count( face
->indices
) < 3 )
387 flag
= k_ESolidResult_degenerate
;
388 fprintf( stderr
, "Skipping degenerate face\n" );
392 // Sort only if there is no displacements, or if this side is
393 if( !is_displacement
|| ( is_displacement
&& face
->dispinfo
) )
395 sort_coplanar( planes
+k
*4, ctx
->verts
, face
->indices
, csr_sb_count( face
->indices
) );
398 if( is_displacement
)
400 // Compute displacement
403 if( csr_sb_count( face
->indices
) != 4 )
405 flag
= k_ESolidResult_degenerate
;
406 fprintf( stderr
, "Skipping degenerate displacement\n" );
410 // Match starting position
413 float dmin
= 999999.f
;
415 vdf_node
*dispinfo
= face
->dispinfo
;
416 vdf_node
*vdf_normals
= vdf_next( dispinfo
, "normals", NULL
);
417 vdf_node
*vdf_distances
= vdf_next( dispinfo
, "distances", NULL
);
419 kv_float_array( dispinfo
, "startposition", 3, start
);
421 for( int j
= 0; j
< csr_sb_count( face
->indices
); j
++ )
423 float d2
= v3_dist2( start
, ctx
->verts
[ face
->indices
[ j
] ].co
);
431 // Can be either 5, 9, 17
432 numpoints
= pow( 2, kv_get_int( dispinfo
, "power", 2 ) ) + 1;
433 u32 reqverts
= numpoints
*numpoints
;
434 u32 reqidx
= (numpoints
-1)*(numpoints
-1)*6;
436 ctx
->verts
= csr_sb_reserve( ctx
->verts
, reqverts
, sizeof( vmf_vert
) );
437 ctx
->indices
= csr_sb_reserve( ctx
->indices
, reqidx
, sizeof( u32
) );
439 // Get corners of displacement
440 float *SW
= ctx
->verts
[ face
->indices
[ sw
] ].co
;
441 float *NW
= ctx
->verts
[ face
->indices
[ (sw
+1) % 4] ].co
;
442 float *NE
= ctx
->verts
[ face
->indices
[ (sw
+2) % 4] ].co
;
443 float *SE
= ctx
->verts
[ face
->indices
[ (sw
+3) % 4] ].co
;
445 float normals
[ 17*3 ];
446 float distances
[ 17 ];
448 // Calculate displacement positions
449 for( int j
= 0; j
< numpoints
; j
++ )
452 sprintf( key
, "row%i", j
);
454 kv_float_array( vdf_normals
, key
, 17*3, normals
);
455 kv_float_array( vdf_distances
, key
, 17, distances
);
457 float dx
= (float)j
/ (float)(numpoints
- 1); //Time values for linear interpolation
459 for( int m
= 0; m
< numpoints
; m
++ )
461 vmf_vert
*vert
= &ctx
->verts
[ csr_sb_count( ctx
->verts
) + j
*numpoints
+ m
];
463 float dy
= (float)m
/ (float)(numpoints
- 1);
467 v3_lerp( SW
, SE
, dx
, lwr
);
468 v3_lerp( NW
, NE
, dx
, upr
);
469 v3_lerp( lwr
, upr
, dy
, vert
->co
);
471 v3_muladds( vert
->co
, normals
+ m
* 3, distances
[ m
], vert
->co
);
473 // Todo, put correct normal
474 v3_copy( (v3f
){ 0.f
, 0.f
, 1.f
}, vert
->nrm
);
478 // Build displacement indices
480 for( int row
= 0; row
< numpoints
- 1; row
++ )
482 for( int col
= 0; col
< numpoints
- 1; col
++ )
484 u32 c
= csr_sb_count( ctx
->verts
);
486 u32 idxsw
= c
+ ( row
+ 0 ) * numpoints
+ col
+ 0 ;
487 u32 idxse
= c
+ ( row
+ 0 ) * numpoints
+ col
+ 1 ;
488 u32 idxnw
= c
+ ( row
+ 1 ) * numpoints
+ col
+ 0 ;
489 u32 idxne
= c
+ ( row
+ 1 ) * numpoints
+ col
+ 1 ;
491 if( (condition
++) % 2 == 0 )
493 solid_disp_tri( ctx
, idxne
, idxnw
, idxsw
);
494 solid_disp_tri( ctx
, idxse
, idxne
, idxsw
);
498 solid_disp_tri( ctx
, idxse
, idxnw
, idxsw
);
499 solid_disp_tri( ctx
, idxse
, idxne
, idxnw
);
505 csr_sb_inc( ctx
->verts
, numpoints
*numpoints
);
510 u32 tris
= csr_sb_count( face
->indices
) -2;
511 ctx
->indices
= csr_sb_reserve( ctx
->indices
, tris
*3, sizeof( u32
) );
513 u32 c
= csr_sb_count( ctx
->indices
);
515 for( int j
= 0; j
< tris
; j
++ )
517 ctx
->indices
[ c
+j
*3 +0 ] = face
->indices
[ 0 ];
518 ctx
->indices
[ c
+j
*3 +1 ] = face
->indices
[ j
+1 ];
519 ctx
->indices
[ c
+j
*3 +2 ] = face
->indices
[ j
+2 ];
526 csr_sb_inc( ctx
->indices
, tris
*3 );
530 // Free temp polyon buffers
531 for( int j
= 0; j
< num_planes
; j
++ )
533 csr_sb_free( faces
[ j
].indices
);
539 u32
vmf_get_mdl( vmf_map
*map
, const char *mdl
)
541 u32 hash
= djb2( (const unsigned char *)mdl
);
543 for( u32 i
= 0; i
< csr_sb_count( map
->models
); i
++ )
545 if( hash
== map
->models
[i
].hash
&& !strcmp( map
->models
[i
].str
, mdl
) )
554 int vmf_class_is_prop( vdf_node
*ent
)
556 return !strncmp( kv_get( ent
, "classname", "" ), "prop_", 5 );
559 void vmf_populate_models( vdf_node
*vmf
, vmf_map
*map
)
561 vdf_foreach( vmf
, "entity", ent
)
563 // Use any class name with prop_
564 if( vmf_class_is_prop( ent
) )
566 // Check if it exists
567 const char *model_path
= kv_get( ent
, "model", "" );
568 u32 mdl_id
= vmf_get_mdl( map
, model_path
);
572 map
->models
= csr_sb_reserve( map
->models
, 1, sizeof( struct vmf_model
));
574 struct vmf_model
*entry
= &map
->models
[ csr_sb_count( map
->models
) ];
575 entry
->str
= csr_malloc( strlen( model_path
) +1 );
576 strcpy( entry
->str
, model_path
);
577 entry
->hash
= djb2( (const unsigned char *)model_path
);
579 mdl_id
= csr_sb_count( map
->models
);
580 csr_sb_use( map
->models
);
583 // Assign prop-ID for later use
584 ent
->user
= VMF_FLAG_IS_PROP
;
591 void vmf_load_models( vmf_map
*map
)
593 printf( "Loading all models\n" );
595 // Error model. TODO: Maybe don't have this be junk data.
596 map
->models
= csr_sb_reserve( map
->models
, 1, sizeof( struct vmf_model
));
597 csr_sb_use( map
->models
);
598 mdl_error( &map
->models
[0].mdl
);
600 // Create listings for each model
601 vmf_populate_models( map
->root
, map
);
603 for( int i
= 0; i
< csr_sb_count( map
->cache
); i
++ )
605 vmf_populate_models( map
->cache
[i
].root
, map
);
608 printf( "Indexed (%u) models\n", csr_sb_count( map
->models
)-1 );
613 // TODO: Make nice loading bar
614 for( int i
= 1; i
< csr_sb_count( map
->models
); i
++ )
616 struct vmf_model
*mdl
= &map
->models
[i
];
618 if( mdl_from_find_files( mdl
->str
, &mdl
->mdl
) )
624 fprintf( stderr
, "Failed to load model: %s\n", mdl
->str
);
628 printf( "Done (%u of %u loaded)\n", num_success
, csr_sb_count( map
->models
)-1 );
631 u32
vmf_init_subvmf( vmf_map
*map
, const char *subvmf
);
633 void vmf_load_all_instances( vmf_map
*map
, vdf_node
*vmf
)
635 vdf_foreach( vmf
, "entity", ent
)
637 if( !strcmp( kv_get( ent
, "classname", "" ), "func_instance" ))
639 // Entity is in use if file is specified, if not just ignore the entity.
640 const char *path
= kv_get( ent
, "file", "" );
641 if( strcmp( path
, "" ) )
643 if( (ent
->user1
= vmf_init_subvmf( map
, path
)))
646 ent
->user
= VMF_FLAG_IS_INSTANCE
;
653 // TODO: Merge this into above function.. doesnt need to be seperated
654 u32
vmf_init_subvmf( vmf_map
*map
, const char *subvmf
)
657 u32 hash
= djb2( (const unsigned char *)subvmf
);
660 for( u32 i
= 0; i
< csr_sb_count( map
->cache
); i
++ )
662 if( hash
== map
->cache
[i
].hash
)
664 if( !strcmp( map
->cache
[i
].name
, subvmf
) )
671 printf( "Loading subvmf: %s\n", subvmf
);
673 id
= csr_sb_count( map
->cache
);
674 map
->cache
= csr_sb_reserve( map
->cache
, 1, sizeof( struct vmf_instance
));
675 struct vmf_instance
*inst
= &map
->cache
[ id
];
677 if( (inst
->root
= vdf_open_file( subvmf
)) )
679 csr_sb_use( map
->cache
);
682 inst
->name
= csr_malloc( strlen( subvmf
)+1 );
683 strcpy( inst
->name
, subvmf
);
685 // Recursive load other instances
686 vmf_load_all_instances( map
, inst
->root
);
692 fprintf( stderr
, "Failed to load instance file\n" );
697 vmf_map
*vmf_init( const char *path
, int load_models
)
699 vmf_map
*map
= csr_calloc( sizeof( vmf_map
) );
700 map
->root
= vdf_open_file( path
);
709 vmf_load_all_instances( map
, map
->root
);
714 vmf_load_models( map
);
720 void vmf_free( vmf_map
*map
)
722 for( int i
= 0; i
< csr_sb_count( map
->cache
); i
++ )
724 vdf_free_r( map
->cache
[i
].root
);
725 free( map
->cache
[i
].name
);
728 for( int i
= 1; i
< csr_sb_count( map
->models
); i
++ )
730 free( map
->models
[i
].str
);
731 mdl_free( &map
->models
[i
].mdl
);
734 vdf_free_r( map
->root
);
735 csr_sb_free( map
->models
);
736 csr_sb_free( map
->cache
);
740 void solidgen_to_obj( vmf_solid
*ctx
, const char *path
)
742 FILE *fp
= fopen( path
, "w" );
746 fprintf( fp
, "o vmf_export\n" );
750 // Write vertex block
751 for( int i
= 0; i
< csr_sb_count( ctx
->verts
); i
++ )
753 vert
= &ctx
->verts
[i
];
754 fprintf( fp
, "v %f %f %f\n", vert
->co
[0], vert
->co
[1], vert
->co
[2] );
757 // Write normals block
758 for( int i
= 0; i
< csr_sb_count( ctx
->verts
); i
++ )
760 vert
= &ctx
->verts
[i
];
761 fprintf( fp
, "vn %f %f %f\n", vert
->nrm
[0], vert
->nrm
[1], vert
->nrm
[2] );
764 fprintf( fp
, "s off\n" );
767 for( int i
= 0; i
< csr_sb_count( ctx
->indices
)/3; i
++ )
769 u32
* base
= ctx
->indices
+ i
*3;
770 fprintf( fp
, "f %u//%u %u//%u %u//%u\n",
771 base
[2]+1, base
[2]+1,
772 base
[1]+1, base
[1]+1,
781 fprintf( stderr
, "Could not open %s for writing\n", path
);
785 void vmf_entity_transform( vdf_node
*ent
, m4x3f mat
)
787 v3f angles
= {0.f
,0.f
,0.f
};
788 v3f offset
= {0.f
,0.f
,0.f
};
792 scale
= kv_get_float( ent
, "uniformscale", 1.f
);
793 kv_float_array( ent
, "angles", 3, angles
);
794 kv_float_array( ent
, "origin", 3, offset
);
797 m4x3_translate( mat
, offset
);
799 // Make rotation ( Pitch yaw roll // YZX. Source->OpenGL ordering a lil messed up )
800 m4x3_rotate_z( mat
, csr_rad( angles
[1] ) );
801 m4x3_rotate_y( mat
, csr_rad( angles
[0] ) );
802 m4x3_rotate_x( mat
, csr_rad( angles
[2] ) );
805 m4x3_scale( mat
, scale
);
808 u32
vmf_visgroup_id( vdf_node
*root
, const char *name
)
810 vdf_node
*dict
= vdf_next( root
, "visgroups", NULL
);
814 vdf_foreach( dict
, "visgroup", group
)
816 if( !strcmp( kv_get( group
, "name", "" ), name
) )
818 return kv_get_int( group
, "visgroupid", 0 );
826 int vmf_visgroup_match( vdf_node
*ent
, u32 target
)
828 vdf_node
*editor
= vdf_next( ent
, "editor", NULL
);
832 kv_foreach( editor
, "visgroupid", groupe
)
834 if( target
== atoi( groupe
) )