1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/*
* Copyright (C) 2002-2004, 2006-2008, 2010 by the Widelands Development Team
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "map_io/map_exploration_packet.h"
#include "base/log.h"
#include "io/fileread.h"
#include "io/filewrite.h"
#include "logic/constants.h"
#include "logic/editor_game_base.h"
#include "logic/game_data_error.h"
#include "logic/map.h"
#include "logic/player.h"
namespace Widelands {
constexpr uint16_t kCurrentPacketVersion = 2;
void MapExplorationPacket::read(FileSystem& fs,
EditorGameBase& egbase,
bool const skip,
MapObjectLoader&) {
if (skip)
return;
FileRead fr;
try {
fr.open(fs, "binary/exploration");
} catch (...) {
try {
fr.open(fs, "binary/seen_fields");
} catch (...) {
return;
}
}
static_assert(MAX_PLAYERS < 32, "assert(MAX_PLAYERS < 32) failed.");
Map& map = egbase.map();
PlayerNumber const nr_players = map.get_nrplayers();
MapIndex const max_index = map.max_index();
try {
uint16_t const packet_version = fr.unsigned_16();
if (packet_version == kCurrentPacketVersion) {
for (MapIndex i = 0; i < max_index; ++i) {
uint32_t const data = fr.unsigned_32();
for (uint8_t j = 0; j < nr_players; ++j) {
bool see = data & (1 << j);
if (Player* const player = egbase.get_player(j + 1))
player->fields_[i].vision = see ? 1 : 0;
else if (see)
log("MapExplorationPacket::read: WARNING: Player %u, "
"which does not exist, sees field %u.\n",
j + 1, i);
}
}
} else {
throw UnhandledVersionError("MapExplorationPacket", packet_version, kCurrentPacketVersion);
}
} catch (const WException& e) {
throw GameDataError("seen: %s", e.what());
}
}
void MapExplorationPacket::write(FileSystem& fs, EditorGameBase& egbase, MapObjectSaver&) {
FileWrite fw;
fw.unsigned_16(kCurrentPacketVersion);
static_assert(MAX_PLAYERS < 32, "assert(MAX_PLAYERS < 32) failed.");
Map& map = egbase.map();
PlayerNumber const nr_players = map.get_nrplayers();
MapIndex const max_index = map.max_index();
for (MapIndex i = 0; i < max_index; ++i) {
uint32_t data = 0;
for (uint8_t j = 0; j < nr_players; ++j) {
uint8_t const player_index = j + 1;
if (Player const* const player = egbase.get_player(player_index))
data |= ((0 < player->vision(i)) << j);
}
fw.unsigned_32(data);
}
fw.write(fs, "binary/exploration");
}
}
|
