void wr_monsters(void)
{
int i;
if (p_ptr->is_dead)
return;
/* Total monsters */
wr_u16b(m_max);
/* Dump the monsters */
for (i = 1; i < m_max; i++) {
monster_type *m_ptr = &m_list[i];
/* Dump it */
wr_monster(m_ptr);
}
/* Expansion */
wr_u32b(0);
}
/*!
* @brief 保存フロアの書き込み / Actually write a saved floor data using effectively compressed format.
* @param sf_ptr 保存したいフロアの参照ポインタ
* @return なし
*/
static void wr_saved_floor(saved_floor_type *sf_ptr)
{
cave_template_type *templates;
u16b max_num_temp;
u16b num_temp = 0;
int dummy_why;
int i, y, x;
u16b tmp16u;
byte count;
u16b prev_u16b;
/*** Basic info ***/
/* Dungeon floor specific info follows */
if (!sf_ptr)
{
/*** Not a saved floor ***/
wr_s16b(dun_level);
}
else
{
/*** The saved floor ***/
wr_s16b(sf_ptr->floor_id);
wr_byte(sf_ptr->savefile_id);
wr_s16b(sf_ptr->dun_level);
wr_s32b(sf_ptr->last_visit);
wr_u32b(sf_ptr->visit_mark);
wr_s16b(sf_ptr->upper_floor_id);
wr_s16b(sf_ptr->lower_floor_id);
}
wr_u16b(base_level);
wr_u16b(num_repro);
wr_u16b((u16b)py);
wr_u16b((u16b)px);
wr_u16b(cur_hgt);
wr_u16b(cur_wid);
wr_byte(p_ptr->feeling);
/*********** Make template for cave_type **********/
/*
* Usually number of templates are fewer than 255. Even if
* more than 254 are exist, the occurrence of each template
* with larger ID is very small when we sort templates by
* occurrence. So we will use two (or more) bytes for
* templete ID larger than 254.
*
* Ex: 256 will be "0xff" "0x01".
* 515 will be "0xff" "0xff" "0x03"
*/
/* Fake max number */
max_num_temp = 255;
/* Allocate the "template" array */
C_MAKE(templates, max_num_temp, cave_template_type);
/* Extract template array */
for (y = 0; y < cur_hgt; y++)
{
for (x = 0; x < cur_wid; x++)
{
cave_type *c_ptr = &cave[y][x];
for (i = 0; i < num_temp; i++)
{
if (templates[i].info == c_ptr->info &&
templates[i].feat == c_ptr->feat &&
templates[i].mimic == c_ptr->mimic &&
templates[i].special == c_ptr->special)
{
/* Same terrain is exist */
templates[i].occurrence++;
break;
}
}
/* Are there same one? */
if (i < num_temp) continue;
/* If the max_num_temp is too small, increase it. */
if (num_temp >= max_num_temp)
{
cave_template_type *old_template = templates;
/* Re-allocate the "template" array */
C_MAKE(templates, max_num_temp + 255, cave_template_type);
(void)C_COPY(templates, old_template, max_num_temp, cave_template_type);
C_KILL(old_template, max_num_temp, cave_template_type);
max_num_temp += 255;
}
/* Add new template */
templates[num_temp].info = c_ptr->info;
templates[num_temp].feat = c_ptr->feat;
templates[num_temp].mimic = c_ptr->mimic;
templates[num_temp].special = c_ptr->special;
templates[num_temp].occurrence = 1;
/* Increase number of template */
num_temp++;
}
}
/* Select the sort method */
ang_sort_comp = ang_sort_comp_cave_temp;
ang_sort_swap = ang_sort_swap_cave_temp;
/* Sort by occurrence */
ang_sort(templates, &dummy_why, num_temp);
/*** Dump templates ***/
/* Total templates */
wr_u16b(num_temp);
/* Dump the templates */
for (i = 0; i < num_temp; i++)
{
cave_template_type *ct_ptr = &templates[i];
/* Dump it */
wr_u16b(ct_ptr->info);
wr_s16b(ct_ptr->feat);
wr_s16b(ct_ptr->mimic);
wr_s16b(ct_ptr->special);
}
/*** "Run-Length-Encoding" of cave ***/
/* Note that this will induce two wasted bytes */
count = 0;
prev_u16b = 0;
/* Dump the cave */
for (y = 0; y < cur_hgt; y++)
{
for (x = 0; x < cur_wid; x++)
{
cave_type *c_ptr = &cave[y][x];
for (i = 0; i < num_temp; i++)
{
if (templates[i].info == c_ptr->info &&
templates[i].feat == c_ptr->feat &&
templates[i].mimic == c_ptr->mimic &&
templates[i].special == c_ptr->special)
break;
}
/* Extract an ID */
tmp16u = i;
/* If the run is broken, or too full, flush it */
if ((tmp16u != prev_u16b) || (count == MAX_UCHAR))
{
wr_byte((byte)count);
while (prev_u16b >= MAX_UCHAR)
{
/* Mark as actual data is larger than 254 */
wr_byte(MAX_UCHAR);
prev_u16b -= MAX_UCHAR;
}
wr_byte((byte)prev_u16b);
prev_u16b = tmp16u;
count = 1;
}
/* Continue the run */
else
{
count++;
}
}
}
/* Flush the data (if any) */
if (count)
{
wr_byte((byte)count);
while (prev_u16b >= MAX_UCHAR)
{
/* Mark as actual data is larger than 254 */
wr_byte(MAX_UCHAR);
prev_u16b -= MAX_UCHAR;
}
wr_byte((byte)prev_u16b);
}
/* Free the "template" array */
C_KILL(templates, max_num_temp, cave_template_type);
/*** Dump objects ***/
/* Total objects */
wr_u16b(o_max);
/* Dump the objects */
for (i = 1; i < o_max; i++)
{
object_type *o_ptr = &o_list[i];
/* Dump it */
wr_item(o_ptr);
}
/*** Dump the monsters ***/
/* Total monsters */
wr_u16b(m_max);
/* Dump the monsters */
for (i = 1; i < m_max; i++)
{
monster_type *m_ptr = &m_list[i];
/* Dump it */
wr_monster(m_ptr);
}
}
/*
* Write the current dungeon
*/
static void wr_dungeon(void)
{
int i, y, x;
byte tmp8u;
byte count;
byte prev_char;
/*** Basic info ***/
/* Dungeon specific info follows */
wr_s16b(p_ptr->depth);
wr_s16b(p_ptr->py);
wr_s16b(p_ptr->px);
wr_byte(p_ptr->cur_map_hgt);
wr_byte(p_ptr->cur_map_wid);
/*** Simple "Run-Length-Encoding" of cave ***/
/* Note that this will induce two wasted bytes */
count = 0;
prev_char = 0;
/* Dump the cave */
for (y = 0; y < p_ptr->cur_map_hgt; y++)
{
for (x = 0; x < p_ptr->cur_map_wid; x++)
{
/* Extract the important cave_info flags */
tmp8u = (cave_info[y][x] & (IMPORTANT_FLAGS));
/* If the run is broken, or too full, flush it */
if ((tmp8u != prev_char) || (count == MAX_UCHAR))
{
wr_byte((byte)count);
wr_byte((byte)prev_char);
prev_char = tmp8u;
count = 1;
}
/* Continue the run */
else
{
count++;
}
}
}
/* Flush the data (if any) */
if (count)
{
wr_byte((byte)count);
wr_byte((byte)prev_char);
}
/*** Simple "Run-Length-Encoding" of cave ***/
/* Note that this will induce two wasted bytes */
count = 0;
prev_char = 0;
/* Dump the cave */
for (y = 0; y < p_ptr->cur_map_hgt; y++)
{
for (x = 0; x < p_ptr->cur_map_wid; x++)
{
/* Extract a byte */
tmp8u = cave_feat[y][x];
/* If the run is broken, or too full, flush it */
if ((tmp8u != prev_char) || (count == MAX_UCHAR))
{
wr_byte((byte)count);
wr_byte((byte)prev_char);
prev_char = tmp8u;
count = 1;
}
/* Continue the run */
else
{
count++;
}
}
}
/* Flush the data (if any) */
if (count)
{
wr_byte((byte)count);
wr_byte((byte)prev_char);
}
/*** Compact ***/
/* Compact the objects */
compact_objects(0);
/* Compact the monsters */
compact_monsters(0);
/*** Dump objects ***/
/* Total objects */
wr_u16b(o_max);
/* Dump the objects */
for (i = 1; i < o_max; i++)
{
object_type *o_ptr = &o_list[i];
/* Dump it */
wr_item(o_ptr);
}
/*** Dump the monsters ***/
/* Total monsters */
wr_u16b(mon_max);
/* Dump the monsters */
for (i = 1; i < mon_max; i++)
{
monster_type *m_ptr = &mon_list[i];
/* Dump it */
wr_monster(m_ptr);
}
// dump the wandering monster information
for (i = FLOW_WANDERING_HEAD; i < MAX_FLOWS; i++)
{
wr_byte(flow_center_y[i]);
wr_byte(flow_center_x[i]);
wr_s16b(wandering_pause[i]);
}
}