Mother 3/EFC block: Difference between revisions

From Data Crystal
Jump to navigation Jump to search
m (Lelegofrog moved page MOTHER 3/EFC block to Mother 3/EFC block: title consistency with TCRF)
mNo edit summary
 
Line 1: Line 1:
{{subpage}}
{{subpage}}


The only EFC block in Mother 3 is the [[MOTHER 3:Battle animations entry table|Battle animations entry table]].
The only EFC block in Mother 3 is the [[Mother 3/Battle animations entry table|Battle animations entry table]].


==Format==
==Format==
Line 21: Line 21:
The third list has entries made of 10 bytes of unknown purpose, a short value of subentries, 4 unknown bytes, and then the number of bytes a subentry is long followed by the subentry itself repeated for each subentry.
The third list has entries made of 10 bytes of unknown purpose, a short value of subentries, 4 unknown bytes, and then the number of bytes a subentry is long followed by the subentry itself repeated for each subentry.


[[Category:MOTHER 3 named data structures|EFC]]
[[Category:Mother 3 named data structures|EFC]]
[[Category:MOTHER 3|EFC]]
[[Category:Mother 3|EFC]]

Latest revision as of 02:17, 20 May 2024

This is a sub-page of Mother 3.

The only EFC block in Mother 3 is the Battle animations entry table.

Format

  • 00-03 (04) = "efc " header
  • 04-05 (02) = First list number entries number
  • 06-07 (02) = Second list entries number
  • 08-09 (02) = Third list entries number
  • 0A-0B (02) = ??? (Still in header)
  • 0C-.. (..) = Battle animations entry data
  • ..-.. (04) = "~efc" footer

Entry lists

The first list has the short value of the tileset followed by the short value of the palette and the integer number of 4 bytes entries. Each of these 4 bytes entries is divided in two, a two byte value of unknown purpose at the moment and the duration in frames.

The second list has 8 bytes entries. It is still unknown what it does. It could be related to palette dimming, sounds and/or similar things.

The third list has entries made of 10 bytes of unknown purpose, a short value of subentries, 4 unknown bytes, and then the number of bytes a subentry is long followed by the subentry itself repeated for each subentry.