ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
(Generate patch)

Comparing deliantra/server/server/main.C (file contents):
Revision 1.139 by root, Mon Oct 12 14:00:59 2009 UTC vs.
Revision 1.161 by root, Thu Apr 29 08:26:38 2010 UTC

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 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.
33 33
34#include <../random_maps/random_map.h> 34#include <../random_maps/random_map.h>
35#include <../random_maps/rproto.h> 35#include <../random_maps/rproto.h>
36#include "path.h" 36#include "path.h"
37 37
38static char days[7][4] = {
39 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
40};
41
42void 38void
43version (object *op) 39version (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
47#if 0
48 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
49 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
50 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
51 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
52 new_draw_info (NDI_UNIQUE, 0, op, "");
53 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
54 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
55 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
56 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
57 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
60 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
65 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
66 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
67 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
71 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
88 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
91 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
92 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
93 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
94 new_draw_info (NDI_UNIQUE, 0, op, "");
95 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
96 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
97 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
98 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
99 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
100 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
101 new_draw_info (NDI_UNIQUE, 0, op, "");
102 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
103#endif
104} 42}
105 43
106/* 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
107 * savebed. We do some error checking - its possible that the 45 * savebed.
108 * savebed map may no longer exist, so we make sure the player
109 * goes someplace.
110 */ 46 */
111void 47void
112enter_player_savebed (object *op) 48enter_player_savebed (object *op)
113{ 49{
114 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);
119 * 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
120 * 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
121 * whatever reason. If default map coordinates are to be used, then 57 * whatever reason. If default map coordinates are to be used, then
122 * the function that calls this should figure them out. 58 * the function that calls this should figure them out.
123 */ 59 */
124void 60bool
125object::enter_map (maptile *newmap, int x, int y) 61object::enter_map (maptile *newmap, int x, int y)
126{ 62{
127 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) 63 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
128 return; 64 return false;
129 65
130 if (out_of_map (newmap, x, y)) 66 if (out_of_map (newmap, x, y))
131 { 67 {
132 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);
133 x = newmap->enter_x; 69 x = newmap->enter_x;
135 if (out_of_map (newmap, x, y)) 71 if (out_of_map (newmap, x, y))
136 { 72 {
137 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",
138 &newmap->path, x, y, newmap->width, newmap->height); 74 &newmap->path, x, y, newmap->width, newmap->height);
139 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); 75 new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
140 return; 76 return false;
141 } 77 }
142 } 78 }
143 79
144 if (contr && map != newmap && map) 80 if (contr && map != newmap && map)
145 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 81 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
146 return; 82 return false;
147 83
148 // remove, so stupid ob_locked does not trigger a failure 84 // remove, so stupid blocked does not trigger a failure
149 remove (); 85 remove ();
150 86
151 /* try to find a spot for the player */ 87 /* try to find a spot for the player */
152 if (blocked (newmap, x, y)) 88 if (blocked (newmap, x, y))
153 { /* First choice blocked */ 89 { /* First choice blocked */
158 * 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
159 * 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.
160 */ 96 */
161 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);
162 98
163 if (i == -1) 99 if (i < 0)
164 { 100 {
165 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 101 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
166 if (i == -1) 102 if (i < 0)
167 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
168 } 104 }
169 105
170 if (i != -1) 106 if (i >= 0)
171 { 107 {
172 x += freearr_x[i]; 108 x += freearr_x[i];
173 y += freearr_y[i]; 109 y += freearr_y[i];
174 } 110 }
175 else 111 else
178 } 114 }
179 115
180 if (contr && map != newmap) 116 if (contr && map != newmap)
181 { 117 {
182 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) 118 if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
183 return; 119 return false;
184 120
185 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 121 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
186 return; 122 return false;
187 } 123 }
188
189 this->x = x;
190 this->y = y;
191 map = newmap;
192
193 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
194 124
195 enemy = 0; 125 enemy = 0;
196 126
127 //newmap->insert (this, x, y);
128 newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT);
129
130 if (map == newmap) // see if we actually arrived there - insert might trigger a teleport
131 {
197 if (contr) 132 if (contr)
198 { 133 {
199 contr->maplevel = newmap->path; 134 contr->maplevel = newmap->path;
200 contr->count = 0; 135 contr->count = 0;
201 }
202 136
203 /* Update any golems */ 137 /* Update any golems */
204 if (type == PLAYER)
205 if (object *golem = contr->golem) 138 if (object *golem = contr->golem)
206 { 139 {
207 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); 140 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
208 141
209 if (i < 0) 142 if (i < 0)
210 golem->drop_and_destroy (); 143 golem->drop_and_destroy ();
211 else 144 else
212 { 145 {
213 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 146 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
214 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 147 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
148 }
215 } 149 }
216 } 150 }
217 151
218 /* since the players map is already loaded, we don't need to worry 152 /* since the players map is already loaded, we don't need to worry
219 * about pending objects. 153 * about pending objects.
220 */ 154 */
221 remove_all_pets (newmap); 155 move_all_pets ();
156
157 return true;
158 }
159
160 return false;
222} 161}
223 162
224/* process_players1 and process_players2 do all the player related stuff. 163/* process_players1 and process_players2 do all the player related stuff.
225 * I moved it out of process events and process_map. This was to some 164 * I moved it out of process events and process_map. This was to some
226 * extent for debugging as well as to get a better idea of the time used 165 * extent for debugging as well as to get a better idea of the time used
249 188
250 for_all_players (pl) 189 for_all_players (pl)
251 { 190 {
252 object *ob = pl->ob; 191 object *ob = pl->ob;
253 192
193 // process_objects destroys the speed_left value
194 pl->speed_left_save = ob->speed_left;
195
254 if (expect_false (!ob || !pl->ns || !ob->active)) 196 if (expect_false (!ob || !pl->ns || !ob->active))
255 continue; 197 continue;
256 198
257 do_some_living (ob); 199 do_some_living (ob);
258 } 200 }
262process_players2 () 204process_players2 ()
263{ 205{
264 /* Then check if any players should use weapon-speed instead of speed */ 206 /* Then check if any players should use weapon-speed instead of speed */
265 for_all_players (pl) 207 for_all_players (pl)
266 { 208 {
209 // restore speed_left value saved by process_players1
210 pl->ob->speed_left = pl->speed_left_save;
211
267 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); 212 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
268 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); 213 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
269 } 214 }
270} 215}
271 216
272void 217static void
273process_events () 218process_events ()
274{ 219{
275 process_players1 (); 220 process_players1 ();
276 221
277 for_all_actives (op) 222 for_all_actives (op)
278 { 223 {
224 // try to prefetch some stuff we expect to need
225 // obviously, it should be grouped into the same cacheline.
226 // preliminary results indicate that this gives halves the speed
227 // used for the inner loop
228 if (_i < actives.size ()) // HACK, rely on _i :/
229 {
230 object *next = actives [_i + 1];
231
232 prefetch (&next->flag , 0, 1);
233 prefetch (&next->speed , 0, 1);
234 prefetch (&next->anim_speed, 0, 1);
235 prefetch (&next->contr , 0, 1);
236 }
237
279 /* Now process op */ 238 /* Now process op */
280 if (expect_false (QUERY_FLAG (op, FLAG_FREED))) 239 if (expect_false (op->flag [FLAG_FREED]))
281 { 240 {
282 LOG (llevError, "BUG: process_events(): Free object on list\n"); 241 LOG (llevError, "BUG: process_events(): Free object on list\n");
283 op->set_speed (0); 242 op->set_speed (0);
284 continue; 243 continue;
285 } 244 }
315 { 274 {
316 --op->speed_left; 275 --op->speed_left;
317 process_object (op); 276 process_object (op);
318 } 277 }
319 278
320 if (expect_true (!op->contr)) 279 // this will destroy the speed_left value for players, but
280 // process_players1 and ..2 save/restore the real value,
281 // so we can avoid a costly test here.
321 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 282 op->speed_left = min (op->speed, op->speed_left + op->speed);
322 } 283 }
323 284
324 process_players2 (); 285 process_players2 ();
325} 286}
326 287
327/* clean up everything before exiting */ 288/* clean up everything before exiting */
328void 289void
329emergency_save () 290emergency_save ()
330{ 291{
331 LOG (llevDebug, "emergency save begin.\n"); 292 LOG (llevInfo, "emergency_save: enter\n");
293
294 LOG (llevInfo, "emergency_save: saving book archive\n");
295 write_book_archive ();
332 296
333 cfperl_emergency_save (); 297 cfperl_emergency_save ();
334 298
335 LOG (llevDebug, "saving book archive.\n");
336 write_book_archive ();
337
338 LOG (llevDebug, "emergency save done.\n"); 299 LOG (llevInfo, "emergency_save: leave\n");
339} 300}
340 301
341// send all clients some informational text 302// send all clients some informational text
342static void 303static void
343cleanup_inform (const char *cause, bool make_core) 304cleanup_inform (const char *cause, bool make_core)
362cleanup (const char *cause, bool make_core) 323cleanup (const char *cause, bool make_core)
363{ 324{
364 if (make_core) 325 if (make_core)
365 fork_abort (cause); 326 fork_abort (cause);
366 327
367 LOG (llevError, "cleanup cause: %s\n", cause); 328 LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause);
368 329
369 if (!make_core) 330 if (!make_core)
370 cleanup_inform (cause, make_core); 331 cleanup_inform (cause, make_core);
371 332
372 LOG (llevDebug, "cleanup begin.\n"); 333 LOG (llevDebug, "cleanup begin.\n");
410 * done on the same tick, but that will happen very infrequently 371 * done on the same tick, but that will happen very infrequently
411 * 372 *
412 * I also think this code makes it easier to see how often we really are 373 * I also think this code makes it easier to see how often we really are
413 * doing the various things. 374 * doing the various things.
414 */ 375 */
415void 376static void
416do_specials (void) 377do_specials ()
417{ 378{
418 shstr::gc (); 379 shstr::gc ();
419 archetype::gc (); 380 archetype::gc ();
420 381
421 if (expect_false (!(pticks % TICKS_PER_HOUR))) 382 if (expect_false (!(pticks % TICKS_PER_HOUR)))
448 // then do some bookkeeping, should not really be here 409 // then do some bookkeeping, should not really be here
449 do_specials (); /* Routines called from time to time. */ 410 do_specials (); /* Routines called from time to time. */
450 attachable::check_mortals (); 411 attachable::check_mortals ();
451 412
452 ++pticks; 413 ++pticks;
414
415 if (object::object_count >= RESTART_COUNT)
416 cleanup ("running out of protocol ID values - need full restart");
453} 417}
454 418
455// normal main 419// normal main
456int 420int
457main (int argc, char **argv) 421main (int argc, char **argv)

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines