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.155 by root, Wed Apr 21 06:45:57 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. We do some error checking - its possible that the
108 * savebed map may no longer exist, so we make sure the player 46 * savebed map may no longer exist, so we make sure the player
143 81
144 if (contr && map != newmap && map) 82 if (contr && map != newmap && map)
145 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 83 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
146 return; 84 return;
147 85
148 // remove, so stupid ob_locked does not trigger a failure 86 // remove, so stupid blocked does not trigger a failure
149 remove (); 87 remove ();
150 88
151 /* try to find a spot for the player */ 89 /* try to find a spot for the player */
152 if (blocked (newmap, x, y)) 90 if (blocked (newmap, x, y))
153 { /* First choice blocked */ 91 { /* First choice blocked */
158 * Note that for the second and third calls, we could start at a position other 96 * 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. 97 * than one, but then we could end up on the other side of walls and so forth.
160 */ 98 */
161 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); 99 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
162 100
163 if (i == -1) 101 if (i < 0)
164 { 102 {
165 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
166 if (i == -1) 104 if (i < 0)
167 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 105 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
168 } 106 }
169 107
170 if (i != -1) 108 if (i >= 0)
171 { 109 {
172 x += freearr_x[i]; 110 x += freearr_x[i];
173 y += freearr_y[i]; 111 y += freearr_y[i];
174 } 112 }
175 else 113 else
184 122
185 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 123 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
186 return; 124 return;
187 } 125 }
188 126
189 this->x = x; 127 newmap->insert (this, x, y, 0, INS_NO_WALK_ON);
190 this->y = y;
191 map = newmap;
192
193 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
194 128
195 enemy = 0; 129 enemy = 0;
196 130
197 if (contr) 131 if (contr)
198 { 132 {
209 if (i < 0) 143 if (i < 0)
210 golem->drop_and_destroy (); 144 golem->drop_and_destroy ();
211 else 145 else
212 { 146 {
213 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 147 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
214 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 148 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
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.
249 183
250 for_all_players (pl) 184 for_all_players (pl)
251 { 185 {
252 object *ob = pl->ob; 186 object *ob = pl->ob;
253 187
188 // process_objects destroys the speed_left value
189 pl->speed_left_save = ob->speed_left;
190
254 if (expect_false (!ob || !pl->ns || !ob->active)) 191 if (expect_false (!ob || !pl->ns || !ob->active))
255 continue; 192 continue;
256 193
257 do_some_living (ob); 194 do_some_living (ob);
258 } 195 }
262process_players2 () 199process_players2 ()
263{ 200{
264 /* Then check if any players should use weapon-speed instead of speed */ 201 /* Then check if any players should use weapon-speed instead of speed */
265 for_all_players (pl) 202 for_all_players (pl)
266 { 203 {
204 // restore speed_left value saved by process_players1
205 pl->ob->speed_left = pl->speed_left_save;
206
267 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); 207 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); 208 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
269 } 209 }
270} 210}
271 211
272void 212static void
273process_events () 213process_events ()
274{ 214{
275 process_players1 (); 215 process_players1 ();
276 216
277 for_all_actives (op) 217 for_all_actives (op)
278 { 218 {
219 // try to prefetch some stuff we expect to need
220 // obviously, it should be grouped into the same cacheline.
221 // preliminary results indicate that this gives halves the speed
222 // used for the inner loop
223 if (_i < actives.size ()) // HACK, rely on _i :/
224 {
225 object *next = actives [_i + 1];
226
227 prefetch (&next->flag , 0, 1);
228 prefetch (&next->speed , 0, 1);
229 prefetch (&next->anim_speed, 0, 1);
230 prefetch (&next->contr , 0, 1);
231 }
232
279 /* Now process op */ 233 /* Now process op */
280 if (expect_false (QUERY_FLAG (op, FLAG_FREED))) 234 if (expect_false (op->flag [FLAG_FREED]))
281 { 235 {
282 LOG (llevError, "BUG: process_events(): Free object on list\n"); 236 LOG (llevError, "BUG: process_events(): Free object on list\n");
283 op->set_speed (0); 237 op->set_speed (0);
284 continue; 238 continue;
285 } 239 }
315 { 269 {
316 --op->speed_left; 270 --op->speed_left;
317 process_object (op); 271 process_object (op);
318 } 272 }
319 273
320 if (expect_true (!op->contr)) 274 // this will destroy the speed_left value for players, but
275 // process_players1 and ..2 save/restore the real value,
276 // so we can avoid a costly test here.
321 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 277 op->speed_left = min (op->speed, op->speed_left + op->speed);
322 } 278 }
323 279
324 process_players2 (); 280 process_players2 ();
325} 281}
326 282
410 * done on the same tick, but that will happen very infrequently 366 * done on the same tick, but that will happen very infrequently
411 * 367 *
412 * I also think this code makes it easier to see how often we really are 368 * I also think this code makes it easier to see how often we really are
413 * doing the various things. 369 * doing the various things.
414 */ 370 */
415void 371static void
416do_specials (void) 372do_specials ()
417{ 373{
418 shstr::gc (); 374 shstr::gc ();
419 archetype::gc (); 375 archetype::gc ();
420 376
421 if (expect_false (!(pticks % TICKS_PER_HOUR))) 377 if (expect_false (!(pticks % TICKS_PER_HOUR)))
448 // then do some bookkeeping, should not really be here 404 // then do some bookkeeping, should not really be here
449 do_specials (); /* Routines called from time to time. */ 405 do_specials (); /* Routines called from time to time. */
450 attachable::check_mortals (); 406 attachable::check_mortals ();
451 407
452 ++pticks; 408 ++pticks;
409
410 if (object::object_count >= RESTART_COUNT)
411 cleanup ("running out of protocol ID values - need full restart");
453} 412}
454 413
455// normal main 414// normal main
456int 415int
457main (int argc, char **argv) 416main (int argc, char **argv)

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines