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 vmf_face faces
[ SOLID_MAX_SIDES
];
285 int is_displacement
= 0;
288 // TODO: What is this for again? surely it should be the other way around... i think...
289 if( solid_has_displacement( node
) )
291 printf( "solid_has_displacement\n" );
292 num_planes
= vmf_api
.bisectors
;
294 // Add dummy stuff for globals
296 for( int k
= 0; k
< vmf_api
.bisectors
; k
++ )
298 vmf_face
*dummy
= faces
+ k
;
299 dummy
->indices
= NULL
;
300 dummy
->dispinfo
= NULL
;
301 dummy
->material
= NULL
;
309 while( (pSide
= vdf_next(node
, "side", &it
)) )
311 if( num_planes
>= SOLID_MAX_SIDES
)
313 flag
= k_ESolidResult_maxsides
;
314 fprintf( stderr
, "Solid over maxsides limit (%i)\n", SOLID_MAX_SIDES
);
320 vmf_face
*face
= faces
+ num_planes
;
321 face
->indices
= NULL
;
322 face
->dispinfo
= vdf_next( pSide
, "dispinfo", NULL
);
323 face
->material
= kv_get( pSide
, "material", "" );
324 face
->blacklisted
= mat_blacklisted( face
->material
);
326 kv_double_array( pSide
, "plane", 9, points
);
328 tri_to_plane( points
+6, points
+3, points
+0, vmf_api
.planes
+ num_planes
* 4 );
332 // Compute plane intersections
334 csr_comb_init( 3, i
);
336 v3f center
= { 0.f
, 0.f
, 0.f
};
338 u32 vert_start
= csr_sb_count( ctx
->verts
);
342 // DO something with i j k
345 if( (faces
[ i
[0] ].blacklisted
&& faces
[ i
[1] ].blacklisted
&& faces
[ i
[2] ].blacklisted
) )
348 if( !plane_intersect( vmf_api
.planes
+i
[0]*4, vmf_api
.planes
+i
[1]*4, vmf_api
.planes
+i
[2]*4, p
) )
351 // Check for illegal verts (eg: got clipped by bisectors)
353 for( int m
= 0; m
< num_planes
; m
++ )
355 if( plane_polarity( vmf_api
.planes
+m
*4, p
) > 1e-6f
)
364 ctx
->verts
= csr_sb_reserve( ctx
->verts
, 3, sizeof( vmf_vert
) );
366 // Take the vertex position and add it for centering base on average
368 v3_add( (v3f
){ p
[0], p
[1], p
[2] }, center
, center
);
370 // Store point / respecive normal for each plane that triggered the collision
371 for( int k
= 0; k
< 3; k
++ )
373 if( !faces
[ i
[k
] ].blacklisted
)
375 u32 c
= csr_sb_count( ctx
->verts
);
377 face_add_indice( faces
+ i
[k
], c
);
379 v3d_v3f( p
, ctx
->verts
[ c
].co
);
380 v3d_v3f( vmf_api
.planes
+i
[k
]*4, ctx
->verts
[ c
].nrm
);
382 csr_sb_inc( ctx
->verts
, 1 );
387 while( csr_comb( 3, num_planes
, i
) );
389 // Retrospectively set the center for each point
390 v3_divs( center
, (float)numpoints
, center
);
391 for( ; vert_start
< csr_sb_count( ctx
->verts
); vert_start
++ )
393 v2_copy( center
, ctx
->verts
[ vert_start
].xy
);
396 // Sort each faces and trianglulalate them
397 for( int k
= vmf_api
.bisectors
; k
< num_planes
; k
++ )
399 vmf_face
*face
= faces
+ k
;
401 if( face
->blacklisted
) continue;
403 if( csr_sb_count( face
->indices
) < 3 )
405 if( !vmf_api
.bisectors
)
407 flag
= k_ESolidResult_degenerate
;
408 fprintf( stderr
, "Skipping degenerate face\n" );
413 // Sort only if there is no displacements, or if this side is
414 if( !is_displacement
|| ( is_displacement
&& face
->dispinfo
) )
416 sort_coplanar( vmf_api
.planes
+k
*4, ctx
->verts
, face
->indices
, csr_sb_count( face
->indices
) );
419 if( is_displacement
)
421 // Compute displacement
424 if( csr_sb_count( face
->indices
) != 4 )
426 // Mute error if we have global planes cause they
427 // are of course gonna fuck things up here
428 if( !vmf_api
.bisectors
)
430 flag
= k_ESolidResult_degenerate
;
431 fprintf( stderr
, "Skipping degenerate displacement\n" );
436 // Match starting position
439 float dmin
= 999999.f
;
441 vdf_node
*dispinfo
= face
->dispinfo
;
442 vdf_node
*vdf_normals
= vdf_next( dispinfo
, "normals", NULL
);
443 vdf_node
*vdf_distances
= vdf_next( dispinfo
, "distances", NULL
);
445 kv_float_array( dispinfo
, "startposition", 3, start
);
447 for( int j
= 0; j
< csr_sb_count( face
->indices
); j
++ )
449 float d2
= v3_dist2( start
, ctx
->verts
[ face
->indices
[ j
] ].co
);
457 // Get corners of displacement
458 float *SW
= ctx
->verts
[ face
->indices
[ sw
] ].co
;
459 float *NW
= ctx
->verts
[ face
->indices
[ (sw
+1) % 4] ].co
;
460 float *NE
= ctx
->verts
[ face
->indices
[ (sw
+2) % 4] ].co
;
461 float *SE
= ctx
->verts
[ face
->indices
[ (sw
+3) % 4] ].co
;
463 // Can be either 5, 9, 17
464 numpoints
= pow( 2, kv_get_int( dispinfo
, "power", 2 ) ) + 1;
465 u32 reqverts
= numpoints
*numpoints
;
466 u32 reqidx
= (numpoints
-1)*(numpoints
-1)*6;
468 ctx
->verts
= csr_sb_reserve( ctx
->verts
, reqverts
, sizeof( vmf_vert
) );
469 ctx
->indices
= csr_sb_reserve( ctx
->indices
, reqidx
, sizeof( u32
) );
471 float normals
[ 17*3 ];
472 float distances
[ 17 ];
474 // Calculate displacement positions
475 for( int j
= 0; j
< numpoints
; j
++ )
478 sprintf( key
, "row%i", j
);
480 kv_float_array( vdf_normals
, key
, 17*3, normals
);
481 kv_float_array( vdf_distances
, key
, 17, distances
);
483 float dx
= (float)j
/ (float)(numpoints
- 1); //Time values for linear interpolation
485 for( int m
= 0; m
< numpoints
; m
++ )
487 vmf_vert
*vert
= &ctx
->verts
[ csr_sb_count( ctx
->verts
) + j
*numpoints
+ m
];
489 float dy
= (float)m
/ (float)(numpoints
- 1);
493 v3_lerp( SW
, SE
, dx
, lwr
);
494 v3_lerp( NW
, NE
, dx
, upr
);
495 v3_lerp( lwr
, upr
, dy
, vert
->co
);
497 v3_muladds( vert
->co
, normals
+ m
* 3, distances
[ m
], vert
->co
);
499 // Todo, put correct normal
500 v3_copy( (v3f
){ 0.f
, 0.f
, 1.f
}, vert
->nrm
);
504 // Build displacement indices
506 for( int row
= 0; row
< numpoints
- 1; row
++ )
508 for( int col
= 0; col
< numpoints
- 1; col
++ )
510 u32 c
= csr_sb_count( ctx
->verts
);
512 u32 idxsw
= c
+ ( row
+ 0 ) * numpoints
+ col
+ 0 ;
513 u32 idxse
= c
+ ( row
+ 0 ) * numpoints
+ col
+ 1 ;
514 u32 idxnw
= c
+ ( row
+ 1 ) * numpoints
+ col
+ 0 ;
515 u32 idxne
= c
+ ( row
+ 1 ) * numpoints
+ col
+ 1 ;
517 if( (condition
++) % 2 == 0 )
519 solid_disp_tri( ctx
, idxne
, idxnw
, idxsw
);
520 solid_disp_tri( ctx
, idxse
, idxne
, idxsw
);
524 solid_disp_tri( ctx
, idxse
, idxnw
, idxsw
);
525 solid_disp_tri( ctx
, idxse
, idxne
, idxnw
);
531 csr_sb_inc( ctx
->verts
, numpoints
*numpoints
);
536 u32 tris
= csr_sb_count( face
->indices
) -2;
537 ctx
->indices
= csr_sb_reserve( ctx
->indices
, tris
*3, sizeof( u32
) );
539 u32 c
= csr_sb_count( ctx
->indices
);
541 for( int j
= 0; j
< tris
; j
++ )
543 ctx
->indices
[ c
+j
*3 +0 ] = face
->indices
[ 0 ];
544 ctx
->indices
[ c
+j
*3 +1 ] = face
->indices
[ j
+1 ];
545 ctx
->indices
[ c
+j
*3 +2 ] = face
->indices
[ j
+2 ];
552 csr_sb_inc( ctx
->indices
, tris
*3 );
556 // Free temp polyon buffers
557 for( int j
= 0; j
< num_planes
; j
++ )
559 csr_sb_free( faces
[ j
].indices
);
565 u32
vmf_get_mdl( vmf_map
*map
, const char *mdl
)
567 u32 hash
= djb2( (const unsigned char *)mdl
);
569 for( u32 i
= 0; i
< csr_sb_count( map
->models
); i
++ )
571 if( hash
== map
->models
[i
].hash
&& !strcmp( map
->models
[i
].str
, mdl
) )
580 int vmf_class_is_prop( vdf_node
*ent
)
582 return !strncmp( kv_get( ent
, "classname", "" ), "prop_", 5 );
585 void vmf_populate_models( vdf_node
*vmf
, vmf_map
*map
)
587 vdf_foreach( vmf
, "entity", ent
)
589 // Use any class name with prop_
590 if( vmf_class_is_prop( ent
) )
592 // Check if it exists
593 const char *model_path
= kv_get( ent
, "model", "" );
594 u32 mdl_id
= vmf_get_mdl( map
, model_path
);
598 map
->models
= csr_sb_reserve( map
->models
, 1, sizeof( struct vmf_model
));
600 struct vmf_model
*entry
= &map
->models
[ csr_sb_count( map
->models
) ];
601 entry
->str
= csr_malloc( strlen( model_path
) +1 );
602 strcpy( entry
->str
, model_path
);
603 entry
->hash
= djb2( (const unsigned char *)model_path
);
605 mdl_id
= csr_sb_count( map
->models
);
606 csr_sb_use( map
->models
);
609 // Assign prop-ID for later use
610 ent
->user
= VMF_FLAG_IS_PROP
;
617 void vmf_load_models( vmf_map
*map
)
619 printf( "Loading all models\n" );
621 // Error model. TODO: Maybe don't have this be junk data.
622 map
->models
= csr_sb_reserve( map
->models
, 1, sizeof( struct vmf_model
));
623 csr_sb_use( map
->models
);
624 mdl_error( &map
->models
[0].mdl
);
626 // Create listings for each model
627 vmf_populate_models( map
->root
, map
);
629 for( int i
= 0; i
< csr_sb_count( map
->cache
); i
++ )
631 vmf_populate_models( map
->cache
[i
].root
, map
);
634 printf( "Indexed (%u) models\n", csr_sb_count( map
->models
)-1 );
639 // TODO: Make nice loading bar
640 for( int i
= 1; i
< csr_sb_count( map
->models
); i
++ )
642 struct vmf_model
*mdl
= &map
->models
[i
];
644 if( mdl_from_find_files( mdl
->str
, &mdl
->mdl
) )
650 fprintf( stderr
, "Failed to load model: %s\n", mdl
->str
);
654 printf( "Done (%u of %u loaded)\n", num_success
, csr_sb_count( map
->models
)-1 );
657 u32
vmf_init_subvmf( vmf_map
*map
, const char *subvmf
);
659 void vmf_load_all_instances( vmf_map
*map
, vdf_node
*vmf
)
661 vdf_foreach( vmf
, "entity", ent
)
663 if( !strcmp( kv_get( ent
, "classname", "" ), "func_instance" ))
665 // Entity is in use if file is specified, if not just ignore the entity.
666 const char *path
= kv_get( ent
, "file", "" );
667 if( strcmp( path
, "" ) )
669 if( (ent
->user1
= vmf_init_subvmf( map
, path
)))
672 ent
->user
= VMF_FLAG_IS_INSTANCE
;
679 // TODO: Merge this into above function.. doesnt need to be seperated
680 u32
vmf_init_subvmf( vmf_map
*map
, const char *subvmf
)
683 u32 hash
= djb2( (const unsigned char *)subvmf
);
686 for( u32 i
= 0; i
< csr_sb_count( map
->cache
); i
++ )
688 if( hash
== map
->cache
[i
].hash
)
690 if( !strcmp( map
->cache
[i
].name
, subvmf
) )
697 printf( "Loading subvmf: %s\n", subvmf
);
699 id
= csr_sb_count( map
->cache
);
700 map
->cache
= csr_sb_reserve( map
->cache
, 1, sizeof( struct vmf_instance
));
701 struct vmf_instance
*inst
= &map
->cache
[ id
];
703 if( (inst
->root
= vdf_open_file( subvmf
)) )
705 csr_sb_use( map
->cache
);
708 inst
->name
= csr_malloc( strlen( subvmf
)+1 );
709 strcpy( inst
->name
, subvmf
);
711 // Recursive load other instances
712 vmf_load_all_instances( map
, inst
->root
);
718 fprintf( stderr
, "Failed to load instance file\n" );
723 vmf_map
*vmf_init( const char *path
, int load_models
)
725 vmf_map
*map
= csr_calloc( sizeof( vmf_map
) );
726 map
->root
= vdf_open_file( path
);
735 vmf_load_all_instances( map
, map
->root
);
740 vmf_load_models( map
);
746 void vmf_free( vmf_map
*map
)
748 for( int i
= 0; i
< csr_sb_count( map
->cache
); i
++ )
750 vdf_free_r( map
->cache
[i
].root
);
751 free( map
->cache
[i
].name
);
754 for( int i
= 1; i
< csr_sb_count( map
->models
); i
++ )
756 free( map
->models
[i
].str
);
757 mdl_free( &map
->models
[i
].mdl
);
760 vdf_free_r( map
->root
);
761 csr_sb_free( map
->models
);
762 csr_sb_free( map
->cache
);
766 void solidgen_to_obj( vmf_solid
*ctx
, const char *path
)
768 FILE *fp
= fopen( path
, "w" );
772 fprintf( fp
, "o vmf_export\n" );
776 // Write vertex block
777 for( int i
= 0; i
< csr_sb_count( ctx
->verts
); i
++ )
779 vert
= &ctx
->verts
[i
];
780 fprintf( fp
, "v %f %f %f\n", vert
->co
[0], vert
->co
[1], vert
->co
[2] );
783 // Write normals block
784 for( int i
= 0; i
< csr_sb_count( ctx
->verts
); i
++ )
786 vert
= &ctx
->verts
[i
];
787 fprintf( fp
, "vn %f %f %f\n", vert
->nrm
[0], vert
->nrm
[1], vert
->nrm
[2] );
790 fprintf( fp
, "s off\n" );
793 for( int i
= 0; i
< csr_sb_count( ctx
->indices
)/3; i
++ )
795 u32
* base
= ctx
->indices
+ i
*3;
796 fprintf( fp
, "f %u//%u %u//%u %u//%u\n",
797 base
[2]+1, base
[2]+1,
798 base
[1]+1, base
[1]+1,
807 fprintf( stderr
, "Could not open %s for writing\n", path
);
811 void vmf_entity_transform( vdf_node
*ent
, m4x3f mat
)
813 v3f angles
= {0.f
,0.f
,0.f
};
814 v3f offset
= {0.f
,0.f
,0.f
};
818 scale
= kv_get_float( ent
, "uniformscale", 1.f
);
819 kv_float_array( ent
, "angles", 3, angles
);
820 kv_float_array( ent
, "origin", 3, offset
);
823 m4x3_translate( mat
, offset
);
825 // Make rotation ( Pitch yaw roll // YZX. Source->OpenGL ordering a lil messed up )
826 m4x3_rotate_z( mat
, csr_rad( angles
[1] ) );
827 m4x3_rotate_y( mat
, csr_rad( angles
[0] ) );
828 m4x3_rotate_x( mat
, csr_rad( angles
[2] ) );
831 m4x3_scale( mat
, scale
);
834 u32
vmf_visgroup_id( vdf_node
*root
, const char *name
)
836 vdf_node
*dict
= vdf_next( root
, "visgroups", NULL
);
840 vdf_foreach( dict
, "visgroup", group
)
842 if( !strcmp( kv_get( group
, "name", "" ), name
) )
844 return kv_get_int( group
, "visgroupid", 0 );
852 int vmf_visgroup_match( vdf_node
*ent
, u32 target
)
854 vdf_node
*editor
= vdf_next( ent
, "editor", NULL
);
858 kv_foreach( editor
, "visgroupid", groupe
)
860 if( target
== atoi( groupe
) )