… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | enum bowtype_t |
25 | enum bowtype_t |
… | |
… | |
103 | usekeytype ACC (RW, usekeys); /* Method for finding keys for doors */ |
104 | usekeytype ACC (RW, usekeys); /* Method for finding keys for doors */ |
104 | unapplymode ACC (RW, unapply); /* Method for auto unapply */ |
105 | unapplymode ACC (RW, unapply); /* Method for auto unapply */ |
105 | uint32 ACC (RW, count); /* Any numbers typed before a command */ |
106 | uint32 ACC (RW, count); /* Any numbers typed before a command */ |
106 | uint32 ACC (RW, mode); /* Mode of player for pickup. */ |
107 | uint32 ACC (RW, mode); /* Mode of player for pickup. */ |
107 | |
108 | |
108 | int ACC (RW, digestion); /* Any bonuses/penalties to digestion */ |
109 | int ACC (RW, digestion); /* Any bonuses/penalties to digestion */ |
109 | int ACC (RW, gen_hp); /* Bonuses to regeneration speed of hp */ |
110 | int ACC (RW, gen_hp); /* Bonuses to regeneration speed of hp */ |
110 | int ACC (RW, gen_sp); /* Bonuses to regeneration speed of sp */ |
111 | int ACC (RW, gen_sp); /* Bonuses to regeneration speed of sp */ |
111 | int ACC (RW, gen_sp_armour); /* Penalty to sp regen from armour */ |
112 | int ACC (RW, gen_sp_armour); /* Penalty to sp regen from armour */ |
112 | int ACC (RW, gen_grace); /* Bonuses to regeneration speed of grace */ |
113 | int ACC (RW, gen_grace); /* Bonuses to regeneration speed of grace */ |
113 | int ACC (RW, item_power); /* Total item power of objects equipped */ |
114 | int ACC (RW, item_power); /* Total item power of objects equipped */ |
114 | uint8 ACC (RW, gender); /* 0 male, 1 female, others not yet defined */ |
115 | uint8 ACC (RW, gender); /* 0 male, 1 female, others not yet defined */ |
115 | uint8 ACC (RW, hintmode); /* 0 full, 1 hint, 2 disable */ |
116 | uint8 ACC (RW, hintmode); /* 0 full, 1 hint, 2 disable */ |
116 | |
117 | |
117 | /* Try to put all the bitfields together - saves some small amount of memory */ |
118 | /* Try to put all the bitfields together - saves some small amount of memory */ |
118 | bool ACC (RW, braced); /* Will not move if braced, only attack */ |
119 | bool ACC (RW, braced); /* Will not move if braced, only attack */ |
… | |
… | |
164 | uint16 ACC (RW, outputs_count); /* Print if this count is exceeded */ |
165 | uint16 ACC (RW, outputs_count); /* Print if this count is exceeded */ |
165 | object_ptr ACC (RW, mark); /* marked object */ |
166 | object_ptr ACC (RW, mark); /* marked object */ |
166 | /* Special DM fields */ |
167 | /* Special DM fields */ |
167 | tag_t *stack_items; /* Item stack for patch/dump/... commands */ |
168 | tag_t *stack_items; /* Item stack for patch/dump/... commands */ |
168 | int ACC (RW, stack_position); /* Current stack position, 0 for no item */ |
169 | int ACC (RW, stack_position); /* Current stack position, 0 for no item */ |
169 | sint8 blocked_los[MAP_CLIENT_X][MAP_CLIENT_Y]; /* array showing what spaces */ |
170 | sint8 los[MAP_CLIENT_X][MAP_CLIENT_Y]; /* array showing what spaces */ |
170 | /* the player can see. For maps smaller than */ |
171 | /* the player can see. For maps smaller than */ |
171 | /* MAP_CLIENT_.., the upper left is used */ |
172 | /* MAP_CLIENT_.., the center is used */ |
|
|
173 | |
|
|
174 | // return the los value for the given coordinate |
|
|
175 | MTH sint8 blocked_los (int dx, int dy) const |
|
|
176 | { |
|
|
177 | dx += LOS_X0; |
|
|
178 | dy += LOS_Y0; |
|
|
179 | |
|
|
180 | return 0 <= dx && dx < MAP_CLIENT_X |
|
|
181 | && 0 <= dy && dy < MAP_CLIENT_Y |
|
|
182 | ? los[dx][dy] : LOS_BLOCKED; |
|
|
183 | } |
|
|
184 | |
|
|
185 | // unchecked variant |
|
|
186 | sint8 blocked_los_uc (int dx, int dy) const |
|
|
187 | { |
|
|
188 | return los[dx + LOS_X0][dy + LOS_Y0]; |
|
|
189 | } |
|
|
190 | |
|
|
191 | MTH void clear_los (sint8 value = LOS_BLOCKED); |
|
|
192 | MTH void update_los (); |
172 | |
193 | |
173 | shstr ACC (RW, invis_race); /* What race invisible to? */ |
194 | shstr ACC (RW, invis_race); /* What race invisible to? */ |
174 | |
195 | |
175 | MTH const char *killer_name () const; // makes a string out of ->killer |
196 | MTH const char *killer_name () const; // makes a string out of ->killer |
176 | |
197 | |
… | |
… | |
178 | static player *find (const_utf8_string name); |
199 | static player *find (const_utf8_string name); |
179 | |
200 | |
180 | static player *load_pl (object_thawer &thawer); |
201 | static player *load_pl (object_thawer &thawer); |
181 | MTH static player *load_pl (object_thawer *thawer) { return load_pl (*thawer); } |
202 | MTH static player *load_pl (object_thawer *thawer) { return load_pl (*thawer); } |
182 | |
203 | |
|
|
204 | MTH void link_skills (); |
|
|
205 | MTH object *find_skill (shstr_cmp name) const; |
|
|
206 | |
183 | bool save_pl (object_freezer &freezer); |
207 | bool save_pl (object_freezer &freezer); |
184 | MTH bool save_pl (const char *path); |
208 | MTH bool save_pl (const char *path); |
185 | |
209 | |
186 | void do_destroy (); |
210 | void do_destroy (); |
187 | void gather_callbacks (AV *&callbacks, event_type event) const; |
211 | void gather_callbacks (AV *&callbacks, event_type event) const; |
… | |
… | |
195 | if (ns) |
219 | if (ns) |
196 | ns->play_sound (sound, dx, dy); |
220 | ns->play_sound (sound, dx, dy); |
197 | } |
221 | } |
198 | |
222 | |
199 | // wether the player can "see" this mapspace or not, decided by los |
223 | // wether the player can "see" this mapspace or not, decided by los |
200 | // 0 - nothing see, 100 - fully visible |
224 | // 0 - bright, 3 dark, 4 too dark, 100 blocked or out of range |
201 | MTH sint8 visibility_at (maptile *map, int x, int y) const; |
225 | MTH sint8 darkness_at (maptile *map, int x, int y) const; |
202 | |
226 | |
203 | MTH void connect (client *ns); |
227 | MTH void connect (client *ns); |
204 | MTH void disconnect (); |
228 | MTH void disconnect (); |
205 | |
229 | |
206 | MTH void activate (); |
230 | MTH void activate (); |
… | |
… | |
243 | |
267 | |
244 | #define for_all_players(var) \ |
268 | #define for_all_players(var) \ |
245 | for (unsigned _i = 0; _i < ::players.size (); ++_i) \ |
269 | for (unsigned _i = 0; _i < ::players.size (); ++_i) \ |
246 | statementvar (player *, var, ::players [_i]) |
270 | statementvar (player *, var, ::players [_i]) |
247 | |
271 | |
|
|
272 | #define for_all_players_on_map(var,mapp) \ |
|
|
273 | for_all_players(var) \ |
|
|
274 | if ((var)->ob->map == (mapp)) |
|
|
275 | |
248 | inline void |
276 | inline void |
249 | object::statusmsg (const char *msg, int color) |
277 | object::statusmsg (const char *msg, int color) |
250 | { |
278 | { |
251 | if (expect_true (contr)) contr->statusmsg (msg, color); |
279 | if (expect_true (contr)) contr->statusmsg (msg, color); |
252 | } |
280 | } |