1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
29 | #include <sproto.h> |
29 | #include <sproto.h> |
30 | #include <time.h> |
30 | #include <time.h> |
31 | |
31 | |
32 | #include <glib.h> |
32 | #include <glib.h> |
33 | |
33 | |
34 | #include <../random_maps/random_map.h> |
34 | #include <rmg.h> |
35 | #include <../random_maps/rproto.h> |
35 | #include <rproto.h> |
36 | #include "path.h" |
36 | #include "path.h" |
37 | |
|
|
38 | static char days[7][4] = { |
|
|
39 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
40 | }; |
|
|
41 | |
37 | |
42 | void |
38 | void |
43 | version (object *op) |
39 | version (object *op) |
44 | { |
40 | { |
45 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
41 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
46 | } |
42 | } |
47 | |
43 | |
48 | /* This is a basic little function to put the player back to his |
44 | /* This is a basic little function to put the player back to his |
49 | * savebed. We do some error checking - its possible that the |
45 | * savebed. |
50 | * savebed map may no longer exist, so we make sure the player |
|
|
51 | * goes someplace. |
|
|
52 | */ |
46 | */ |
53 | void |
47 | void |
54 | enter_player_savebed (object *op) |
48 | enter_player_savebed (object *op) |
55 | { |
49 | { |
56 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
50 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
… | |
… | |
61 | * new map. map, x, y must be set. map is the map we are moving the |
55 | * new map. map, x, y must be set. map is the map we are moving the |
62 | * player to - it could be the map he just came from if the load failed for |
56 | * player to - it could be the map he just came from if the load failed for |
63 | * whatever reason. If default map coordinates are to be used, then |
57 | * whatever reason. If default map coordinates are to be used, then |
64 | * the function that calls this should figure them out. |
58 | * the function that calls this should figure them out. |
65 | */ |
59 | */ |
66 | void |
60 | bool |
67 | object::enter_map (maptile *newmap, int x, int y) |
61 | object::enter_map (maptile *newmap, int x, int y) |
68 | { |
62 | { |
69 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
63 | if (destroyed () || !newmap || !newmap->linkable ()) |
70 | return; |
64 | return false; |
71 | |
65 | |
72 | if (out_of_map (newmap, x, y)) |
66 | if (out_of_map (newmap, x, y)) |
73 | { |
67 | { |
74 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
68 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
75 | x = newmap->enter_x; |
69 | x = newmap->enter_x; |
… | |
… | |
77 | if (out_of_map (newmap, x, y)) |
71 | if (out_of_map (newmap, x, y)) |
78 | { |
72 | { |
79 | LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
73 | LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
80 | &newmap->path, x, y, newmap->width, newmap->height); |
74 | &newmap->path, x, y, newmap->width, newmap->height); |
81 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
75 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
82 | return; |
76 | return false; |
83 | } |
77 | } |
84 | } |
78 | } |
85 | |
79 | |
86 | if (contr && map != newmap && map) |
80 | if (contr && map != newmap && map) |
87 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
81 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
88 | return; |
82 | return false; |
89 | |
83 | |
90 | // remove, so stupid ob_locked does not trigger a failure |
84 | // remove, so stupid blocked does not trigger a failure |
91 | remove (); |
85 | remove (); |
92 | |
86 | |
93 | /* try to find a spot for the player */ |
87 | /* try to find a spot for the player */ |
94 | if (blocked (newmap, x, y)) |
88 | if (blocked (newmap, x, y)) |
95 | { /* First choice blocked */ |
89 | { /* First choice blocked */ |
… | |
… | |
100 | * Note that for the second and third calls, we could start at a position other |
94 | * Note that for the second and third calls, we could start at a position other |
101 | * than one, but then we could end up on the other side of walls and so forth. |
95 | * than one, but then we could end up on the other side of walls and so forth. |
102 | */ |
96 | */ |
103 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
97 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
104 | |
98 | |
105 | if (i == -1) |
99 | if (i < 0) |
106 | { |
100 | { |
107 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
101 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
108 | if (i == -1) |
102 | if (i < 0) |
109 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
110 | } |
104 | } |
111 | |
105 | |
112 | if (i != -1) |
106 | if (i >= 0) |
|
|
107 | { |
|
|
108 | maptile *m = newmap; |
|
|
109 | sint16 nx = x + freearr_x[i]; |
|
|
110 | sint16 ny = y + freearr_y[i]; |
|
|
111 | |
|
|
112 | if (xy_normalise (m, nx, ny)) |
113 | { |
113 | { |
114 | x += freearr_x[i]; |
114 | newmap = m; |
115 | y += freearr_y[i]; |
115 | x = nx; |
|
|
116 | y = ny; |
|
|
117 | } |
116 | } |
118 | } |
117 | else |
119 | else |
118 | /* not much we can do in this case. */ |
120 | /* not much we can do in this case. */ |
119 | LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); |
121 | LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); |
120 | } |
122 | } |
121 | |
123 | |
122 | if (contr && map != newmap) |
124 | if (contr && map != newmap) |
123 | { |
125 | { |
124 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
126 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
125 | return; |
127 | return false; |
126 | |
128 | |
127 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
129 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
128 | return; |
130 | return false; |
129 | } |
131 | } |
130 | |
|
|
131 | this->x = x; |
|
|
132 | this->y = y; |
|
|
133 | map = newmap; |
|
|
134 | |
|
|
135 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
136 | |
132 | |
137 | enemy = 0; |
133 | enemy = 0; |
138 | |
134 | |
|
|
135 | newmap->activate (); // workaround for activate activating everyhing on the map, includign the palyer on the {link} map |
|
|
136 | //newmap->insert (this, x, y); |
|
|
137 | newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT); |
|
|
138 | prefetch_surrounding_maps (); |
|
|
139 | |
|
|
140 | if (map == newmap) // see if we actually arrived there - insert might trigger a teleport |
|
|
141 | { |
139 | if (contr) |
142 | if (contr) |
140 | { |
143 | { |
141 | contr->maplevel = newmap->path; |
144 | contr->maplevel = newmap->path; |
142 | contr->count = 0; |
145 | contr->count = 0; |
143 | } |
|
|
144 | |
146 | |
145 | /* Update any golems */ |
147 | /* Update any golems */ |
146 | if (type == PLAYER) |
|
|
147 | if (object *golem = contr->golem) |
148 | if (object *golem = contr->golem) |
148 | { |
149 | { |
149 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
150 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
150 | |
151 | |
151 | if (i < 0) |
152 | if (i < 0) |
152 | golem->drop_and_destroy (); |
153 | golem->drop_and_destroy (); |
153 | else |
154 | else |
154 | { |
155 | { |
155 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
156 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
156 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
157 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
|
|
158 | } |
157 | } |
159 | } |
158 | } |
160 | } |
159 | |
161 | |
160 | /* since the players map is already loaded, we don't need to worry |
162 | /* since the players map is already loaded, we don't need to worry |
161 | * about pending objects. |
163 | * about pending objects. |
162 | */ |
164 | */ |
163 | remove_all_pets (newmap); |
165 | move_all_pets (); |
|
|
166 | |
|
|
167 | return true; |
|
|
168 | } |
|
|
169 | |
|
|
170 | return false; |
164 | } |
171 | } |
165 | |
172 | |
166 | /* process_players1 and process_players2 do all the player related stuff. |
173 | /* process_players1 and process_players2 do all the player related stuff. |
167 | * I moved it out of process events and process_map. This was to some |
174 | * I moved it out of process events and process_map. This was to some |
168 | * extent for debugging as well as to get a better idea of the time used |
175 | * extent for debugging as well as to get a better idea of the time used |
… | |
… | |
191 | |
198 | |
192 | for_all_players (pl) |
199 | for_all_players (pl) |
193 | { |
200 | { |
194 | object *ob = pl->ob; |
201 | object *ob = pl->ob; |
195 | |
202 | |
|
|
203 | // process_objects destroys the speed_left value |
|
|
204 | pl->speed_left_save = ob->speed_left; |
|
|
205 | |
196 | if (expect_false (!ob || !pl->ns || !ob->active)) |
206 | if (expect_false (!ob || !pl->ns || !ob->active)) |
197 | continue; |
207 | continue; |
198 | |
208 | |
199 | do_some_living (ob); |
209 | do_some_living (ob); |
200 | } |
210 | } |
… | |
… | |
204 | process_players2 () |
214 | process_players2 () |
205 | { |
215 | { |
206 | /* Then check if any players should use weapon-speed instead of speed */ |
216 | /* Then check if any players should use weapon-speed instead of speed */ |
207 | for_all_players (pl) |
217 | for_all_players (pl) |
208 | { |
218 | { |
|
|
219 | // restore speed_left value saved by process_players1 |
|
|
220 | pl->ob->speed_left = pl->speed_left_save; |
|
|
221 | |
209 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
222 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
210 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
223 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
211 | } |
224 | } |
212 | } |
225 | } |
213 | |
226 | |
… | |
… | |
216 | { |
229 | { |
217 | process_players1 (); |
230 | process_players1 (); |
218 | |
231 | |
219 | for_all_actives (op) |
232 | for_all_actives (op) |
220 | { |
233 | { |
|
|
234 | // try to prefetch some stuff we expect to need |
|
|
235 | // obviously, it should be grouped into the same cacheline. |
|
|
236 | // preliminary results indicate that this gives halves the speed |
|
|
237 | // used for the inner loop |
|
|
238 | if (_i < actives.size ()) // HACK, rely on _i :/ |
|
|
239 | { |
|
|
240 | object *next = actives [_i + 1]; |
|
|
241 | |
|
|
242 | prefetch (&next->flag , 0, 1); |
|
|
243 | prefetch (&next->speed , 0, 1); |
|
|
244 | prefetch (&next->anim_speed, 0, 1); |
|
|
245 | prefetch (&next->contr , 0, 1); |
|
|
246 | } |
|
|
247 | |
221 | /* Now process op */ |
248 | /* Now process op */ |
222 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
249 | if (expect_false (op->flag [FLAG_FREED])) |
223 | { |
250 | { |
224 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
251 | LOG (llevError, "BUG: process_events(): Free object on list (%s)\n", op->debug_desc ()); |
225 | op->set_speed (0); |
252 | op->set_speed (0); |
226 | continue; |
253 | continue; |
227 | } |
254 | } |
228 | |
255 | |
229 | if (expect_false (!op->has_active_speed ())) |
256 | if (expect_false (!op->has_active_speed ())) |
… | |
… | |
257 | { |
284 | { |
258 | --op->speed_left; |
285 | --op->speed_left; |
259 | process_object (op); |
286 | process_object (op); |
260 | } |
287 | } |
261 | |
288 | |
262 | if (expect_true (!op->contr)) |
289 | // this will destroy the speed_left value for players, but |
|
|
290 | // process_players1 and ..2 save/restore the real value, |
|
|
291 | // so we can avoid a costly test here. |
263 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
292 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
264 | } |
293 | } |
265 | |
294 | |
266 | process_players2 (); |
295 | process_players2 (); |
267 | } |
296 | } |
268 | |
297 | |
269 | /* clean up everything before exiting */ |
298 | /* clean up everything before exiting */ |
270 | void |
299 | void |
271 | emergency_save () |
300 | emergency_save () |
272 | { |
301 | { |
273 | LOG (llevDebug, "emergency save begin.\n"); |
302 | LOG (llevInfo, "emergency_save: enter\n"); |
|
|
303 | |
|
|
304 | LOG (llevInfo, "emergency_save: saving book archive\n"); |
|
|
305 | write_book_archive (); |
274 | |
306 | |
275 | cfperl_emergency_save (); |
307 | cfperl_emergency_save (); |
276 | |
308 | |
277 | LOG (llevDebug, "saving book archive.\n"); |
|
|
278 | write_book_archive (); |
|
|
279 | |
|
|
280 | LOG (llevDebug, "emergency save done.\n"); |
309 | LOG (llevInfo, "emergency_save: leave\n"); |
281 | } |
310 | } |
282 | |
311 | |
283 | // send all clients some informational text |
312 | // send all clients some informational text |
284 | static void |
313 | static void |
285 | cleanup_inform (const char *cause, bool make_core) |
314 | cleanup_inform (const char *cause, bool make_core) |
… | |
… | |
304 | cleanup (const char *cause, bool make_core) |
333 | cleanup (const char *cause, bool make_core) |
305 | { |
334 | { |
306 | if (make_core) |
335 | if (make_core) |
307 | fork_abort (cause); |
336 | fork_abort (cause); |
308 | |
337 | |
309 | LOG (llevError, "cleanup cause: %s\n", cause); |
338 | LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause); |
310 | |
339 | |
311 | if (!make_core) |
340 | if (!make_core) |
312 | cleanup_inform (cause, make_core); |
341 | cleanup_inform (cause, make_core); |
313 | |
342 | |
314 | LOG (llevDebug, "cleanup begin.\n"); |
343 | LOG (llevDebug, "cleanup begin.\n"); |
… | |
… | |
341 | _exit (make_core); |
370 | _exit (make_core); |
342 | } |
371 | } |
343 | |
372 | |
344 | /* |
373 | /* |
345 | * do_specials() is a collection of functions to call from time to time. |
374 | * do_specials() is a collection of functions to call from time to time. |
346 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
375 | * Modified 2000-1-14 MSW to use the global server_tick count to determine how |
347 | * often to do things. This will allow us to spred them out more often. |
376 | * often to do things. This will allow us to spred them out more often. |
348 | * I use prime numbers for the factor count - in that way, it is less likely |
377 | * I use prime numbers for the factor count - in that way, it is less likely |
349 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
378 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
350 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
379 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
351 | * done). Of course, there can still be times where multiple specials are |
380 | * done). Of course, there can still be times where multiple specials are |
… | |
… | |
353 | * |
382 | * |
354 | * I also think this code makes it easier to see how often we really are |
383 | * I also think this code makes it easier to see how often we really are |
355 | * doing the various things. |
384 | * doing the various things. |
356 | */ |
385 | */ |
357 | static void |
386 | static void |
358 | do_specials (void) |
387 | do_specials () |
359 | { |
388 | { |
360 | shstr::gc (); |
389 | shstr::gc (); |
361 | archetype::gc (); |
390 | archetype::gc (); |
362 | |
391 | |
363 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
392 | if (expect_false (!(server_tick % TICKS_PER_HOUR))) |
364 | maptile::adjust_daylight (); |
393 | maptile::adjust_daylight (); |
365 | |
394 | |
366 | if (expect_false (!(pticks % 2503))) |
395 | if (expect_false (!(server_tick % 2503))) |
367 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
396 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
368 | |
397 | |
369 | if (expect_false (!(pticks % 5003))) |
398 | if (expect_false (!(server_tick % 5003))) |
370 | write_book_archive (); |
399 | write_book_archive (); |
371 | |
400 | |
372 | if (expect_false (!(pticks % 5009))) |
401 | if (expect_false (!(server_tick % 5009))) |
373 | clean_friendly_list (); |
402 | clean_friendly_list (); |
374 | |
403 | |
375 | if (expect_false (!(pticks % 5011))) |
404 | if (expect_false (!(server_tick % 5011))) |
376 | obsolete_parties (); |
405 | obsolete_parties (); |
377 | |
406 | |
378 | if (expect_false (!(pticks % 12503))) |
407 | if (expect_false (!(server_tick % 12503))) |
379 | fix_luck (); |
408 | fix_luck (); |
380 | } |
409 | } |
381 | |
410 | |
382 | void |
411 | void |
383 | server_tick () |
412 | one_tick () |
384 | { |
413 | { |
385 | // first do the user visible stuff |
414 | // first do the user visible stuff |
386 | INVOKE_GLOBAL (CLOCK); |
415 | INVOKE_GLOBAL (CLOCK); |
387 | process_events (); // "do" something with objects with speed |
416 | process_events (); // "do" something with objects with speed |
388 | client::clock (); // draw client maps etc. |
417 | client::clock (); // draw client maps etc. |
389 | |
418 | |
390 | // then do some bookkeeping, should not really be here |
419 | // then do some bookkeeping, should not really be here |
391 | do_specials (); /* Routines called from time to time. */ |
420 | do_specials (); /* Routines called from time to time. */ |
392 | attachable::check_mortals (); |
421 | attachable::check_mortals (); |
393 | |
422 | |
394 | ++pticks; |
423 | // now that we aggressively reuse id's, this is very unlikely to happen... |
|
|
424 | if (object::object_count >= RESTART_COUNT) |
|
|
425 | cleanup ("running out of protocol ID values - need full restart"); |
395 | } |
426 | } |
396 | |
427 | |
397 | // normal main |
428 | // normal main |
398 | int |
429 | int |
399 | main (int argc, char **argv) |
430 | main (int argc, char **argv) |
400 | { |
431 | { |
401 | settings.argc = argc; |
432 | settings.argc = argc; |
402 | settings.argv = argv; |
433 | settings.argv = argv; |
403 | |
434 | |
404 | rndm.seed (time (0)); |
435 | rndm.seed (time (0)); |
405 | g_thread_init (0); // for the slice allocator only |
436 | g_thread_init (0); // for the slice allocator only |
406 | |
437 | |
|
|
438 | // temporary(?) testing hack |
|
|
439 | if (argc >= 2 && !strcmp (argv [1], "--noise")) |
|
|
440 | { |
|
|
441 | void noise_test (); |
|
|
442 | noise_test (); |
|
|
443 | exit (0); |
|
|
444 | } |
|
|
445 | |
|
|
446 | #if 0 |
|
|
447 | // code sometiems used for timing benchmarks |
|
|
448 | random_number_generator<freeciv_random_generator> rng; |
|
|
449 | rng.seed(0); |
|
|
450 | for (int i = 0; i < 10; ++i) |
|
|
451 | printf ("%08x\n", rng.get_u32()); |
|
|
452 | for (int i = 0; i < 1000000; ++i) |
|
|
453 | volatile int r = rng.get_u32 (); |
|
|
454 | cstamp s = stamp (); |
|
|
455 | for (int i = 0; i < 1000000; ++i) |
|
|
456 | volatile int r = rng.next (); |
|
|
457 | printf ("c %d\n", (int)measure (s)); |
|
|
458 | exit (0); |
|
|
459 | #endif |
|
|
460 | |
407 | init (argc, argv); |
461 | init (argc, argv); |
408 | |
462 | |
409 | for (;;) |
463 | for (;;) |
410 | cfperl_main (); |
464 | cfperl_main (); |
411 | } |
465 | } |