maug
Quick and dirty C mini-augmentation library.
Loading...
Searching...
No Matches
retrotil.h
Go to the documentation of this file.
1
2#ifndef RETROTIL_H
3#define RETROTIL_H
4
5#include <mjson.h>
6#include <mfile.h>
7
16
17#define RETROTILE_PRESENT
18
19typedef int16_t retrotile_coord_t;
20
21#ifndef RETROTILE_TRACE_CHARS
22# define RETROTILE_TRACE_CHARS 0
23#endif /* !RETROTILE_TRACE_TOKENS */
24
25#ifndef RETROTILE_NAME_SZ_MAX
27# define RETROTILE_NAME_SZ_MAX 10
28#endif /* !RETROTILE_NAME_SZ_MAX */
29
30#ifndef RETROTILE_PROP_NAME_SZ_MAX
32# define RETROTILE_PROP_NAME_SZ_MAX 10
33#endif /* !RETROTILE_PROP_NAME_SZ_MAX */
34
35#ifndef RETROTILE_TILE_SCALE_DEFAULT
37# define RETROTILE_TILE_SCALE_DEFAULT 1.0f
38#endif /* !RETROTILE_TILE_SCALE_DEFAULT */
39
40#ifndef RETROTILE_TRACE_LVL
42# define RETROTILE_TRACE_LVL 0
43#endif /* !RETROTILE_TRACE_LVL */
44
45#ifndef RETROTILE_VORONOI_DEFAULT_SPB
46# define RETROTILE_VORONOI_DEFAULT_SPB 8
47#endif /* !RETROTILE_VORONOI_DEFAULT_SPB */
48
49#ifndef RETROTILE_VORONOI_DEFAULT_DRIFT
50# define RETROTILE_VORONOI_DEFAULT_DRIFT 4
51#endif /* !RETROTILE_VORONOI_DEFAULT_DRIFT */
52
53#ifdef MPARSER_TRACE_NAMES
54# define retrotile_mstate_name( state ) gc_retrotile_mstate_names[state]
55#else
56# define retrotile_mstate_name( state ) state
57#endif /* MPARSER_TRACE_NAMES */
58
59#ifndef RETROTILE_PARSER_FLAG_LITERAL_PATHS
65# define RETROTILE_PARSER_FLAG_LITERAL_PATHS 0x02
66#endif /* !RETROTILE_PARSER_FLAG_LITERAL_PATHS */
67
73#define RETROTILE_PARSER_MODE_MAP 0
74
80#define RETROTILE_PARSER_MODE_DEFS 1
81
82#define RETROTILE_CLASS_TABLE( f ) \
83 f( TILE, tile, 0 ) \
84 f( MOBILE, mobile, 1 ) \
85 f( WARP, warp, 2 ) \
86 f( ITEM, item, 3 ) \
87 f( CROP, crop, 4 )
88
93
98
103#define RETROTILE_TILE_FLAG_BLOCK 0x01
104
109#define RETROTILE_TILE_FLAG_RESERVED1 0x02
110
115#define RETROTILE_TILE_FLAG_RESERVED2 0x04
116
121#define RETROTILE_TILE_FLAG_RESERVED3 0x08
122 /* retrotile_defs_types */
124
129#define RETROTILE_PROP_TYPE_OTHER 0
130
135#define RETROTILE_PROP_TYPE_STRING 1
136
141#define RETROTILE_PROP_TYPE_FILE 2
142
147#define RETROTILE_PROP_TYPE_INT 3
148
159#define RETROTILE_DS_FLAG_INIT_DATA 0x02
160
164#define RETROTILE_IDX_FMT "%u"
165
168 size_t sz;
169 uint8_t flags;
170 retroflat_asset_path image_path;
171 size_t x;
172 size_t y;
173 uint16_t tile_class;
174 char warp_dest[RETROTILE_NAME_SZ_MAX + 1];
181 retrotile_coord_t warp_x;
182 retrotile_coord_t warp_y;
184 int8_t no_serial;
185#ifdef RETROFLAT_3D
186 /* TODO: Work this into retrogxc? */
187 struct RETRO3DP_MODEL model;
188#endif /* RETROFLAT_3D */
189#ifdef RETROGXC_PRESENT
190 ssize_t image_cache_id;
191#else
192 struct RETROFLAT_BITMAP image;
193#endif /* RETROGXC_PRESENT */
194};
195 /* retrotile_defs */
197
200 size_t sz;
202 size_t total_sz;
203 uint16_t layer_class;
204};
205
212 size_t sz;
213 /* \brief X position in tilemap tiles. */
214 retrotile_coord_t x;
215 /* \brief Y position in tilemap tiles. */
216 retrotile_coord_t y;
217};
218
224struct RETROTILE {
226 size_t sz;
227 char name[RETROTILE_NAME_SZ_MAX + 1];
228 char tileset[RETROTILE_NAME_SZ_MAX + 1];
230 uint32_t total_sz;
232 uint32_t layers_count;
236 size_t tiles_h;
238 size_t tiles_w;
244};
245
252 int16_t sect_x;
254 int16_t sect_y;
256 int16_t sect_w;
258 int16_t sect_h;
260 int16_t sect_w_half;
262 int16_t sect_h_half;
263 retroflat_tile_t highest_generated;
264 retroflat_tile_t lowest_generated;
265};
266
268 int16_t tiles_changed;
269 retroflat_tile_t center;
270 retroflat_tile_t outside;
273};
274
275#define retrotile_get_tile( tilemap, layer, x, y ) \
276 (retrotile_get_tiles_p( layer )[((y) * (tilemap)->tiles_w) + (x)])
277
278#define retrotile_set_tile( tilemap, layer, x, y, new_val ) \
279 (retrotile_get_tiles_p( layer )[((y) * (tilemap)->tiles_w) + (x)])
280
281#define retrotile_get_tiles_p( layer ) \
282 ((retroflat_tile_t*)(((uint8_t*)(layer)) + \
283 sizeof( struct RETROTILE_LAYER )))
284
285#ifdef MAUG_NO_STDLIB
286/* Loop is slower, but doesn't use memset. */
287/* TODO: This kinda assumes retroflat_tile_t is 8 bits... Fix that! */
288# define retrotile_clear_tiles( t, layer, i ) \
289 assert( 1 == sizeof( retroflat_tile_t ) ); \
290 for( \
291 i = 0 ; \
292 (t)->tiles_w * (t)->tiles_h * sizeof( retroflat_tile_t ) > i ; \
293 i++ \
294 ) { \
295 retrotile_get_tiles_p( layer )[i] = -1; \
296 }
297#else
298# define retrotile_clear_tiles( t, layer, i ) \
299 memset( retrotile_get_tiles_p( layer ), -1, \
300 (t)->tiles_w * (t)->tiles_h * sizeof( retroflat_tile_t ) )
301#endif /* MAUG_NO_STDLIB */
302
307
308typedef MERROR_RETVAL (*retrotile_tj_parse_cb)(
309 const char* dirname, const char* filename, MAUG_MHANDLE* p_tm_h,
310 struct MDATA_VECTOR* p_td, mparser_wait_cb_t wait_cb, void* wait_data,
311 mparser_parse_token_cb token_cb, void* token_cb_data, uint8_t passes,
312 uint8_t flags );
313
315 uint8_t mstate;
316 uint16_t flags;
317 /* TODO: Use flags and combine these. */
318 uint8_t pass;
319 uint8_t passes_max;
321 uint8_t mode;
322 mparser_wait_cb_t wait_cb;
323 void* wait_data;
324 retroflat_ms_t wait_last;
325 size_t layer_tile_iter;
328 int last_prop_type;
329 size_t last_prop_name_sz;
332 char tileset_name[RETROTILE_NAME_SZ_MAX + 1];
333 size_t pass_layer_iter;
339 size_t tiles_w;
340 size_t tiles_h;
341 struct RETROTILE* t;
342 retrotile_tj_parse_cb tj_parse_cb;
348 mparser_parse_token_cb custom_token_cb;
349 void* custom_token_cb_data;
350 struct MJSON_PARSER jparser;
351 struct MDATA_VECTOR* p_tile_defs;
352 char dirname[MAUG_PATH_SZ_MAX + 1];
353 uint16_t layer_class;
354};
355
356/* State Idx JSONKeyWord Parent ParseMode */
357#define RETROTILE_PARSER_MSTATE_TABLE( f ) \
358 f( MTILESTATE_NONE, 0, "", 0, 0 ) \
359 f( MTILESTATE_HEIGHT, 1, "height", 0 , 0 ) \
360 f( MTILESTATE_WIDTH, 2, "width", 0 , 0 ) \
361 f( MTILESTATE_LAYERS, 3, "layers", 0 , 0 ) \
362 f( MTILESTATE_LAYER_DATA, 4, "data", 15 /* LAYER */ , 0 ) \
363 f( MTILESTATE_LAYER_NAME, 5, "name", 15 /* LAYER */ , 0 ) \
364 f( MTILESTATE_TILES, 6, "tiles", 0 , 1 ) \
365 f( MTILESTATE_TILES_ID, 7, "id", 6 /* TILES */ , 1 ) \
366 f( MTILESTATE_TILES_IMAGE, 8, "image", 6 /* TILES */ , 1 ) \
367 f( MTILESTATE_TILESETS, 9, "tilesets", 0 , 0 ) \
368 f( MTILESTATE_TILESETS_SRC, 10, "source", 9 /* TILESETS */ , 0 ) \
369 f( MTILESTATE_TILESETS_FGID, 11, "firstgid", 9 /* TILESETS */ , 0 ) \
370 f( MTILESTATE_TILESETS_PROP, 12, "firstgid", 9 /* TILESETS */ , 0 ) \
371 f( MTILESTATE_GRID, 13, "grid", 0 , 1 ) \
372 f( MTILESTATE_TILES_PROP, 14, "properties", 6 /* TILES */ , 1 ) \
373 f( MTILESTATE_LAYER, 15, "layers", /* [sic] */ 3 , 0 ) \
374 f( MTILESTATE_TILES_PROP_NAME, 16, "name", 14 /* TIL_PROP */ , 1 ) \
375 f( MTILESTATE_TILES_PROP_TYPE, 17, "type", 14 /* TIL_PROP */ , 1 ) \
376 f( MTILESTATE_TILES_PROP_VAL, 18, "value", 14 /* TIL_PROP */ , 1 ) \
377 f( MTILESTATE_PROP, 19, "properties", 0 /* NONE */ , 0 ) \
378 f( MTILESTATE_PROP_NAME, 20, "name", 19 /* PROP */ , 0 ) \
379 f( MTILESTATE_PROP_TYPE, 21, "type", 19 /* PROP */ , 0 ) \
380 f( MTILESTATE_PROP_VAL, 22, "value", 19 /* PROP */ , 0 ) \
381 f( MTILESTATE_LAYER_CLASS, 23, "class", 15 /* LAYER */ , 0 ) \
382 f( MTILESTATE_TILES_CLASS, 24, "type", 6 /* TILES */ , 1 ) \
383 f( MTILESTATE_NAME, 25, "name", 0 , 1 ) \
384 f( MTILESTATE_WANGSETS, 26, "wangsets", 0 , 1 ) \
385 f( MTILESTATE_TPROP, 27, "properties", 0 /* NONE */ , 1 ) \
386 f( MTILESTATE_TPROP_NAME, 28, "name", 27 /* PROP */ , 1 ) \
387 f( MTILESTATE_TPROP_TYPE, 29, "type", 27 /* PROP */ , 1 ) \
388 f( MTILESTATE_TPROP_VAL, 30, "value", 27 /* PROP */ , 1 )
389
390/* TODO: Mine wangsets for slowdown values, etc. */
391
393retrotile_parse_json_c( struct RETROTILE_PARSER* parser, char c );
394
399int retrotile_parse_prop_type( const char* token, size_t token_sz );
400
408mfix_t retrotile_static_rotation_from_dir( const char* dir );
409
435 const char* dirname, const char* filename, MAUG_MHANDLE* p_tilemap_h,
436 struct MDATA_VECTOR* p_tile_defs,
437 mparser_wait_cb_t wait_cb, void* wait_data,
438 mparser_parse_token_cb token_cb, void* token_cb_data, uint8_t passes,
439 uint8_t flags );
440 /* retrotile_parser */
442
448
449typedef MERROR_RETVAL (*retrotile_ani_cb)(
450 void* animation_cb_data, int16_t iter );
451
452typedef MERROR_RETVAL (*retrotile_gen_cb)(
453 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
454 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
455 retrotile_ani_cb animation_cb, void* animation_cb_data );
456
467 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
468 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
469 retrotile_ani_cb animation_cb, void* animation_cb_data );
470
482 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
483 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
484 retrotile_ani_cb animation_cb, void* animation_cb_data );
485
494 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
495 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
496 retrotile_ani_cb animation_cb, void* animation_cb_data );
497
505 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
506 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
507 retrotile_ani_cb animation_cb, void* animation_cb_data );
508 /* retrotile_gen */
510
511struct RETROTILE_LAYER* retrotile_get_layer_p(
512 struct RETROTILE* tilemap, uint32_t layer_idx );
513
514MERROR_RETVAL retrotile_alloc(
515 MAUG_MHANDLE* p_tilemap_h, size_t w, size_t h, size_t layers_count,
516 const char* tilemap_name, const char* tileset_name );
517
518void retrotile_format_asset_path(
519 retroflat_asset_path path_out, const char* afile,
520 struct RETROTILE_PARSER* parser );
521
522MERROR_RETVAL retrotile_clear_refresh( retroflat_pxxy_t y_max );
523
524MERROR_RETVAL retrotile_topdown_draw(
525 struct RETROFLAT_BITMAP* target,
526 struct RETROTILE* t, struct MDATA_VECTOR* t_defs );
527
528#ifdef RETROTIL_C
529
530# include <mparser.h>
531
532/* TODO: Function names should be verb_noun! */
533
534#if RETROTILE_TRACE_LVL > 0
535# define retrotile_parser_mstate( parser, new_mstate ) \
536 parser->mstate = new_mstate; \
537 debug_printf( \
538 RETROTILE_TRACE_LVL, "parser mstate: %d", parser->mstate );
539#else
540# define retrotile_parser_mstate( parser, new_mstate ) \
541 parser->mstate = new_mstate;
542#endif /* RETROTILE_TRACE_LVL */
543
544# define RETROTILE_PARSER_MSTATE_TABLE_CONST( name, idx, tokn, parent, m ) \
545 MAUG_CONST uint8_t SEG_MCONST name = idx;
546
547RETROTILE_PARSER_MSTATE_TABLE( RETROTILE_PARSER_MSTATE_TABLE_CONST )
548
549#ifdef MPARSER_TRACE_NAMES
550# define RETROTILE_PARSER_MSTATE_TABLE_NAME( name, idx, tokn, parent, m ) \
551 #name,
552
553static MAUG_CONST char* SEG_MCONST gc_retrotile_mstate_names[] = {
554 RETROTILE_PARSER_MSTATE_TABLE( RETROTILE_PARSER_MSTATE_TABLE_NAME )
555 ""
556};
557#endif /* MPARSER_TRACE_NAMES */
558
559# define RETROTILE_PARSER_MSTATE_TABLE_TOKEN( name, idx, tokn, parent, m ) \
560 tokn,
561
562static MAUG_CONST char* SEG_MCONST gc_retrotile_mstate_tokens[] = {
563 RETROTILE_PARSER_MSTATE_TABLE( RETROTILE_PARSER_MSTATE_TABLE_TOKEN )
564 ""
565};
566
567# define RETROTILE_PARSER_MSTATE_TABLE_PARNT( name, idx, tokn, parent, m ) \
568 parent,
569
570static MAUG_CONST uint8_t SEG_MCONST gc_retrotile_mstate_parents[] = {
571 RETROTILE_PARSER_MSTATE_TABLE( RETROTILE_PARSER_MSTATE_TABLE_PARNT )
572 0
573};
574
575# define RETROTILE_PARSER_MSTATE_TABLE_MODE( name, idx, tokn, parent, m ) \
576 m,
577
578static MAUG_CONST uint8_t SEG_MCONST gc_retrotile_mstate_modes[] = {
579 RETROTILE_PARSER_MSTATE_TABLE( RETROTILE_PARSER_MSTATE_TABLE_MODE )
580 0
581};
582
583# define RETROTILE_CLASS_TABLE_CONSTS( A, a, i ) \
584 MAUG_CONST uint8_t SEG_MCONST RETROTILE_CLASS_ ## A = i;
585
586RETROTILE_CLASS_TABLE( RETROTILE_CLASS_TABLE_CONSTS )
587
588/* === */
589
590static void retrotile_parser_match_token(
591 const char* token, size_t token_sz, struct RETROTILE_PARSER* parser
592) {
593 size_t j = 1;
594
595 /* Figure out what the key is for. */
596 while( '\0' != gc_retrotile_mstate_tokens[j][0] ) {
597 if(
598 /* Make sure tokens match. */
599 maug_strlen( gc_retrotile_mstate_tokens[j] ) != token_sz ||
600 0 != strncmp(
601 token, gc_retrotile_mstate_tokens[j], token_sz
602 )
603 ) {
604 j++;
605 continue;
606
607 } else if(
608 /* This state can only be
609 * reached THROUGH that parent state. This allows us to have
610 * keys with the same name but different parents!
611 */
612 parser->mstate != gc_retrotile_mstate_parents[j]
613 ) {
614#ifdef RETROTILE_TRACE_TOKENS
615 debug_printf(
617 "found token \"%s\" "
618#ifdef MPARSER_TRACE_NAMES
619 "but incorrect parent %s (%d) (needs %s (%d))!",
620#else
621 "but incorrect parent %d (needs %d)!",
622#endif /* MPARSER_TRACE_NAMES */
623 token,
624#ifdef MPARSER_TRACE_NAMES
625 retrotile_mstate_name( parser->mstate ),
626 parser->mstate,
627 retrotile_mstate_name( gc_retrotile_mstate_parents[j] ),
628 gc_retrotile_mstate_parents[j]
629#else
630 parser->mstate,
631 gc_retrotile_mstate_parents[j]
632#endif /* MPARSER_TRACE_NAMES */
633 );
634#endif /* !RETROTILE_TRACE_TOKENS */
635 j++;
636 continue;
637
638 } else if( parser->mode != gc_retrotile_mstate_modes[j] ) {
639#ifdef RETROTILE_TRACE_TOKENS
640 debug_printf(
641 RETROTILE_TRACE_LVL, "found token %s but incorrect mode %u!",
642 token,
643 gc_retrotile_mstate_modes[j] );
644#endif /* !RETROTILE_TRACE_TOKENS */
645 j++;
646 continue;
647
648 } else {
649 /* Found it! */
650#ifdef RETROTILE_TRACE_TOKENS
651 debug_printf(
653 "found token \"%s\" "
654#ifdef MPARSER_TRACE_NAMES
655 "under correct parent %s (%d)!",
656#else
657 "under correct parent %d!",
658#endif /* MPARSER_TRACE_NAMES */
659 token,
660#ifdef MPARSER_TRACE_NAMES
661 retrotile_mstate_name( parser->mstate ),
662 parser->mstate
663#else
664 parser->mstate
665#endif /* MPARSER_TRACE_NAMES */
666 );
667#endif /* !RETROTILE_TRACE_TOKENS */
668
669 retrotile_parser_mstate( parser, j );
670 return;
671 }
672 }
673}
674
675/* === */
676
677MERROR_RETVAL retrotile_parser_parse_tiledef_token(
678 const char* token, size_t token_sz, void* parser_arg
679) {
680 MERROR_RETVAL retval = MERROR_OK;
681 struct RETROTILE_TILE_DEF* tile_def = NULL;
682 struct RETROTILE_PARSER* parser = (struct RETROTILE_PARSER*)parser_arg;
683 size_t tileset_id_parsed = 0;
684
685 /* We don't lock the vector right away, since we might reallocate tile defs
686 * later on, below.
687 */
688
689 /* Try the custom parser. */
690 if(
691 NULL != parser->custom_token_cb &&
692 /* MERROR_PREEMPT is dealt with in cleanup. */
693 MERROR_OK != (retval = parser->custom_token_cb(
694 token, token_sz, parser_arg ))
695 ) {
696 goto cleanup;
697 }
698
699 if( MJSON_PSTATE_OBJECT_VAL != mjson_parser_pstate( &(parser->jparser) ) ) {
700 /* Not a token we have to worry about! */
701 retrotile_parser_match_token( token, token_sz, parser );
702 goto cleanup;
703 }
704
705 if( MTILESTATE_TILES_ID == parser->mstate ) {
706 retrotile_parser_mstate( parser, MTILESTATE_TILES );
707 if( 0 == parser->pass ) {
708 /* Parse tile ID. */
709 tileset_id_parsed = maug_atou32( token, token_sz, 10 );
710 if( tileset_id_parsed > parser->tileset_id_cur ) {
711 parser->tileset_id_cur = tileset_id_parsed;
712#if RETROTILE_TRACE_LVL > 0
713 debug_printf(
715 "new highest tile ID: " SIZE_T_FMT, parser->tileset_id_cur );
716#endif /* RETROTILE_TRACE_LVL */
717 }
718 } else {
719 assert( 0 < mdata_vector_ct( parser->p_tile_defs ) );
720 parser->tileset_id_cur = maug_atou32( token, token_sz, 10 );
721#if RETROTILE_TRACE_LVL > 0
722 debug_printf(
724 "next tile ID: " SIZE_T_FMT, parser->tileset_id_cur );
725#endif /* RETROTILE_TRACE_LVL */
726 }
727 retrotile_parser_mstate( parser, MTILESTATE_TILES );
728
729 } else if( MTILESTATE_TILES_IMAGE == parser->mstate ) {
730 if( 1 == parser->pass ) {
731 /* Need this pass 1 so tile_defs vector is allocated. */
732 mdata_vector_lock( parser->p_tile_defs );
733 tile_def = mdata_vector_get(
734 parser->p_tile_defs, parser->tileset_id_cur,
735 struct RETROTILE_TILE_DEF );
736 assert( NULL != tile_def );
737
738 /* Parse tile image. */
739 if(
742 ) {
743 mfile_assign_path( tile_def->image_path, token, 0 );
744 } else {
745 mfile_assign_path(
746 tile_def->image_path, token, MFILE_ASSIGN_FLAG_TRIM_EXT );
747 }
748
749 /* Setup tile_def sz for serializing. */
750 tile_def->sz = sizeof( struct RETROTILE_TILE_DEF );
751
752#if RETROTILE_TRACE_LVL > 0
753 debug_printf(
754 RETROTILE_TRACE_LVL, "set tile ID " SIZE_T_FMT " to: %s",
755 parser->tileset_id_cur, tile_def->image_path );
756#endif /* RETROTILE_TRACE_LVL */
757 }
758 retrotile_parser_mstate( parser, MTILESTATE_TILES );
759
760 } else if( MTILESTATE_TILES_CLASS == parser->mstate ) {
761 if( 1 == parser->pass ) {
762 /* Set the class from the pass 1 so the custom function can use
763 * it on pass 2 even if it's alphabetically out of order.
764 * (Tiled calls it "type" and puts it near the bottom!)
765 *
766 * We can't do this on pass 0 since tiles aren't allocated yet!
767 */
768 mdata_vector_lock( parser->p_tile_defs );
769 tile_def = mdata_vector_get(
770 parser->p_tile_defs, parser->tileset_id_cur,
771 struct RETROTILE_TILE_DEF );
772 assert( NULL != tile_def );
773 assert( 0 == tile_def->tile_class );
774
775#if RETROTILE_TRACE_LVL > 0
776 #define RETROTILE_CLASS_TABLE_SET( A, a, i ) \
777 } else if( 0 == strncmp( #a, token, maug_strlen( #a ) + 1 ) ) { \
778 tile_def->tile_class = RETROTILE_CLASS_ ## A; \
779 debug_printf( RETROTILE_TRACE_LVL, \
780 "set tile " SIZE_T_FMT " type: " #a " (%u)", \
781 parser->tileset_id_cur, tile_def->tile_class );
782#else
783 #define RETROTILE_CLASS_TABLE_SET( A, a, i ) \
784 } else if( 0 == strncmp( #a, token, maug_strlen( #a ) + 1 ) ) { \
785 tile_def->tile_class = RETROTILE_CLASS_ ## A;
786#endif /* RETROTILE_TRACE_LVL */
787
788 if( 0 ) {
789 RETROTILE_CLASS_TABLE( RETROTILE_CLASS_TABLE_SET )
790 } else {
791 tile_def->tile_class = RETROTILE_CLASS_TILE;
792#if RETROTILE_TRACE_LVL > 0
793 debug_printf( RETROTILE_TRACE_LVL,
794 "set tile " SIZE_T_FMT " type: tile (%u)",
795 parser->tileset_id_cur, tile_def->tile_class );
796#endif /* RETROTILE_TRACE_LVL */
797 }
798 }
799 retrotile_parser_mstate( parser, MTILESTATE_TILES );
800
801 } else if( MTILESTATE_TILES_PROP_NAME == parser->mstate ) {
802#if RETROTILE_TRACE_LVL > 0
803 debug_printf( RETROTILE_TRACE_LVL, "parsing property: %s", token );
804#endif /* RETROTILE_TRACE_LVL */
805 maug_mzero( parser->last_prop_name, RETROTILE_PROP_NAME_SZ_MAX + 1 );
806 maug_strncpy( parser->last_prop_name, token, RETROTILE_PROP_NAME_SZ_MAX );
807 retrotile_parser_mstate( parser, MTILESTATE_TILES_PROP );
808
809 } else if( MTILESTATE_TILES_PROP_TYPE == parser->mstate ) {
810#if RETROTILE_TRACE_LVL > 0
811 debug_printf( RETROTILE_TRACE_LVL, "property %s is type: %s",
812 parser->last_prop_name, token );
813#endif /* RETROTILE_TRACE_LVL */
814 parser->last_prop_type = retrotile_parse_prop_type( token, token_sz );
815 retrotile_parser_mstate( parser, MTILESTATE_TILES_PROP );
816
817 } else if( MTILESTATE_TILES_PROP_VAL == parser->mstate ) {
818 /* This would be ideal to be handled in the custom token parser callback.
819 */
820
821 if( 1 == parser->pass ) {
822 mdata_vector_lock( parser->p_tile_defs );
823 tile_def = mdata_vector_get(
824 parser->p_tile_defs, parser->tileset_id_cur,
825 struct RETROTILE_TILE_DEF );
826 assert( NULL != tile_def );
827
828 if( 0 == strncmp( "warp_dest", parser->last_prop_name, 10 ) ) {
829 maug_mzero( tile_def->warp_dest, RETROTILE_NAME_SZ_MAX );
830 maug_strncpy( tile_def->warp_dest, token, RETROTILE_NAME_SZ_MAX );
831#if RETROTILE_TRACE_LVL > 0
832 debug_printf(
833 RETROTILE_TRACE_LVL, "set tile " SIZE_T_FMT " warp_dest: %s",
834 parser->tileset_id_cur, tile_def->warp_dest );
835#endif /* RETROTILE_TRACE_LVL */
836
837 } else if( 0 == strncmp( "warp_x", parser->last_prop_name, 7 ) ) {
838 tile_def->warp_x = maug_atos32( token, token_sz );
839#if RETROTILE_TRACE_LVL > 0
840 debug_printf(
841 RETROTILE_TRACE_LVL, "set tile " SIZE_T_FMT " warp_x: %d",
842 parser->tileset_id_cur, tile_def->warp_x );
843#endif /* RETROTILE_TRACE_LVL */
844
845 } else if( 0 == strncmp( "warp_y", parser->last_prop_name, 7 ) ) {
846 tile_def->warp_y = maug_atos32( token, token_sz );
847#if RETROTILE_TRACE_LVL > 0
848 debug_printf(
849 RETROTILE_TRACE_LVL, "set tile " SIZE_T_FMT " warp_y: %d",
850 parser->tileset_id_cur, tile_def->warp_y );
851#endif /* RETROTILE_TRACE_LVL */
852
853 }
854 }
855
856 maug_mzero( parser->last_prop_name, RETROTILE_PROP_NAME_SZ_MAX + 1 );
857 retrotile_parser_mstate( parser, MTILESTATE_TILES_PROP );
858
859 } else if( MTILESTATE_NAME == parser->mstate ) {
860 maug_strncpy( parser->tileset_name, token, RETROTILE_NAME_SZ_MAX );
861#if RETROTILE_TRACE_LVL > 0
862 debug_printf(
863 RETROTILE_TRACE_LVL, "tileset name: %s", parser->tileset_name );
864#endif /* RETROTILE_TRACE_LVL */
865
866 retrotile_parser_mstate( parser, 0 );
867
868 } else if( MTILESTATE_TPROP_NAME == parser->mstate ) {
869 maug_mzero( parser->last_prop_name, RETROTILE_PROP_NAME_SZ_MAX + 1 );
870 maug_strncpy(
872 parser->last_prop_name_sz = token_sz;
873 retrotile_parser_mstate( parser, MTILESTATE_TPROP );
874
875 } else if( MTILESTATE_TPROP_TYPE == parser->mstate ) {
876#if RETROTILE_TRACE_LVL > 0
877 debug_printf( RETROTILE_TRACE_LVL, "property %s is type: %s",
878 parser->last_prop_name, token );
879#endif /* RETROTILE_TRACE_LVL */
880 parser->last_prop_type = retrotile_parse_prop_type( token, token_sz );
881 retrotile_parser_mstate( parser, MTILESTATE_TPROP );
882
883 } else if( MTILESTATE_TPROP_VAL == parser->mstate ) {
884 /* This should be handled in the custom_cb above! */
885 maug_mzero( parser->last_prop_name, RETROTILE_PROP_NAME_SZ_MAX + 1 );
886 retrotile_parser_mstate( parser, MTILESTATE_TPROP );
887 }
888
889cleanup:
890
891 mdata_vector_unlock( parser->p_tile_defs );
892
893 if( MERROR_PREEMPT == retval ) {
894 /* Reset custom callback retval. */
895 retval = MERROR_OK;
896 }
897
898 return retval;
899}
900
901/* === */
902
903MERROR_RETVAL retrotile_parser_parse_token(
904 const char* token, size_t token_sz, void* parser_arg
905) {
906 MERROR_RETVAL retval = MERROR_OK;
907 struct RETROTILE_LAYER* tiles_layer = NULL;
908 struct RETROTILE_PARSER* parser = (struct RETROTILE_PARSER*)parser_arg;
909 retroflat_tile_t* tiles = NULL;
910
911 /* Try the custom parser. */
912 if(
913 NULL != parser->custom_token_cb &&
914 /* MERROR_PREEMPT is dealt with in cleanup. */
915 MERROR_OK != (retval = parser->custom_token_cb(
916 token, token_sz, parser_arg ))
917 ) {
918 goto cleanup;
919 }
920
921 if( MJSON_PSTATE_LIST == mjson_parser_pstate( &(parser->jparser) ) ) {
922 /* We're parsing a list. What lists do we care about? */
923
924 /* Please note that this is for new tokens encountered inside of a list.
925 * For dealing with the closing of a list, see
926 * retrotile_json_close_list()!
927 */
928
929 if(
930 1 == parser->pass &&
931 MTILESTATE_LAYER_DATA == parser->mstate
932 ) {
933 /* This is a list of layer data... AKA tiles! */
934
935 /*
936 assert( NULL != *(parser->p_tilemap_h) );
937 maug_mlock( *(parser->p_tilemap_h), tilemap );
938 maug_cleanup_if_null_alloc( struct RETROTILE*, tilemap );
939 */
940
941 /*
942 debug_printf( RETROTILE_TRACE_LVL,
943 "selecting layer " SIZE_T_FMT "...",
944 parser->pass_layer_iter );
945 */
946 assert( NULL != parser->t );
947 tiles_layer = retrotile_get_layer_p(
948 parser->t, parser->pass_layer_iter );
949 assert( NULL != tiles_layer );
950
951 /* Apply the class parsed previously. */
952 tiles_layer->layer_class = parser->layer_class;
953
954 tiles = retrotile_get_tiles_p( tiles_layer );
955
956 /* Parse tilemap tile. */
957 /*
958 debug_printf( RETROTILE_TRACE_LVL,
959 "layer " SIZE_T_FMT " tile: " SIZE_T_FMT " (tiles: %p)",
960 parser->pass_layer_iter, parser->layer_tile_iter,
961 tiles );
962 */
963 assert( NULL != token );
964 assert( NULL != parser );
965 assert( NULL != tiles );
966
967 if(
968 parser->layer_tile_iter >=
969 parser->t->tiles_w * parser->t->tiles_h
970 ) {
971 /* Tile is outside of layer! */
972 error_printf(
973 "tile " SIZE_T_FMT " outside of layer tile buffer size "
974 SIZE_T_FMT "!",
975 parser->layer_tile_iter,
976 parser->t->tiles_w * parser->t->tiles_h );
977 retval = MERROR_OVERFLOW;
978 goto cleanup;
979 }
980
981 assert( 0 == tiles[parser->layer_tile_iter] );
982
983 tiles[parser->layer_tile_iter] = atoi( token );
984
985 }
986 parser->layer_tile_iter++;
987 goto cleanup;
988
989 } else if(
990 MJSON_PSTATE_OBJECT_VAL ==
991 mjson_parser_pstate( &(parser->jparser) )
992 ) {
993
994 /* Pay attention to the retrotile_parser_mstate() calls here. We don't
995 * have a stack of states, and we really only track a few we're
996 * interested in. Even if we don't process their data here, we still
997 * use retrotile_parser_mstate() to move the parser mstate back up
998 * to the parent mstate when we're done with it. This kind of "fakes" a
999 * stack (in a well-formed file, of course).
1000 */
1001
1002 if( MTILESTATE_TILESETS_FGID == parser->mstate ) {
1003 if( 1 == parser->pass ) {
1004 parser->t->tileset_fgid = maug_atou32( token, token_sz, 10 );
1005#if RETROTILE_TRACE_LVL > 0
1006 debug_printf(
1007 RETROTILE_TRACE_LVL, "tileset FGID set to: " SIZE_T_FMT,
1008 parser->t->tileset_fgid );
1009#endif /* RETROTILE_TRACE_LVL */
1010 }
1011 retrotile_parser_mstate( parser, MTILESTATE_TILESETS );
1012
1013 } else if( MTILESTATE_TILESETS_SRC == parser->mstate ) {
1014 if( 1 == parser->pass ) {
1015#if RETROTILE_TRACE_LVL > 0
1016 debug_printf( RETROTILE_TRACE_LVL, "parsing %s...", token );
1017#endif /* RETROTILE_TRACE_LVL */
1018 parser->tj_parse_cb(
1019 parser->dirname, token, NULL, parser->p_tile_defs,
1020 parser->wait_cb, parser->wait_data,
1021 parser->custom_token_cb, parser->custom_token_cb_data,
1022 parser->passes_max, parser->flags );
1023 }
1024 retrotile_parser_mstate( parser, MTILESTATE_TILESETS );
1025
1026 } else if( MTILESTATE_HEIGHT == parser->mstate ) {
1027 if( 0 == parser->pass ) {
1028 /* Need this to allocate on pass 1. */
1029 parser->tiles_h = atoi( token );
1030#if RETROTILE_TRACE_LVL > 0
1031 debug_printf(
1032 RETROTILE_TRACE_LVL, "tilemap height: " SIZE_T_FMT,
1033 parser->tiles_h );
1034#endif /* RETROTILE_TRACE_LVL */
1035 }
1036 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1037
1038 } else if( MTILESTATE_WIDTH == parser->mstate ) {
1039 if( 0 == parser->pass ) {
1040 /* Need this to allocate on pass 1. */
1041 parser->tiles_w = atoi( token );
1042#if RETROTILE_TRACE_LVL > 0
1043 debug_printf(
1044 RETROTILE_TRACE_LVL, "tilemap width: " SIZE_T_FMT,
1045 parser->tiles_w );
1046#endif /* RETROTILE_TRACE_LVL */
1047 }
1048 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1049
1050 } else if( MTILESTATE_LAYER_NAME == parser->mstate ) {
1051 /* TODO: Store */
1052 retrotile_parser_mstate( parser, MTILESTATE_LAYER );
1053
1054 } else if( MTILESTATE_LAYER_CLASS == parser->mstate ) {
1055 /* TODO: Use the class table to create layers for e.g. crops, items. */
1056 if( 0 == strncmp( "mobile", token, 7 ) ) {
1057#if RETROTILE_TRACE_LVL > 0
1058 debug_printf( RETROTILE_TRACE_LVL,
1059 "layer " SIZE_T_FMT " type: mobile",
1060 parser->pass_layer_iter );
1061#endif /* RETROTILE_TRACE_LVL */
1062 parser->layer_class = RETROTILE_CLASS_MOBILE;
1063 } else {
1064#if RETROTILE_TRACE_LVL > 0
1065 debug_printf( RETROTILE_TRACE_LVL,
1066 "layer " SIZE_T_FMT " type: tile",
1067 parser->pass_layer_iter );
1068#endif /* RETROTILE_TRACE_LVL */
1069 parser->layer_class = RETROTILE_CLASS_TILE;
1070 }
1071 retrotile_parser_mstate( parser, MTILESTATE_LAYER );
1072
1073 } else if( MTILESTATE_PROP_NAME == parser->mstate ) {
1074 maug_mzero( parser->last_prop_name, RETROTILE_PROP_NAME_SZ_MAX + 1 );
1075 maug_strncpy(
1077 parser->last_prop_name_sz = token_sz;
1078 retrotile_parser_mstate( parser, MTILESTATE_PROP );
1079
1080 } else if( MTILESTATE_PROP_TYPE == parser->mstate ) {
1081#if RETROTILE_TRACE_LVL > 0
1082 debug_printf( RETROTILE_TRACE_LVL, "property %s is type: %s",
1083 parser->last_prop_name, token );
1084#endif /* RETROTILE_TRACE_LVL */
1085 parser->last_prop_type = retrotile_parse_prop_type( token, token_sz );
1086 retrotile_parser_mstate( parser, MTILESTATE_PROP );
1087
1088 } else if( MTILESTATE_PROP_VAL == parser->mstate ) {
1089 /* We're dealing with properties of the tilemap. */
1090 if( 0 == strncmp( parser->last_prop_name, "name", 5 ) ) {
1091#if RETROTILE_TRACE_LVL > 0
1092 debug_printf( RETROTILE_TRACE_LVL, "tilemap name: %s", token );
1093#endif /* RETROTILE_TRACE_LVL */
1094 maug_strncpy( parser->tilemap_name, token, RETROTILE_NAME_SZ_MAX );
1095 }
1096
1097 maug_mzero( parser->last_prop_name, RETROTILE_PROP_NAME_SZ_MAX + 1 );
1098 retrotile_parser_mstate( parser, MTILESTATE_PROP );
1099 }
1100 goto cleanup;
1101 }
1102
1103 retrotile_parser_match_token( token, token_sz, parser );
1104
1105cleanup:
1106
1107 return retval;
1108}
1109
1110/* === */
1111
1112MERROR_RETVAL retrotile_json_close_list( void* parg ) {
1113 struct RETROTILE_PARSER* parser = (struct RETROTILE_PARSER*)parg;
1114
1115 if( MTILESTATE_LAYER_DATA == parser->mstate ) {
1116 assert( RETROTILE_PARSER_MODE_MAP == parser->mode );
1117#if RETROTILE_TRACE_LVL > 0
1118 debug_printf( RETROTILE_TRACE_LVL, "parsed " SIZE_T_FMT " tiles!",
1119 parser->layer_tile_iter );
1120#endif /* RETROTILE_TRACE_LVL */
1121 assert( parser->layer_tile_iter > 0 );
1122 retrotile_parser_mstate( parser, MTILESTATE_LAYER );
1123
1124 } else if( MTILESTATE_LAYERS == parser->mstate ) {
1125 assert( RETROTILE_PARSER_MODE_MAP == parser->mode );
1126 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1127
1128 } else if( MTILESTATE_TILESETS == parser->mstate ) {
1129 assert( RETROTILE_PARSER_MODE_MAP == parser->mode );
1130 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1131
1132 } else if( MTILESTATE_TILES_PROP == parser->mstate ) {
1133 assert( RETROTILE_PARSER_MODE_DEFS == parser->mode );
1134 retrotile_parser_mstate( parser, MTILESTATE_TILES );
1135
1136 } else if( MTILESTATE_TILES == parser->mstate ) {
1137 assert( RETROTILE_PARSER_MODE_DEFS == parser->mode );
1138 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1139
1140 } else if( MTILESTATE_PROP == parser->mstate ) {
1141 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1142
1143 } else if( MTILESTATE_TPROP == parser->mstate ) {
1144 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1145 }
1146
1147 return MERROR_OK;
1148}
1149
1150/* === */
1151
1152MERROR_RETVAL retrotile_json_open_obj( void* parg ) {
1153 struct RETROTILE_PARSER* parser = (struct RETROTILE_PARSER*)parg;
1154
1155 if( MTILESTATE_LAYERS == parser->mstate ) {
1156 assert( RETROTILE_PARSER_MODE_MAP == parser->mode );
1157 /* Reset on open so count is retained for allocating after first
1158 * pass. */
1159 parser->layer_tile_iter = 0;
1160 retrotile_parser_mstate( parser, MTILESTATE_LAYER );
1161 }
1162
1163 return MERROR_OK;
1164}
1165
1166/* === */
1167
1168MERROR_RETVAL retrotile_json_close_obj( void* parg ) {
1169 struct RETROTILE_PARSER* parser = (struct RETROTILE_PARSER*)parg;
1170
1171 if( MTILESTATE_LAYER == parser->mstate ) {
1172 assert( RETROTILE_PARSER_MODE_MAP == parser->mode );
1173#if RETROTILE_TRACE_LVL > 0
1174 debug_printf( RETROTILE_TRACE_LVL,
1175 "incrementing pass layer to " SIZE_T_FMT " after " SIZE_T_FMT
1176 " tiles...",
1177 parser->pass_layer_iter + 1, parser->layer_tile_iter );
1178#endif /* RETROTILE_TRACE_LVL */
1179 parser->pass_layer_iter++;
1180 retrotile_parser_mstate( parser, MTILESTATE_LAYERS );
1181
1182 } else if( MTILESTATE_GRID == parser->mstate ) {
1183 retrotile_parser_mstate( parser, MTILESTATE_NONE );
1184 }
1185
1186 return MERROR_OK;
1187}
1188
1189/* === */
1190
1191int retrotile_parse_prop_type( const char* token, size_t token_sz ) {
1192 int out = RETROTILE_PROP_TYPE_OTHER;
1193
1194 if( 0 == strncmp( "string", token, 7 ) ) {
1196 } else if( 0 == strncmp( "file", token, 5 ) ) {
1198 } else if( 0 == strncmp( "int", token, 4 ) ) {
1200 }
1201
1202 return out;
1203}
1204
1205/* === */
1206
1207mfix_t retrotile_static_rotation_from_dir( const char* dir ) {
1208 mfix_t static_rotate_out = 0;
1209
1210 if( NULL == dir ) {
1211 return 0;
1212 }
1213
1214 /* Translate dir into rotation value. */
1215 if( 0 == strncmp( dir, "NW", 2 ) ) {
1216 static_rotate_out = mfix_from_f( 90.0f );
1217 } else if( 0 == strncmp( dir, "SW", 2 ) ) {
1218 static_rotate_out = mfix_from_f( 180.0f );
1219 } else if( 0 == strncmp( dir, "SE", 2 ) ) {
1220 static_rotate_out = mfix_from_f( 270.0f );
1221
1222 } else if( 0 == strncmp( dir, "W", 1 ) ) {
1223 static_rotate_out = mfix_from_f( 90.0f );
1224 } else if( 0 == strncmp( dir, "S", 1 ) ) {
1225 static_rotate_out = mfix_from_f( 180.0f );
1226 } else if( 0 == strncmp( dir, "E", 1 ) ) {
1227 static_rotate_out = mfix_from_f( 270.0f );
1228
1229 } else {
1230 static_rotate_out = 0;
1231 }
1232
1233 return static_rotate_out;
1234}
1235
1236/* === */
1237
1239 const char* dirname, const char* filename, MAUG_MHANDLE* p_tilemap_h,
1240 struct MDATA_VECTOR* p_tile_defs, mparser_wait_cb_t wait_cb, void* wait_data,
1241 mparser_parse_token_cb token_cb, void* token_cb_data, uint8_t passes,
1242 uint8_t flags
1243) {
1244 MERROR_RETVAL retval = MERROR_OK;
1245 MAUG_MHANDLE parser_h = (MAUG_MHANDLE)NULL;
1246 struct RETROTILE_PARSER* parser = NULL;
1247 char filename_path[MAUG_PATH_SZ_MAX];
1248 mfile_t tile_file;
1249 char c;
1250 char* filename_ext = NULL;
1251
1252 /* Initialize parser. */
1253 parser_h = maug_malloc( 1, sizeof( struct RETROTILE_PARSER ) );
1254 maug_cleanup_if_null_alloc( MAUG_MHANDLE, parser_h );
1255
1256 maug_mlock( parser_h, parser );
1257 maug_cleanup_if_null_alloc( struct RETROTILE_PARSER*, parser );
1258 maug_mzero( parser, sizeof( struct RETROTILE_PARSER ) );
1259
1260 parser->flags = flags;
1261 parser->tj_parse_cb = retrotile_parse_json_file;
1262 parser->custom_token_cb = token_cb;
1263 parser->custom_token_cb_data = token_cb_data;
1264
1265 maug_strncpy( parser->dirname, dirname, MAUG_PATH_SZ_MAX );
1266
1267 if( 2 > passes ) {
1268#if RETROTILE_TRACE_LVL > 0
1269 debug_printf( RETROTILE_TRACE_LVL,
1270 "increasing parse passes to minimum, 2!" );
1271#endif /* RETROTILE_TRACE_LVL */
1272 passes = 2;
1273 }
1274
1275 parser->passes_max = passes;
1276
1277 /* Setup filename path. */
1278 maug_mzero( filename_path, MAUG_PATH_SZ_MAX );
1279 /* TODO: Configurable path. */
1280 maug_snprintf(
1281 filename_path, MAUG_PATH_SZ_MAX, "%s/%s", dirname, filename );
1282
1283#if RETROTILE_TRACE_LVL > 0
1284 debug_printf( RETROTILE_TRACE_LVL, "opening %s...", filename_path );
1285#endif /* RETROTILE_TRACE_LVL */
1286
1287 retval = mfile_open_read( filename_path, &tile_file );
1288 maug_cleanup_if_not_ok();
1289
1290 /* Parse JSON and react to state. */
1291 for( parser->pass = 0 ; passes > parser->pass ; parser->pass++ ) {
1292#if RETROTILE_TRACE_LVL > 0
1293 debug_printf( RETROTILE_TRACE_LVL, "beginning pass #%u...",
1294 parser->pass );
1295#endif /* RETROTILE_TRACE_LVL */
1296
1297 /* Reset tilemap parser. */
1298 parser->mstate = 0;
1299
1300 /* Reset JSON parser. */
1301 maug_mzero( &(parser->jparser.base), sizeof( struct MJSON_PARSER ) );
1302
1303 parser->wait_cb = wait_cb;
1304 parser->wait_data = wait_data;
1305 parser->jparser.base.wait_cb = wait_cb;
1306 parser->jparser.base.wait_data = wait_data;
1307
1308 /* Figure out if we're parsing a .tmj or .tsj. */
1309 filename_ext = maug_strrchr( filename, '.' );
1310 if( NULL == filename_ext ) {
1311 error_printf( "could not parse filename extension!" );
1312 retval = MERROR_FILE;
1313 goto cleanup;
1314 }
1315 if( 's' == filename_ext[2] ) {
1316#if RETROTILE_TRACE_LVL > 0
1317 debug_printf( RETROTILE_TRACE_LVL,
1318 "(tile_defs pass %u)", parser->pass );
1319#endif /* RETROTILE_TRACE_LVL */
1321 parser->jparser.token_parser = retrotile_parser_parse_tiledef_token;
1322 parser->jparser.token_parser_arg = parser;
1323 parser->jparser.close_list = retrotile_json_close_list;
1324 parser->jparser.close_list_arg = parser;
1325 parser->jparser.close_obj = retrotile_json_close_obj;
1326 parser->jparser.close_obj_arg = parser;
1327 /*
1328 parser->jparser.base.close_val = retrotile_json_close_val;
1329 parser->jparser.base.close_val_arg = parser;
1330 */
1331 parser->p_tile_defs = p_tile_defs;
1332
1333 assert( NULL != p_tile_defs );
1334 if( 1 == parser->pass ) {
1335 /* Allocate tile defs based on highest tile ID found on
1336 * first pass.
1337 */
1338 assert( 0 < parser->tileset_id_cur );
1339#if RETROTILE_TRACE_LVL > 0
1340 debug_printf(
1341 RETROTILE_TRACE_LVL, "allocating " SIZE_T_FMT " tile defs...",
1342 parser->tileset_id_cur + 1 );
1343#endif /* RETROTILE_TRACE_LVL */
1344 mdata_vector_fill(
1345 parser->p_tile_defs, parser->tileset_id_cur + 1,
1346 sizeof( struct RETROTILE_TILE_DEF ) );
1347 }
1348 } else {
1349#if RETROTILE_TRACE_LVL > 0
1350 debug_printf( RETROTILE_TRACE_LVL, "(tilemap pass %u)", parser->pass );
1351#endif /* RETROTILE_TRACE_LVL */
1353
1354 parser->jparser.close_list = retrotile_json_close_list;
1355 parser->jparser.close_list_arg = parser;
1356 parser->jparser.open_obj = retrotile_json_open_obj;
1357 parser->jparser.open_obj_arg = parser;
1358 parser->jparser.close_obj = retrotile_json_close_obj;
1359 parser->jparser.close_obj_arg = parser;
1360 parser->jparser.token_parser = retrotile_parser_parse_token;
1361 parser->jparser.token_parser_arg = parser;
1362 parser->p_tile_defs = p_tile_defs;
1363
1364 assert( NULL != p_tilemap_h );
1365 assert( NULL != p_tile_defs );
1366 if( 1 == parser->pass ) {
1367 /* Allocate tiles for the new layers. */
1368 retval = retrotile_alloc(
1369 p_tilemap_h, parser->tiles_w, parser->tiles_h,
1370 parser->pass_layer_iter, parser->tilemap_name,
1371 parser->tileset_name );
1372 maug_cleanup_if_not_ok();
1373 maug_mlock( *p_tilemap_h, parser->t );
1374 }
1375 parser->pass_layer_iter = 0;
1376 }
1377
1378 while( tile_file.has_bytes( &tile_file ) ) {
1379 tile_file.read_int( &tile_file, (uint8_t*)&c, 1, 0 );
1380#if RETROTILE_TRACE_CHARS > 0
1381 debug_printf( RETROTILE_TRACE_CHARS, "%c", c );
1382#endif /* RETROTILE_TRACE_CHARS */
1383 retval = mjson_parse_c( &(parser->jparser), c );
1384 if( MERROR_OK != retval ) {
1385 error_printf( "error parsing JSON!" );
1386 goto cleanup;
1387 }
1388 }
1389
1390 tile_file.seek( &tile_file, 0 );
1391
1392 filename_ext = maug_strrchr( filename, '.' );
1393 if( NULL == filename_ext ) {
1394 error_printf( "could not parse filename extension!" );
1395 retval = MERROR_FILE;
1396 goto cleanup;
1397 }
1398 if( 's' != filename_ext[2] ) {
1399#if RETROTILE_TRACE_LVL > 0
1400 debug_printf( RETROTILE_TRACE_LVL,
1401 "pass %u found " SIZE_T_FMT " layers",
1402 parser->pass, parser->pass_layer_iter );
1403#endif /* RETROTILE_TRACE_LVL */
1404 }
1405 }
1406
1407#if RETROTILE_TRACE_LVL > 0
1408 debug_printf(
1409 RETROTILE_TRACE_LVL, "finished parsing %s, retval: %d",
1410 filename_path, retval );
1411#endif /* RETROTILE_TRACE_LVL */
1412
1413cleanup:
1414
1415 if( NULL != parser ) {
1416 if( NULL != parser->t ) {
1417 maug_munlock( *p_tilemap_h, parser->t );
1418 }
1419 maug_munlock( parser_h, parser );
1420 }
1421
1422 if( (MAUG_MHANDLE)NULL != parser_h ) {
1423 maug_mfree( parser_h );
1424 }
1425
1426 return retval;
1427}
1428
1429/* === */
1430
1431static retroflat_tile_t retrotile_gen_diamond_square_rand(
1432 retroflat_tile_t min_z, retroflat_tile_t max_z, uint32_t tuning,
1433 retroflat_tile_t top_left_z
1434) {
1435 retroflat_tile_t avg = top_left_z;
1436
1437 if( 8 > rand() % 10 ) {
1438 /* avg = min_z + (rand() % (max_z - min_z)); */
1439 avg -= (min_z / tuning) + (rand() % (max_z / tuning));
1440 /* } else {
1441 avg += (min_z / 10) + (rand() % (max_z / 10)); */
1442 }
1443
1444 /* Clamp the result. */
1445
1446 if( min_z > avg ) {
1447 avg = min_z;
1448 }
1449
1450 if( max_z < avg ) {
1451 avg = max_z;
1452 }
1453
1454 return avg;
1455}
1456
1457/* === */
1458
1459static void retrotile_gen_diamond_square_corners(
1460 int16_t corners_x[2][2], int16_t corners_y[2][2],
1462 uint32_t tuning, struct RETROTILE_DATA_DS* data_ds,
1463 struct RETROTILE_LAYER* layer, struct RETROTILE* t
1464) {
1465 int16_t iter_x = 0,
1466 iter_y = 0;
1467 retroflat_tile_t* tile_iter = NULL;
1468 retroflat_tile_t top_left_z = 0;
1469
1470 /* Generate missing corner data. Loop through X/Y coords stored in
1471 * corners_x/corners_y convenience arrays.
1472 */
1473 for( iter_y = 0 ; iter_y < 2 ; iter_y++ ) {
1474 for( iter_x = 0 ; iter_x < 2 ; iter_x++ ) {
1475
1476 /* Make sure corner X is in bounds. */
1477 corners_x[iter_x][iter_y] =
1478 (data_ds->sect_x - 1) + (iter_x * data_ds->sect_w);
1479 if( 0 > corners_x[iter_x][iter_y] ) {
1480 corners_x[iter_x][iter_y] += 1;
1481 }
1482
1483 /* Make sure corner Y is in bounds. */
1484 corners_y[iter_x][iter_y] =
1485 (data_ds->sect_y - 1) + (iter_y * data_ds->sect_h);
1486 if( 0 > corners_y[iter_x][iter_y] ) {
1487 corners_y[iter_x][iter_y] += 1;
1488 }
1489 }
1490 }
1491
1492 /* Should be handled by the check above. */
1493 assert( 0 <= corners_x[0][0] );
1494 assert( 0 <= corners_y[0][0] );
1495 assert( t->tiles_w > corners_x[0][0] );
1496 assert( t->tiles_h > corners_y[0][0] );
1497
1498 /* Grab the top-left Z-value to anchor generated corners to. */
1499 top_left_z = retrotile_get_tile(
1500 t, layer,
1501 corners_x[0][0],
1502 corners_y[0][0] );
1503
1504 if( 0 > top_left_z ) {
1505 retrotile_get_tile(
1506 t, layer,
1507 corners_x[0][0] >= 0 ? corners_x[0][0] : 0,
1508 corners_y[0][0] >= 0 ? corners_y[0][0] : 0 ) = max_z;
1509 top_left_z = max_z;
1510 }
1511
1512 /* Fill in missing corners. */
1513 for( iter_y = 0 ; iter_y < 2 ; iter_y++ ) {
1514 for( iter_x = 0 ; iter_x < 2 ; iter_x++ ) {
1515 /* Grab a pointer to the corner so we can modify it easily. */
1516 tile_iter = &(retrotile_get_tile(
1517 t, layer,
1518 corners_x[iter_x][iter_y],
1519 corners_y[iter_x][iter_y] ));
1520
1521 /* Check if corner is already filled in. */
1522 if( -1 != *tile_iter ) {
1523#if RETROTILE_TRACE_LVL > 0
1524 debug_printf(
1525 RETROTILE_TRACE_LVL, "corner coord %d x %d present: %d",
1526 corners_x[iter_x][iter_y], corners_y[iter_x][iter_y],
1527 retrotile_get_tile(
1528 t, layer,
1529 corners_x[iter_x][iter_y],
1530 corners_y[iter_x][iter_y] ) );
1531#endif /* RETROTILE_TRACE_LVL */
1532 continue;
1533 }
1534
1535 /* Generate a new value for this corner. */
1536 *tile_iter = retrotile_gen_diamond_square_rand(
1537 min_z, max_z, tuning, top_left_z );
1538
1539#if RETROTILE_TRACE_LVL > 0
1540 debug_printf( RETROTILE_TRACE_LVL,
1541 "missing corner coord %d x %d: %d",
1542 corners_x[iter_x][iter_y], corners_y[iter_x][iter_y],
1543 *tile_iter );
1544#endif /* RETROTILE_TRACE_LVL */
1545 }
1546 }
1547}
1548
1549/* === */
1550
1551static retroflat_tile_t retrotile_gen_diamond_square_avg(
1552 int16_t corners_x[2][2], int16_t corners_y[2][2],
1553 struct RETROTILE* t, struct RETROTILE_LAYER* layer
1554) {
1555 retroflat_tile_t* tile_iter = NULL;
1556 int16_t iter_x = 0,
1557 iter_y = 0;
1558 retroflat_tile_t avg = 0;
1559
1560 /* Average corner data. */
1561 for( iter_y = 0 ; 2 > iter_y ; iter_y++ ) {
1562 for( iter_x = 0 ; 2 > iter_x ; iter_x++ ) {
1563 tile_iter = &(retrotile_get_tile(
1564 t, layer,
1565 corners_x[iter_x][iter_y],
1566 corners_y[iter_x][iter_y] ));
1567 assert( -1 != *tile_iter );
1568 /*
1569 debug_printf(
1570 RETROTILE_TRACE_LVL, "%d: adding from coords %d x %d: %d",
1571 iter_depth,
1572 corners_x[iter_x][iter_y], corners_y[iter_x][iter_y],
1573 *tile_iter ); */
1574 avg += *tile_iter;
1575 }
1576 }
1577
1578 /* TODO: Use right shift? */
1579 avg /= 4;
1580
1581 return avg;
1582}
1583
1584/* === */
1585
1587 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
1588 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
1589 retrotile_ani_cb animation_cb, void* animation_cb_data
1590) {
1591 int16_t iter_x = 0,
1592 iter_y = 0
1593#if RETROTILE_TRACE_LVL > 0
1594 , iter_depth = 0;
1595#else
1596 ;
1597#endif /* RETROTILE_TRACE_LVL */
1598 int16_t corners_x[2][2];
1599 int16_t corners_y[2][2];
1600 int32_t avg = 0;
1601 /* size_t tile_idx = 0; */
1602 struct RETROTILE_DATA_DS data_ds_sub;
1603 MAUG_MHANDLE data_ds_h = (MAUG_MHANDLE)NULL;
1604 struct RETROTILE_DATA_DS* data_ds = NULL;
1605 /* retroflat_tile_t* tiles = NULL; */
1606 MERROR_RETVAL retval = MERROR_OK;
1607 struct RETROTILE_LAYER* layer = NULL;
1608 retroflat_tile_t* tile_iter = NULL;
1609 uint8_t free_ds_data = 0;
1610#ifdef MAUG_NO_STDLIB
1611 size_t i = 0;
1612#endif /* MAUG_NO_STDLIB */
1613
1614 /*
1615 maug_mlock( t->tiles, tiles );
1616 maug_cleanup_if_null_alloc( struct GRIDCITY_TILE*, tiles );
1617 */
1618
1619 #define _retrotile_ds_update_statistics( data, tile ) \
1620 /* Gather statistics. */ \
1621 if( (data)->highest_generated < (tile) && 32767 > (tile) ) { \
1622 (data)->highest_generated = (tile); \
1623 } \
1624 if( (data)->lowest_generated > (tile) && 0 < (tile) ) { \
1625 (data)->lowest_generated = (tile); \
1626 }
1627
1628 layer = retrotile_get_layer_p( t, layer_idx );
1629
1630 if(
1631 NULL == data ||
1633 ) {
1634 /* This must be the first call, so initialize or allocate a new struct.
1635 */
1636 if( NULL == data ) {
1637 /* An internal struct needs to be allocated before initialization. */
1638 data_ds_h = maug_malloc( 1, sizeof( struct RETROTILE_DATA_DS ) );
1639 maug_cleanup_if_null_alloc( MAUG_MHANDLE, data_ds_h );
1640 free_ds_data = 1;
1641 maug_mlock( data_ds_h, data_ds );
1642 maug_cleanup_if_null_alloc( struct RETROTILE_DATA_DS*, data_ds );
1643 } else {
1644 data_ds = (struct RETROTILE_DATA_DS*)data;
1645 }
1646
1647 /* Initialize passed tilemap while we're handling first call stuff. */
1648 retrotile_clear_tiles( t, layer, i );
1649
1650 /* Initialize DS struct from tilemap properties. */
1651 maug_mzero( data_ds, sizeof( struct RETROTILE_DATA_DS ) );
1652 data_ds->sect_w = t->tiles_w;
1653 data_ds->sect_h = t->tiles_h;
1654 data_ds->sect_w_half = data_ds->sect_w >> 1;
1655 data_ds->sect_h_half = data_ds->sect_h >> 1;
1656 data_ds->lowest_generated = 32767;
1657
1658 /* Disable this flag for subsequent calls. */
1660 } else {
1661 data_ds = (struct RETROTILE_DATA_DS*)data;
1662 }
1663 assert( NULL != data_ds );
1664
1665 /* Trivial case; end recursion. */
1666 if( 0 == data_ds->sect_w ) {
1667#if RETROTILE_TRACE_LVL > 0
1668 debug_printf(
1669 RETROTILE_TRACE_LVL, "%d return: null sector", iter_depth );
1670#endif /* RETROTILE_TRACE_LVL */
1671 goto cleanup;
1672 }
1673
1674 if(
1675 data_ds->sect_x + data_ds->sect_w > t->tiles_w ||
1676 data_ds->sect_y + data_ds->sect_h > t->tiles_h
1677 ) {
1678#if RETROTILE_TRACE_LVL > 0
1679 debug_printf(
1680 RETROTILE_TRACE_LVL, "%d return: overflow sector", iter_depth );
1681#endif /* RETROTILE_TRACE_LVL */
1682 goto cleanup;
1683 }
1684
1685#if RETROTILE_TRACE_LVL > 0
1686 iter_depth = t->tiles_w / data_ds->sect_w;
1687#endif /* RETROTILE_TRACE_LVL */
1688
1689 /* Generate/grab corners before averaging them! */
1690 retrotile_gen_diamond_square_corners(
1691 corners_x, corners_y, min_z, max_z, tuning, data_ds, layer, t );
1692
1693 if( 2 == data_ds->sect_w || 2 == data_ds->sect_h ) {
1694 /* Nothing to average, this sector is just corners! */
1695#if RETROTILE_TRACE_LVL > 0
1696 debug_printf(
1698 "%d return: reached innermost point", iter_depth );
1699#endif /* RETROTILE_TRACE_LVL */
1700 goto cleanup; /* Skip further descent regardless. */
1701 }
1702
1703 avg =
1704 retrotile_gen_diamond_square_avg( corners_x, corners_y, t, layer );
1705
1706#if RETROTILE_TRACE_LVL > 0
1707 debug_printf( RETROTILE_TRACE_LVL, "avg: " S32_FMT, avg );
1708#endif /* RETROTILE_TRACE_LVL */
1709
1710 tile_iter = &(retrotile_get_tile(
1711 t, layer,
1712 data_ds->sect_x + data_ds->sect_w_half,
1713 data_ds->sect_y + data_ds->sect_h_half ));
1714 if( -1 != *tile_iter ) {
1715#if RETROTILE_TRACE_LVL > 0
1716 debug_printf( RETROTILE_TRACE_LVL, "avg already present at %d x %d!",
1717 data_ds->sect_x + data_ds->sect_w_half,
1718 data_ds->sect_y + data_ds->sect_h_half );
1719#endif /* RETROTILE_TRACE_LVL */
1720 goto cleanup;
1721 }
1722 *tile_iter = avg;
1723 _retrotile_ds_update_statistics( data_ds, avg );
1724
1725 /* assert( 0 <= tiles[tile_idx].terrain );
1726
1727 maug_munlock( city->tiles, tiles );
1728 tiles = NULL; */
1729
1730 /* Recurse into subsectors. */
1731 for(
1732 iter_y = data_ds->sect_y ;
1733 iter_y < (data_ds->sect_y + data_ds->sect_h) ;
1734 iter_y++
1735 ) {
1736 for(
1737 iter_x = data_ds->sect_x ;
1738 iter_x < (data_ds->sect_x + data_ds->sect_w) ;
1739 iter_x++
1740 ) {
1741 data_ds_sub.sect_x = data_ds->sect_x + iter_x;
1742
1743 data_ds_sub.sect_y = data_ds->sect_y + iter_y;
1744
1745 data_ds_sub.sect_w = data_ds->sect_w_half;
1746 data_ds_sub.sect_h = data_ds->sect_h_half;
1747 data_ds_sub.sect_w_half = data_ds_sub.sect_w >> 1;
1748 data_ds_sub.sect_h_half = data_ds_sub.sect_h >> 1;
1749 data_ds_sub.lowest_generated = 32767;
1750 data_ds_sub.highest_generated = 0;
1751
1752#if RETROTILE_TRACE_LVL > 0
1753 debug_printf(
1754 RETROTILE_TRACE_LVL, "%d: child sector at %d x %d, %d wide",
1755 iter_depth,
1756 data_ds_sub.sect_x, data_ds_sub.sect_y, data_ds_sub.sect_w );
1757#endif /* RETROTILE_TRACE_LVL */
1758
1760 t, min_z, max_z, tuning, layer_idx, flags, &data_ds_sub,
1761 animation_cb, animation_cb_data );
1762 maug_cleanup_if_not_ok();
1763
1764 _retrotile_ds_update_statistics(
1765 data_ds, data_ds_sub.highest_generated );
1766 _retrotile_ds_update_statistics(
1767 data_ds, data_ds_sub.lowest_generated );
1768 }
1769 }
1770
1771 if(
1772 data_ds->sect_w == (t->tiles_w >> 1) &&
1773 NULL != animation_cb
1774 ) {
1775 retval = animation_cb( animation_cb_data, iter_y );
1776 maug_cleanup_if_not_ok();
1777 }
1778
1779#if RETROTILE_TRACE_LVL > 0
1780 debug_printf(
1781 RETROTILE_TRACE_LVL, "%d return: all sectors complete", iter_depth );
1782#endif /* RETROTILE_TRACE_LVL */
1783
1784cleanup:
1785
1786 if( free_ds_data && NULL != data_ds ) {
1787 maug_munlock( data_ds_h, data_ds );
1788 }
1789
1790 if( free_ds_data && (MAUG_MHANDLE)NULL != data_ds_h ) {
1791 maug_mfree( data_ds_h );
1792 }
1793
1794 return retval;
1795}
1796
1797/* === */
1798
1800 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
1801 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
1802 retrotile_ani_cb animation_cb, void* animation_cb_data
1803) {
1804 size_t x = 0,
1805 y = 0;
1806 int16_t offset_x = 0,
1807 offset_y = 0,
1808 finished = 0;
1809 MERROR_RETVAL retval = MERROR_OK;
1810 struct RETROTILE_LAYER* layer = NULL;
1811 int16_t spb = RETROTILE_VORONOI_DEFAULT_SPB;
1812 int16_t drift = RETROTILE_VORONOI_DEFAULT_DRIFT;
1813 MAUG_MHANDLE temp_grid_h = (MAUG_MHANDLE)NULL;
1814 retroflat_tile_t* temp_grid = NULL;
1815 retroflat_tile_t* tiles = NULL;
1816 /* Only use 4 cardinal directions. */
1817 int8_t side_iter = 0;
1818#ifdef MAUG_NO_STDLIB
1819 size_t i = 0;
1820#endif /* MAUG_NO_STDLIB */
1821
1822 layer = retrotile_get_layer_p( t, 0 );
1823
1824 tiles = retrotile_get_tiles_p( layer );
1825
1826 /* Initialize grid to empty. */
1827 retrotile_clear_tiles( t, layer, i );
1828
1829 /* Generate the initial sector starting points. */
1830 for( y = 0 ; t->tiles_w > y ; y += spb ) {
1831 for( x = 0 ; t->tiles_w > x ; x += spb ) {
1832 offset_x = x + ((drift * -1) + (rand() % drift));
1833 offset_y = y + ((drift * -1) + (rand() % drift));
1834
1835 /* Clamp sector offsets onto map borders. */
1836 if( 0 > offset_x ) {
1837 offset_x = 0;
1838 }
1839 if( offset_x >= t->tiles_w ) {
1840 offset_x = t->tiles_w - 1;
1841 }
1842 if( 0 > offset_y ) {
1843 offset_y = 0;
1844 }
1845 if( offset_y >= t->tiles_h ) {
1846 offset_y = t->tiles_h - 1;
1847 }
1848
1849 retrotile_get_tile( t, layer, offset_x, offset_y ) =
1850 min_z + (rand() % max_z);
1851 }
1852 }
1853
1854 temp_grid_h = maug_malloc(
1855 sizeof( retroflat_tile_t ), t->tiles_w * t->tiles_h );
1856 maug_cleanup_if_null_alloc( MAUG_MHANDLE, temp_grid_h );
1857
1858 maug_mlock( temp_grid_h, temp_grid );
1859 maug_cleanup_if_null_alloc( retroflat_tile_t*, temp_grid );
1860
1861 /* Grow the sector starting points. */
1862 while( !finished ) {
1863 if( NULL != animation_cb ) {
1864 retval = animation_cb( animation_cb_data, -1 );
1865 maug_cleanup_if_not_ok();
1866 }
1867
1868 /* Prepare sampling grid so we're working from unexpanded sections
1869 * below.
1870 */
1871 memcpy(
1872 temp_grid, tiles,
1873 sizeof( retroflat_tile_t ) * t->tiles_w * t->tiles_h );
1874
1875 /* Starting another pass, assume finished until proven otherwise. */
1876 finished = 1;
1877 for( y = 0 ; t->tiles_h > y ; y++ ) {
1878 for( x = 0 ; t->tiles_w > x ; x++ ) {
1879 if( -1 == retrotile_get_tile( t, layer, x, y ) ) {
1880 /* If there are still unfilled tiles, we're not finished
1881 * yet!
1882 */
1883 finished = 0;
1884
1885 /* Skip filled tile. */
1886 continue;
1887 }
1888
1889
1890 for( side_iter = 0 ; 4 > side_iter ; side_iter++ ) {
1891#if RETROTILE_TRACE_LVL > 0
1892 debug_printf( RETROTILE_TRACE_LVL,
1893 SIZE_T_FMT " (%d), " SIZE_T_FMT " (%d) ("
1894 SIZE_T_FMT ", " SIZE_T_FMT ")",
1895 x,
1896 gc_retroflat_offsets4_x[side_iter],
1897 y,
1898 gc_retroflat_offsets4_y[side_iter],
1899 t->tiles_w, t->tiles_h );
1900#endif /* RETROTILE_TRACE_LVL */
1901
1902 /* Iterate through directions to expand. */
1903 /* TODO: Add tuning to select directional probability. */
1904 if(
1905 t->tiles_w > x + gc_retroflat_offsets4_x[side_iter] &&
1906 t->tiles_h > y + gc_retroflat_offsets4_y[side_iter] &&
1907 -1 == temp_grid[
1908 ((y + gc_retroflat_offsets4_y[side_iter]) *
1909 t->tiles_w) +
1910 (x + gc_retroflat_offsets4_x[side_iter])]
1911 ) {
1912 /* Copy center tile to this direction. */
1913 retrotile_get_tile( t, layer,
1914 x + gc_retroflat_offsets4_x[side_iter],
1915 y + gc_retroflat_offsets4_y[side_iter] ) =
1916 retrotile_get_tile( t, layer, x, y );
1917 break;
1918 }
1919 }
1920 }
1921 }
1922 }
1923
1924cleanup:
1925
1926 if( NULL != temp_grid ) {
1927 maug_munlock( temp_grid_h, temp_grid );
1928 }
1929
1930 if( (MAUG_MHANDLE)NULL != temp_grid_h ) {
1931 maug_mfree( temp_grid_h );
1932 }
1933
1934 return retval;
1935}
1936
1937/* === */
1938
1940 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
1941 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
1942 retrotile_ani_cb animation_cb, void* animation_cb_data
1943) {
1944 MERROR_RETVAL retval = MERROR_OK;
1945 size_t x = 0,
1946 y = 0;
1947 int16_t side_iter = 0,
1948 sides_avail = 0,
1949 sides_sum = 0;
1950 /* Sides start from 12 on the clock (up). */
1951 struct RETROTILE_LAYER* layer = NULL;
1952
1953 assert( NULL != t );
1954 layer = retrotile_get_layer_p( t, layer_idx );
1955 assert( NULL != layer );
1956
1957 for( y = 0 ; t->tiles_h > y ; y++ ) {
1958 if( NULL != animation_cb ) {
1959 retval = animation_cb( animation_cb_data, y );
1960 maug_cleanup_if_not_ok();
1961 }
1962 for( x = 0 ; t->tiles_w > x ; x++ ) {
1963 /* Reset average. */
1964 sides_avail = 0;
1965 sides_sum = 0;
1966
1967 /* Grab values for available sides. */
1968 for( side_iter = 0 ; 8 > side_iter ; side_iter++ ) {
1969 if(
1970 t->tiles_w <= x + gc_retroflat_offsets8_x[side_iter] ||
1971 t->tiles_h <= y + gc_retroflat_offsets8_y[side_iter]
1972 ) {
1973 continue;
1974 }
1975
1976 sides_avail++;
1977#if RETROTILE_TRACE_LVL > 0
1978 debug_printf(
1980 "si %d: x, y: " SIZE_T_FMT " (+%d), " SIZE_T_FMT
1981 " (+%d) idx: " SIZE_T_FMT,
1982 side_iter,
1983 x + gc_retroflat_offsets8_x[side_iter],
1984 gc_retroflat_offsets8_x[side_iter],
1985 y + gc_retroflat_offsets8_y[side_iter],
1986 gc_retroflat_offsets8_y[side_iter],
1987 ((y + gc_retroflat_offsets8_y[side_iter]) * t->tiles_w) +
1988 x + gc_retroflat_offsets8_x[side_iter] );
1989#endif /* RETROTILE_TRACE_LVL */
1990 sides_sum += retrotile_get_tile(
1991 t, layer,
1992 x + gc_retroflat_offsets8_x[side_iter],
1993 y + gc_retroflat_offsets8_y[side_iter] );
1994 }
1995
1996 retrotile_get_tile( t, layer, x, y ) = sides_sum / sides_avail;
1997 }
1998 }
1999
2000cleanup:
2001
2002 return retval;
2003}
2004
2005/* === */
2006
2008 struct RETROTILE* t, retroflat_tile_t min_z, retroflat_tile_t max_z,
2009 uint32_t tuning, size_t layer_idx, uint8_t flags, void* data,
2010 retrotile_ani_cb animation_cb, void* animation_cb_data
2011) {
2012 MERROR_RETVAL retval = MERROR_OK;
2013 struct RETROTILE_DATA_BORDER* borders =
2014 (struct RETROTILE_DATA_BORDER*)data;
2015 size_t i = 0,
2016 x = 0,
2017 y = 0,
2018 x_plus_1 = 0,
2019 y_plus_1 = 0,
2020 side = 0;
2021 int16_t ctr_iter = 0,
2022 outside_iter = 0;
2023 struct RETROTILE_LAYER* layer = NULL;
2024
2025 assert( NULL != t );
2026 layer = retrotile_get_layer_p( t, layer_idx );
2027 assert( NULL != layer );
2028
2029 /* Reset tile counter for all defined borders. */
2030 for( i = 0 ; 0 <= borders[i].center ; i++ ) {
2031 borders[i].tiles_changed = 0;
2032 }
2033
2034#if RETROTILE_TRACE_LVL > 0
2035 debug_printf( RETROTILE_TRACE_LVL, "adding borders..." );
2036#endif /* RETROTILE_TRACE_LVL */
2037
2038 for( y = 0 ; t->tiles_h > y ; y++ ) {
2039 for( x = 0 ; t->tiles_w > x ; x++ ) {
2040 i = 0;
2041 while( 0 <= borders[i].center ) {
2042 /* Compare/grab current center tile. */
2043 ctr_iter = retrotile_get_tile( t, layer, x, y );
2044#if RETROTILE_TRACE_LVL > 0
2045 debug_printf( RETROTILE_TRACE_LVL,
2046 "x: " SIZE_T_FMT ", y: " SIZE_T_FMT ", 0x%04x vs 0x%04x",
2047 x, y, ctr_iter, borders[i].center );
2048#endif /* RETROTILE_TRACE_LVL */
2049 if( ctr_iter != borders[i].center ) {
2050 i++;
2051 continue;
2052 }
2053
2054#if RETROTILE_TRACE_LVL > 0
2055 debug_printf( RETROTILE_TRACE_LVL, "comparing sides..." );
2056#endif /* RETROTILE_TRACE_LVL */
2057
2058 /* Zeroth pass: look for stick-outs. */
2059 for( side = 0 ; 8 > side ; side += 2 ) {
2060 if(
2061 x + gc_retroflat_offsets8_x[side] > t->tiles_w ||
2062 y + gc_retroflat_offsets8_y[side] > t->tiles_h
2063 ) {
2064 /* Skip out-of-bounds. */
2065 continue;
2066 }
2067 /* Get the outside tile on this side. */
2068 outside_iter = retrotile_get_tile( t, layer,
2069 x + gc_retroflat_offsets8_x[side],
2070 y + gc_retroflat_offsets8_y[side] );
2071
2072 /* Get the outside tile next two clock-steps from this one.
2073 */
2074 if( side + 4 < 8 ) {
2075 x_plus_1 = x + gc_retroflat_offsets8_x[side + 4];
2076 y_plus_1 = y + gc_retroflat_offsets8_y[side + 4];
2077 } else {
2078 x_plus_1 = x + gc_retroflat_offsets8_x[side - 4];
2079 y_plus_1 = y + gc_retroflat_offsets8_y[side - 4];
2080 }
2081
2082 if(
2083 x_plus_1 < t->tiles_w && y_plus_1 < t->tiles_h &&
2084 outside_iter == borders[i].outside &&
2085 outside_iter == retrotile_get_tile( t, layer,
2086 x_plus_1, y_plus_1 )
2087 ) {
2088 /* This has the outside on two opposing sides, so just
2089 * erase it and use the outside. */
2090 retrotile_get_tile( t, layer, x, y ) =
2091 borders[i].outside;
2092 borders[i].tiles_changed++;
2093 goto tile_done;
2094 }
2095 }
2096
2097
2098 /* First pass: look for corners. */
2099 for( side = 0 ; 8 > side ; side += 2 ) {
2100 if(
2101 x + gc_retroflat_offsets8_x[side] > t->tiles_w ||
2102 y + gc_retroflat_offsets8_y[side] > t->tiles_h
2103 ) {
2104 /* Skip out-of-bounds. */
2105 continue;
2106 }
2107 /* Get the outside tile on this side. */
2108 outside_iter = retrotile_get_tile( t, layer,
2109 x + gc_retroflat_offsets8_x[side],
2110 y + gc_retroflat_offsets8_y[side] );
2111
2112 /* Get the outside tile next two clock-steps from this one.
2113 */
2114 if( side + 2 < 8 ) {
2115 x_plus_1 = x + gc_retroflat_offsets8_x[side + 2];
2116 y_plus_1 = y + gc_retroflat_offsets8_y[side + 2];
2117 } else {
2118 x_plus_1 = x + gc_retroflat_offsets8_x[0];
2119 y_plus_1 = y + gc_retroflat_offsets8_y[0];
2120 }
2121
2122 if(
2123 x_plus_1 < t->tiles_w && y_plus_1 < t->tiles_h &&
2124 outside_iter == borders[i].outside &&
2125 outside_iter == retrotile_get_tile( t, layer,
2126 x_plus_1, y_plus_1 )
2127 ) {
2128 /* This has the outside on two sides, so use a corner. */
2129 retrotile_get_tile( t, layer, x, y ) =
2130 borders[i].mod_to[side + 1 < 8 ? side + 1 : 0];
2131 borders[i].tiles_changed++;
2132 goto tile_done;
2133 }
2134 }
2135
2136 /* Second pass (if first pass fails): look for edges. */
2137 for( side = 0 ; 8 > side ; side += 2 ) {
2138 if(
2139 x + gc_retroflat_offsets8_x[side] > t->tiles_w ||
2140 y + gc_retroflat_offsets8_y[side] > t->tiles_h
2141 ) {
2142 /* Skip out-of-bounds. */
2143 continue;
2144 }
2145 /* Get the outside tile on this side. */
2146 outside_iter = retrotile_get_tile( t, layer,
2147 x + gc_retroflat_offsets8_x[side],
2148 y + gc_retroflat_offsets8_y[side] );
2149
2150 if( outside_iter == borders[i].outside ) {
2151 /* It only matches on this side. */
2152#if RETROTILE_TRACE_LVL > 0
2153 debug_printf( RETROTILE_TRACE_LVL, "replacing..." );
2154#endif /* RETROTILE_TRACE_LVL */
2155 retrotile_get_tile( t, layer, x, y ) =
2156 borders[i].mod_to[side];
2157 borders[i].tiles_changed++;
2158 goto tile_done;
2159 }
2160 }
2161
2162tile_done:
2163 /* Tile replaced or not replaceable. */
2164 break;
2165 }
2166 }
2167 }
2168
2169 return retval;
2170}
2171
2172/* === */
2173
2174struct RETROTILE_LAYER* retrotile_get_layer_p(
2175 struct RETROTILE* tilemap, uint32_t layer_idx
2176) {
2177 struct RETROTILE_LAYER* layer_iter = NULL;
2178 uint8_t* tilemap_buf = (uint8_t*)tilemap;
2179
2180 if( 0 == tilemap->layers_count || layer_idx >= tilemap->layers_count ) {
2181 error_printf( "invalid layer " U32_FMT
2182 " requested (of " U32_FMT ")!",
2183 layer_idx, tilemap->layers_count );
2184 return NULL;
2185 }
2186
2187 /* Advance to first grid. */
2188 tilemap_buf += sizeof( struct RETROTILE );
2189 layer_iter = (struct RETROTILE_LAYER*)tilemap_buf;
2190 while( layer_idx > 0 ) {
2191 tilemap_buf += layer_iter->total_sz;
2192 layer_iter = (struct RETROTILE_LAYER*)tilemap_buf;
2193 layer_idx--;
2194 }
2195
2196 return layer_iter;
2197}
2198
2199/* === */
2200
2201MERROR_RETVAL retrotile_alloc(
2202 MAUG_MHANDLE* p_tilemap_h, size_t w, size_t h, size_t layers_count,
2203 const char* tilemap_name, const char* tileset_name
2204) {
2205 struct RETROTILE_LAYER* layer_iter = NULL;
2206 MERROR_RETVAL retval = MERROR_OK;
2207 size_t tilemap_sz = 0;
2208 struct RETROTILE* tilemap = NULL;
2209 size_t i = 0;
2210
2211 tilemap_sz = sizeof( struct RETROTILE ) +
2212 (layers_count * sizeof( struct RETROTILE_LAYER )) +
2213 (layers_count * (w * h * sizeof( retroflat_tile_t ) ));
2214
2215#if RETROTILE_TRACE_LVL > 0
2216 debug_printf(
2217 RETROTILE_TRACE_LVL, "allocating new tilemap " SIZE_T_FMT "x" SIZE_T_FMT
2218 " tiles, " SIZE_T_FMT " layers (" SIZE_T_FMT " bytes)...",
2219 w, h, layers_count, tilemap_sz );
2220#endif /* RETROTILE_TRACE_LVL */
2221
2222 *p_tilemap_h = maug_malloc( 1, tilemap_sz );
2223 maug_cleanup_if_null_alloc( MAUG_MHANDLE, *p_tilemap_h );
2224
2225 maug_mlock( *p_tilemap_h, tilemap );
2226 maug_cleanup_if_null_alloc( struct RETROTILE*, tilemap );
2227
2228 maug_mzero( tilemap, tilemap_sz );
2229 tilemap->total_sz = tilemap_sz;
2230 tilemap->layers_count = layers_count;
2231 tilemap->tiles_w = w;
2232 tilemap->tiles_h = h;
2234 tilemap->sz = sizeof( struct RETROTILE );
2235
2236 maug_strncpy( tilemap->name, tilemap_name, RETROTILE_NAME_SZ_MAX );
2237
2238 maug_strncpy( tilemap->tileset, tileset_name, RETROTILE_NAME_SZ_MAX );
2239
2240 for( i = 0 ; layers_count > i ; i++ ) {
2241 layer_iter = retrotile_get_layer_p( tilemap, i );
2242 assert( NULL != layer_iter );
2243 layer_iter->total_sz = sizeof( struct RETROTILE_LAYER ) +
2244 (w * h * sizeof( retroflat_tile_t ));
2245 maug_cleanup_if_not_ok();
2246 layer_iter->sz = sizeof( struct RETROTILE_LAYER );
2247 }
2248
2249cleanup:
2250
2251 if( NULL != tilemap ) {
2252 maug_munlock( *p_tilemap_h, tilemap );
2253 }
2254
2255 return retval;
2256}
2257
2258/* === */
2259
2260void retrotile_format_asset_path(
2261 retroflat_asset_path path_out, const char* afile,
2262 struct RETROTILE_PARSER* parser
2263) {
2264 /* Load the portrait. */
2265 maug_mzero( path_out, MAUG_PATH_SZ_MAX + 1 );
2266 maug_snprintf( path_out, MAUG_PATH_SZ_MAX, "%s/%s",
2267 parser->dirname, afile );
2268}
2269
2270/* === */
2271
2272MERROR_RETVAL retrotile_clear_refresh( retroflat_pxxy_t y_max ) {
2273 MERROR_RETVAL retval = MERROR_OK;
2274#ifndef RETROFLAT_NO_VIEWPORT_REFRESH
2275 int16_t x = 0,
2276 y = 0;
2277
2278#if RETROTILE_TRACE_LVL > 0
2279 debug_printf( RETROTILE_TRACE_LVL,
2280 "clearing " SIZE_T_FMT " vertical viewport pixels (" SIZE_T_FMT
2281 " rows)...",
2282 y_max, y_max / RETROFLAT_TILE_H );
2283#endif /* RETROTILE_TRACE_LVL */
2284
2285 retroflat_viewport_lock_refresh();
2286 for( y = 0 ; y_max > y ; y += RETROFLAT_TILE_H ) {
2287 for( x = 0 ; retroflat_viewport_screen_w() > x ; x += RETROFLAT_TILE_W ) {
2288 retroflat_viewport_set_refresh( x, y, -1 );
2289 }
2290 }
2291
2292cleanup:
2293
2294 retroflat_viewport_unlock_refresh();
2295
2296#endif /* !RETROFLAT_NO_VIEWPORT_REFRESH */
2297
2298 return retval;
2299}
2300
2301/* === */
2302
2303MERROR_RETVAL retrotile_topdown_draw(
2304 struct RETROFLAT_BITMAP* target,
2305 struct RETROTILE* t, struct MDATA_VECTOR* t_defs
2306) {
2307 int16_t x = 0,
2308 y = 0,
2309 x_tile = 0,
2310 y_tile = 0;
2311 retroflat_tile_t tile_id = 0;
2312 struct RETROTILE_LAYER* layer = NULL;
2313 struct RETROTILE_TILE_DEF* t_def = NULL;
2314 MERROR_RETVAL retval = MERROR_OK;
2315
2316 layer = retrotile_get_layer_p( t, 0 );
2317
2318 mdata_vector_lock( t_defs );
2319 /* TODO: Rework this so it uses viewport tile indexes and then calculates
2320 * screen pixel X/Y from those? For performance?
2321 */
2322 for(
2323 y = ((retroflat_viewport_world_y() >>
2324 RETROFLAT_TILE_H_BITS) << RETROFLAT_TILE_H_BITS) ;
2325 y < (int)retroflat_viewport_world_y() +
2326 (int)retroflat_viewport_screen_h() ;
2327 y += RETROFLAT_TILE_H
2328 ) {
2329 for(
2330 x = ((retroflat_viewport_world_x() >>
2331 RETROFLAT_TILE_W_BITS) << RETROFLAT_TILE_W_BITS) ;
2332 x < (int)retroflat_viewport_world_x() +
2333 (int)retroflat_viewport_screen_w() ;
2334 x += RETROFLAT_TILE_W
2335 ) {
2336 /* Limit to tiles that exist in the world. */
2337 if(
2338 -1 > x || -1 > y ||
2339 (int)retroflat_viewport_world_w() <= x ||
2340 (int)retroflat_viewport_world_h() <= y
2341 ) {
2342 continue;
2343 }
2344
2345 /* Divide by tile width (16), or shift by 2^4. */
2346 x_tile = x >> RETROFLAT_TILE_W_BITS;
2347 y_tile = y >> RETROFLAT_TILE_H_BITS;
2348
2349 tile_id = retrotile_get_tile( t, layer, x_tile, y_tile );
2350 t_def = mdata_vector_get(
2351 t_defs, tile_id - t->tileset_fgid, struct RETROTILE_TILE_DEF );
2352 if( NULL == t_def ) {
2353 error_printf(
2354 "invalid tile ID: %d (- " SIZE_T_FMT " = " SIZE_T_FMT ")",
2355 tile_id, t->tileset_fgid, tile_id - t->tileset_fgid );
2356 continue;
2357 }
2358 assert( NULL != t_def );
2359
2360#ifndef RETROFLAT_NO_VIEWPORT_REFRESH
2361 /* Check tile refresh buffer. */
2362 retroflat_viewport_lock_refresh();
2363 if( !retroflat_viewport_tile_is_stale(
2364 x - retroflat_viewport_world_x(),
2365 y - retroflat_viewport_world_y(), tile_id
2366 ) ) {
2367 retroflat_viewport_unlock_refresh();
2368 continue;
2369 }
2370 /* Noisy! */
2371 /*
2372 debug_printf( RETROTILE_TRACE_LVL, "redrawing tile: %u, %u",
2373 x - retroflat_viewport_world_x(),
2374 y - retroflat_viewport_world_y() );
2375 */
2376 retroflat_viewport_set_refresh(
2377 x - retroflat_viewport_world_x(),
2378 y - retroflat_viewport_world_y(), tile_id );
2379 retroflat_viewport_unlock_refresh();
2380#endif /* !RETROFLAT_NO_VIEWPORT_REFRESH */
2381
2382#ifdef RETROGXC_PRESENT
2383 retrogxc_blit_bitmap( target, t_def->image_cache_id,
2384 t_def->x, t_def->y,
2387 RETROFLAT_TILE_W, RETROFLAT_TILE_H,
2388 retroflat_instance_tile( tile_id ) );
2389#else
2390 retroflat_blit_bitmap( target, &(t_def->image),
2391 t_def->x, t_def->y,
2394 RETROFLAT_TILE_W, RETROFLAT_TILE_H,
2395 retroflat_instance_tile( tile_id ) );
2396#endif /* RETROGXC_PRESENT */
2397 }
2398 }
2399
2400cleanup:
2401
2402 mdata_vector_unlock( t_defs );
2403
2404 return retval;
2405}
2406
2407#else
2408
2409/* This is defined externally so custom token callbacks can reference it. */
2410
2411# define RETROTILE_PARSER_MSTATE_TABLE_CONST( name, idx, tokn, parent, m ) \
2412 extern MAUG_CONST uint8_t SEG_MCONST name;
2413
2414RETROTILE_PARSER_MSTATE_TABLE( RETROTILE_PARSER_MSTATE_TABLE_CONST )
2415
2416# define RETROTILE_CLASS_TABLE_CONSTS( A, a, i ) \
2417 extern MAUG_CONST uint8_t SEG_MCONST RETROTILE_CLASS_ ## A;
2418
2419RETROTILE_CLASS_TABLE( RETROTILE_CLASS_TABLE_CONSTS )
2420
2421
2422#endif /* RETROTIL_C */
2423 /* retrotile */
2425 /* maug_retroflt */
2427
2428#endif /* !RETROTIL_H */
2429
int MERROR_RETVAL
Return type indicating function returns a value from this list.
Definition merror.h:19
#define MAUG_PATH_SZ_MAX
Maximum size allocated for asset paths.
Definition mfile.h:35
MERROR_RETVAL mfile_open_read(const char *filename, mfile_t *p_file)
Open a file and read it into memory or memory-map it.
#define MERROR_PREEMPT
Indicates MLISP_AST_NODE can be executed again on next step iter pass.
Definition merror.h:58
char retroflat_asset_path[MAUG_PATH_SZ_MAX+1]
Path/name used to load an asset from disk.
Definition mfile.h:103
MERROR_RETVAL retroflat_blit_bitmap(struct RETROFLAT_BITMAP *target, struct RETROFLAT_BITMAP *src, size_t s_x, size_t s_y, int16_t d_x, int16_t d_y, size_t w, size_t h, int16_t instance)
Blit the contents of a ::RETROFLAT_BITMAP onto another ::RETROFLAT_BITMAP.
#define retroflat_instance_tile(instance)
Declare that a given instance ID is for a tile, rather than a sprite.
Definition retroflt.h:575
#define retroflat_viewport_screen_y(world_y)
Return the screenspace Y coordinate at which something at the given world coordinate should be drawn.
Definition retroflt.h:1526
#define retroflat_viewport_screen_x(world_x)
Return the screenspace X coordinate at which something at the given world coordinate should be drawn.
Definition retroflt.h:1519
size_t retroflat_pxxy_t
Type used for surface pixel coordinates.
Definition retroflt.h:870
#define RETROTILE_DS_FLAG_INIT_DATA
Flag for retrotile_gen_diamond_square_iter() indicating that passed RETROTILE_DATA_DS object should b...
Definition retrotil.h:159
#define RETROTILE_PROP_TYPE_FILE
Value for RETROTILE_PARSER::last_prop_type indicating file path.
Definition retrotil.h:141
#define RETROTILE_PROP_TYPE_STRING
Value for RETROTILE_PARSER::last_prop_type indicating string.
Definition retrotil.h:135
#define RETROTILE_PROP_TYPE_INT
Value for RETROTILE_PARSER::last_prop_type indicating integer.
Definition retrotil.h:147
#define RETROTILE_PROP_TYPE_OTHER
Value for RETROTILE_PARSER::last_prop_type indicating other type.
Definition retrotil.h:129
MERROR_RETVAL retrotile_gen_smooth_iter(struct RETROTILE *t, retroflat_tile_t min_z, retroflat_tile_t max_z, uint32_t tuning, size_t layer_idx, uint8_t flags, void *data, retrotile_ani_cb animation_cb, void *animation_cb_data)
Average the values in adjacent tiles over an already-generated tilemap.
MERROR_RETVAL retrotile_gen_borders_iter(struct RETROTILE *t, retroflat_tile_t min_z, retroflat_tile_t max_z, uint32_t tuning, size_t layer_idx, uint8_t flags, void *data, retrotile_ani_cb animation_cb, void *animation_cb_data)
Given a list of RETROTILE_DATA_BORDER structs, this will search for occurrences of RETROTILE_DATA_BOR...
MERROR_RETVAL retrotile_gen_diamond_square_iter(struct RETROTILE *t, retroflat_tile_t min_z, retroflat_tile_t max_z, uint32_t tuning, size_t layer_idx, uint8_t flags, void *data, retrotile_ani_cb animation_cb, void *animation_cb_data)
Generate tilemap terrain using diamond square algorithm.
MERROR_RETVAL retrotile_gen_voronoi_iter(struct RETROTILE *t, retroflat_tile_t min_z, retroflat_tile_t max_z, uint32_t tuning, size_t layer_idx, uint8_t flags, void *data, retrotile_ani_cb animation_cb, void *animation_cb_data)
Generate tilemap terrain using voronoi graph.
int retrotile_parse_prop_type(const char *token, size_t token_sz)
Convert a Tiled "type" field to an integer suitable for use with RETROTILE_PARSER::last_prop_type.
MERROR_RETVAL retrotile_parse_json_file(const char *dirname, const char *filename, MAUG_MHANDLE *p_tilemap_h, struct MDATA_VECTOR *p_tile_defs, mparser_wait_cb_t wait_cb, void *wait_data, mparser_parse_token_cb token_cb, void *token_cb_data, uint8_t passes, uint8_t flags)
Parse the JSON file at the given path into a heap-allocated tilemap with a RETROTILE struct header.
mfix_t retrotile_static_rotation_from_dir(const char *dir)
Convert a less-or-equal-to-two-character string to a direction in degrees.
#define RETROTILE_TILE_SCALE_DEFAULT
Default value for RETROTILE::tile_scale.
Definition retrotil.h:37
#define RETROTILE_PROP_NAME_SZ_MAX
Maximum number of chars in a parsed property name.
Definition retrotil.h:32
#define RETROTILE_PARSER_MODE_DEFS
Value for RETROTILE_PARSER::mode indicating the parser is currently parsing tile definitions.
Definition retrotil.h:80
#define RETROTILE_TRACE_LVL
If defined, bring debug printf statements up to this level.
Definition retrotil.h:42
#define RETROTILE_PARSER_MODE_MAP
Value for RETROTILE_PARSER::mode indicating the parser is currently parsing a tilemap.
Definition retrotil.h:73
int16_t retroflat_tile_t
Value for an individual tile in a RETROTILE_LAYER.
Definition retroflt.h:19
#define RETROTILE_NAME_SZ_MAX
Maximum number of chars in a RETROTILE::name.
Definition retrotil.h:27
#define RETROTILE_PARSER_FLAG_LITERAL_PATHS
Flag for RETROTILE_PARSER::flags indicating to use literal image asset paths.
Definition retrotil.h:65
A vector of uniformly-sized objects, stored contiguously.
Definition mdata.h:85
This is not currently used for anything, but is provided as a a convenience for game logic.
Definition retrotil.h:210
size_t sz
Size of this struct (useful for serializing).
Definition retrotil.h:212
Definition retrotil.h:267
retroflat_tile_t mod_to[8]
If the center and outside match, use this mod-to.
Definition retrotil.h:272
Internal data structure used by retrotile_gen_diamond_square_iter().
Definition retrotil.h:250
int16_t sect_y
Starting Y of subsector in a given iteration.
Definition retrotil.h:254
int16_t sect_w
Width of subsector in a given iteration.
Definition retrotil.h:256
int16_t sect_w_half
Half of the width of subsector in a given iteration.
Definition retrotil.h:260
int16_t sect_x
Starting X of subsector in a given iteration.
Definition retrotil.h:252
int16_t sect_h
Height of subsector in a given iteration.
Definition retrotil.h:258
int16_t sect_h_half
Half of the height of subsector in a given iteration.
Definition retrotil.h:262
Definition retrotil.h:198
size_t total_sz
Size of the layer in bytes (including this struct header).
Definition retrotil.h:202
size_t sz
Size of this struct (useful for serializing).
Definition retrotil.h:200
Definition retrotil.h:314
mparser_parse_token_cb custom_token_cb
Callback to parse engine-specific custom tokens from the tilemap JSON. Should return MERROR_PREEMPT i...
Definition retrotil.h:348
char tilemap_name[RETROTILE_NAME_SZ_MAX+1]
The name to give to the new tilemap.
Definition retrotil.h:331
char last_prop_name[RETROTILE_PROP_NAME_SZ_MAX+1]
The name of the last property key/value pair parsed.
Definition retrotil.h:327
uint8_t mode
Value indicating the current type of object being parsed into.
Definition retrotil.h:321
size_t tileset_id_cur
Highest tileset ID on first pass and next ID to be assigned on second.
Definition retrotil.h:338
Definition retrotil.h:166
mfix_t static_rotation
Field indicating how many degrees the tile should always be rotated before drawin on-screen....
Definition retrotil.h:180
size_t sz
Size of this struct (useful for serializing).
Definition retrotil.h:168
int8_t no_serial
Dummy field; do not serialize fields after this!
Definition retrotil.h:184
A struct representing a tilemap.
Definition retrotil.h:224
size_t tiles_h
Height of all layers of the tilemap in tiles.
Definition retrotil.h:236
uint32_t total_sz
Size of the tilemap in bytes (including this struct header).
Definition retrotil.h:230
size_t tileset_fgid
First GID in the accompanying tileset.
Definition retrotil.h:234
float tile_scale
Amount by which to scale tiles (convenience property).
Definition retrotil.h:243
size_t tiles_w
Width of all layers of the tilemap in tiles.
Definition retrotil.h:238
uint32_t layers_count
Number of tile layers in this tilemap.
Definition retrotil.h:232
size_t sz
Size of this struct (useful for serializing).
Definition retrotil.h:226