[ViewVC] Diff of: cvs/deliantra/server/common/arch.C

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC vs.
Revision 1.69 by root, Tue Sep 4 18:20:35 2007 UTC

…		…
1	/*	1	/*
2	* CrossFire, A Multiplayer game for X-windows	2	* This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3	*	3	*
4	* Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team	4	* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5	* Copyright (C) 2002 Mark Wedel & Crossfire Development Team	5	* Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6	* Copyright (C) 1992 Frank Tore Johansen	6	* Copyright (©) 1992,2007 Frank Tore Johansen
7	*	7	*
8	* This program is free software; you can redistribute it and/or modify	8	* Crossfire TRT is free software: you can redistribute it and/or modify
9	* it under the terms of the GNU General Public License as published by	9	* it under the terms of the GNU General Public License as published by
10	* the Free Software Foundation; either version 2 of the License, or	10	* the Free Software Foundation, either version 3 of the License, or
11	* (at your option) any later version.	11	* (at your 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 GNU General Public License
19	* along with this program; if not, write to the Free Software	19	* along with this program. If not, see <http://www.gnu.org/licenses/>.
20	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21	*	20	*
22	* The authors can be reached via e-mail at <crossfire@schmorp.de>	21	* The authors can be reached via e-mail to <crossfire@schmorp.de>
23	*/	22	*/
24		23
25	#include <cassert>	24	#include <cassert>
26		25
27	#include <global.h>	26	#include <global.h>
37	* return an object. Perhaps those should be called 'archob' functions	36	* return an object. Perhaps those should be called 'archob' functions
38	* to denote they return an object derived from the archetype.	37	* to denote they return an object derived from the archetype.
39	* MSW 2003-04-29	38	* MSW 2003-04-29
40	*/	39	*/
41		40
42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing	41	archetype *loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43		42
44	// the hashtable	43	// the hashtable
45	typedef std::tr1::unordered_map	44	typedef std::tr1::unordered_map
46	<	45	<
47	const char *,	46	const char *,
…		…
50	str_equal,	49	str_equal,
51	slice_allocator< std::pair<const char *const, arch_ptr> >	50	slice_allocator< std::pair<const char *const, arch_ptr> >
52	> HT;	51	> HT;
53		52
54	static HT ht (5000);	53	static HT ht (5000);
55	static std::vector<archetype *> archetypes;	54	archvec archetypes;
56		55
57	/**	56	/**
58	* GROS - This function retrieves an archetype given the name that appears	57	* GROS - This function retrieves an archetype given the name that appears
59	* during the game (for example, "writing pen" instead of "stylus").	58	* during the game (for example, "writing pen" instead of "stylus").
60	* It does not use the hashtable system, but browse the whole archlist each time.	59	* It does not use the hashtable system, but browse the whole archlist each time.
…		…
68	archetype *	67	archetype *
69	find_archetype_by_object_name (const char *name)	68	find_archetype_by_object_name (const char *name)
70	{	69	{
71	shstr_cmp name_cmp (name);	70	shstr_cmp name_cmp (name);
72		71
73	for (archetype *at = first_archetype; at; at = at->next)	72	for_all_archetypes (at)
74	if (at->clone.name == name_cmp)	73	if (at->name == name_cmp)
75	return at;	74	return at;
76		75
77	return 0;	76	return 0;
78	}	77	}
79		78
…		…
85	archetype *	84	archetype *
86	find_archetype_by_object_type_name (int type, const char *name)	85	find_archetype_by_object_type_name (int type, const char *name)
87	{	86	{
88	shstr_cmp name_cmp (name);	87	shstr_cmp name_cmp (name);
89		88
90	for (archetype *at = first_archetype; at; at = at->next)	89	for_all_archetypes (at)
91	if (at->clone.name == name_cmp && at->clone.type == type)	90	if (at->name == name_cmp && at->type == type)
92	return at;	91	return at;
93		92
94	return 0;	93	return 0;
95	}	94	}
96		95
…		…
102	object *	101	object *
103	get_archetype_by_skill_name (const char *skill, int type)	102	get_archetype_by_skill_name (const char *skill, int type)
104	{	103	{
105	shstr_cmp skill_cmp (skill);	104	shstr_cmp skill_cmp (skill);
106		105
107	for (archetype *at = first_archetype; at; at = at->next)	106	for_all_archetypes (at)
108	if (at->clone.skill == skill_cmp && (type == -1 \|\| type == at->clone.type))	107	if (at->skill == skill_cmp && (type == -1 \|\| type == at->type))
109	return arch_to_object (at);	108	return arch_to_object (at);
110		109
111	return 0;	110	return 0;
112	}	111	}
113		112
…		…
119	* (eg, skills)	118	* (eg, skills)
120	*/	119	*/
121	archetype *	120	archetype *
122	get_archetype_by_type_subtype (int type, int subtype)	121	get_archetype_by_type_subtype (int type, int subtype)
123	{	122	{
124	for (archetype *at = first_archetype; at; at = at->next)	123	for_all_archetypes (at)
125	if ((type == -1 \|\| type == at->clone.type) && (subtype == -1 \|\| subtype == at->clone.subtype))	124	if ((type == -1 \|\| type == at->type) && (subtype == -1 \|\| subtype == at->subtype))
126	return at;	125	return at;
127		126
128	return 0;	127	return 0;
129	}	128	}
130		129
…		…
157	}	156	}
158		157
159	return create_singularity (name);	158	return create_singularity (name);
160	}	159	}
161		160
162	/* This is a subset of the parse_id command. Basically, name can be	161	/* This is a subset of the parse_id command. Basically, name can be
163	* a string seperated lists of things to match, with certain keywords.	162	* a string seperated lists of things to match, with certain keywords.
164	* pl is the player (only needed to set count properly)	163	* pl is the player (only needed to set count properly)
165	* op is the item we are trying to match. Calling function takes care	164	* op is the item we are trying to match. Calling function takes care
166	* of what action might need to be done and if it is valid	165	* of what action might need to be done and if it is valid
167	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher	166	* (pickup, drop, etc.) Return NONZERO if we have a match. A higher
168	* value means a better match. 0 means no match.	167	* value means a better match. 0 means no match.
169	*	168	*
170	* Brief outline of the procedure:	169	* Brief outline of the procedure:
171	* We take apart the name variable into the individual components.	170	* We take apart the name variable into the individual components.
172	* cases for 'all' and unpaid are pretty obvious.	171	* cases for 'all' and unpaid are pretty obvious.
173	* Next, we check for a count (either specified in name, or in the	172	* Next, we check for a count (either specified in name, or in the
174	* player object.)	173	* player object.)
175	* If count is 1, make a quick check on the name.	174	* If count is 1, make a quick check on the name.
176	* IF count is >1, we need to make plural name. Return if match.	175	* IF count is >1, we need to make plural name. Return if match.
177	* Last, make a check on the full name.	176	* Last, make a check on the full name.
178	*/	177	*/
179	int	178	int
180	item_matched_string (object pl, object op, const char *name)	179	item_matched_string (object pl, object op, const char *name)
181	{	180	{
182	char *cp, local_name[MAX_BUF];	181	char *cp, local_name[MAX_BUF];
183	int count, retval = 0;	182	int count, retval = 0;
…		…
275	}	274	}
276		275
277	return 0;	276	return 0;
278	}	277	}
279		278
280	archetype::archetype ()	279	archetype::archetype (const char *name)
281	{	280	{
		281	stub = true;
282	clone.arch = this;	282	arch = this;
283		283	this->archname = this->name = this->name_pl = name;
284	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
285	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
286	}	284	}
287		285
288	archetype::~archetype ()	286	archetype::~archetype ()
289	{	287	{
290	//TODO: nuke ->more's	288	unlink ();
291	}	289	}
292		290
293	static void
294	unlink (archetype *at)
295	{
296	if (at->head)
297	at = at->head;
298
299	// destroy this archetype's link, making singletons out of its parts
300	while (at)
301	{
302	archetype *more = at->more;
303	at->clone.destroy_inv ();
304	at->head = at->more = 0;
305	at = more;
306	}
307	}
308
309	// dire hack, need to rationalise
310	void	291	void
311	overwrite (archetype at, object op)	292	archetype::link ()
312	{	293	{
313	at->clone = *op;	294	ht.insert (std::make_pair (archname, this));
314
315	at->clone.arch = at;
316	at->clone.inv = op->inv; op->inv = 0;
317		295
318	op->destroy ();	296	if (!archetypes.contains (this))
		297	archetypes.insert (this);
319	}	298	}
320		299
321	bool	300	void
		301	archetype::unlink ()
		302	{
		303	ht.erase (archname);
		304
		305	if (archetypes.contains (this))
		306	archetypes.erase (this);
		307	}
		308
		309	/*
		310	* Finds, using the hashtable, which archetype matches the given name.
		311	* returns a pointer to the found archetype, otherwise NULL.
		312	*/
		313	archetype *
		314	archetype::find (const char *name)
		315	{
		316	if (!name)
		317	return 0;
		318
		319	auto (i, ht.find (name));
		320
		321	if (i == ht.end ())
		322	return 0;
		323	else
		324	return i->second;
		325	}
		326
		327	archetype *
		328	archetype::get (const char *name)
		329	{
		330	if (!name)
		331	{
		332	LOG (llevError, "null archetype requested\n");
		333	name = "(null)";
		334	}
		335
		336	if (loading_arch && !strcmp (&loading_arch->archname, name))
		337	return loading_arch;
		338
		339	archetype *at = find (name);
		340
		341	if (!at)
		342	{
		343	at = new archetype (name);
		344	at->link ();
		345	}
		346
		347	return at;
		348	}
		349
		350	archetype *
322	archetype::load (object_thawer &f)	351	archetype::read (object_thawer &f)
323	{	352	{
324	assert (f.kw == KW_object);	353	assert (f.kw == KW_object);
325		354
326	typedef std::pair<archetype , object > part;
327	std::vector<part> parts;	355	std::vector<archetype *> parts;
		356
		357	coroapi::cede_to_tick_every (10);
328		358
329	for (;;)	359	for (;;)
330	{	360	{
		361	// the archetype might have been referenced earlier
		362	// so try to find an existing stub archetype first
331	archetype *at = get (f.get_str ());	363	archetype *at = find (f.get_str ());
332	object *op = object::create ();
333		364
		365	if (!at \|\| !at->stub)
		366	at = new archetype (f.get_str ());
		367
		368	f.next ();
		369
		370	#if 0
		371	// implementing it here in the server does neither allow multiple inheritence
		372	// nor does it cleanly "just override". it would allow use in map files, though,
		373	// and other resource files dynamically laoded (as opposed to being preprocessed).
		374	// not that any of this is relevant as of yet...
		375	if (f.kw == KW_inherit)
		376	{
		377	if (archetype *at = find (f.get_str ()))
		378	*op = at->clone;
		379	else
		380	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		381	&at->archname, f.get_str ());
		382
		383	f.next ();
		384	}
		385	#endif
		386
		387	loading_arch = at; // hack to tell parse_kv et al. to behave
		388	bool parse_ok = at->parse_kv (f);
		389	loading_arch = 0;
		390
334	if (!op->parse_kv (f))	391	if (!parse_ok)
335	goto fail;	392	goto fail;
336		393
337	parts.push_back (std::make_pair (at, op));	394	loading_arch = at; // hack to tell parse_kv et al. to behave
		395	at->post_load_check ();
		396	loading_arch = 0;
		397
		398	parts.push_back (at);
338		399
339	if (f.kw != KW_more)	400	if (f.kw != KW_more)
340	break;	401	break;
341		402
342	f.next ();	403	f.next ();
		404
343	assert (f.kw == KW_object);	405	if (f.kw != KW_object)
		406	{
		407	f.parse_error ("more object");
		408	goto fail;
		409	}
344	}	410	}
345		411
346	{	412	{
		413	auto (at, parts.begin ());
		414
347	archetype *head = parts.front ().first;	415	archetype *new_head = parts.front ();
		416	archetype *old_head = find (new_head->archname);
348		417
349	// check that all archetypes belong to the same object or are heads	418	if (old_head && !old_head->is_head ())
350	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
351	{	419	{
352	archetype *at = p->first;	420	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		421	&new_head->archname, &old_head->archname);
		422	goto fail;
		423	}
353		424
354	if (at->head != head && at->head)	425	// check that all archetypes belong to the same old object or are new
		426	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		427	{
		428	archetype new_part = at;
		429	archetype *old_part = find (new_part->archname);
		430
		431	if (old_part && old_part->head_ () != old_head)
355	{	432	{
356	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);	433	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
357	goto fail;	434	&new_part->archname, &((archetype *)old_part->head_ ())->archname);
358	}
359
360	if (at->next && at != head)
361	{
362	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
363	goto fail;	435	goto fail;
364	}	436	}
365	}	437	}
366		438
367	// sever chain of existing head object	439	// deactivate existing archetype
368	for (archetype more, at = head; at; at = more)	440	for (archetype at = old_head; at; at = (archetype )at->more)
		441	at->unlink ();
		442
		443	// assemble new chain
		444	new_head->min_x = new_head->max_x = new_head->x;
		445	new_head->min_y = new_head->max_y = new_head->y;
		446
		447	archetype *less = new_head;
		448	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
369	{	449	{
370	more = at->more;	450	archetype at = p;
371		451
		452	// some flags get inherited formt he head (probably a lot more)
		453	// doing it here doesn't feel too cozy, but it allows code
		454	// to ignore head checks for these flags, which saves time
		455	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		456	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		457	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		458	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		459
		460	if (at->x < new_head->min_x) new_head->min_x = at->x;
		461	if (at->y < new_head->min_y) new_head->min_y = at->y;
		462	if (at->x > new_head->max_x) new_head->max_x = at->x;
		463	if (at->y > new_head->max_y) new_head->max_y = at->y;
		464
372	at->head = 0;	465	at->head = new_head;
373	at->more = 0;	466	less->more = at;
		467	less = at;
374	}	468	}
375		469
376	// replace/update head	470	// now activate it
377	overwrite (head, parts.front ().second);	471	for (auto (p, parts.begin ()); p != parts.end (); ++p)
378	head->tail_x = 0;
379	head->tail_y = 0;
380
381	// link into list of heads, if not already there
382	if (!head->linked)
383	{	472	{
384	head->linked = true;	473	archetype at = p;
385	head->next = first_archetype;	474	at->stub = false;
386	first_archetype = head;	475	at->link ();
387	}	476	}
388		477
389	// reassemble new chain	478	return new_head;
390	archetype *prev = head;
391	for (AUTODECL (p, parts.begin () + 1); p != parts.end (); ++p)
392	{
393	archetype *at = p->first;
394	overwrite (at, p->second);
395
396	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
397	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
398
399	at->head = head;
400	at->clone.head = &head->clone;
401	prev->more = at;
402	prev->clone.more = &at->clone;
403
404	prev = at;
405	}
406	}	479	}
407		480
408	return true;
409
410	fail:	481	fail:
411	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)	482	for (auto (p, parts.begin ()); p != parts.end (); ++p)
412	p->second->destroy (true);	483	(*p)->destroy (true);
413		484
414	return false;	485	return 0;
415	}	486	}
416		487
417	/*	488	/*
418	* Reads/parses the archetype-file, and copies into a linked list	489	* Initialize global archtype pointers:
419	* of archetype-structures.
420	*/	490	*/
421	static bool	491	void
422	load_archetypes (object_thawer &f)	492	init_archetype_pointers ()
423	{	493	{
424	for (;;)	494	ring_arch = archetype::find ("ring");
425	{	495	amulet_arch = archetype::find ("amulet");
426	switch (f.kw)	496	staff_arch = archetype::find ("staff");
427	{	497	crown_arch = archetype::find ("crown");
428	case KW_object:
429	loading_arch = true;
430	if (!archetype::load (f))
431	{
432	loading_arch = false;
433	return false;
434	}
435
436	loading_arch = false;
437	continue;
438
439	case KW_EOF:
440	return true;
441
442	default:
443	if (!f.parse_error ("archetypes file"))
444	return false;
445	}
446
447	f.next ();
448	}
449	}
450
451	/*
452	* First initialises the archtype hash-table (init_archetable()).
453	* Reads and parses the archetype file (with the first and second-pass
454	* functions).
455	*/
456	bool
457	load_archetype_file (const char *filename)
458	{
459	object_thawer f (filename);
460
461	f.next ();
462
463	// make sure the next - long - step is only done after a tick
464	coroapi::wait_for_tick_begin ();
465
466	if (!load_archetypes (f))
467	return false;
468
469	warn_archetypes = 1;
470
471	empty_archetype = archetype::find ("empty_archetype");	498	empty_archetype = archetype::find ("empty_archetype");
472	if (!empty_archetype)
473	return false;
474
475	coroapi::cede ();
476
477	return true;
478	}	499	}
479		500
480	/*	501	/*
481	* Creates and returns a new object which is a copy of the given archetype.	502	* Creates and returns a new object which is a copy of the given archetype.
482	* This function returns NULL on failure.	503	* This function returns NULL on failure.
…		…
484	object *	505	object *
485	arch_to_object (archetype *at)	506	arch_to_object (archetype *at)
486	{	507	{
487	if (!at)	508	if (!at)
488	{	509	{
489	if (warn_archetypes)
490	LOG (llevError, "Couldn't find archetype.\n");	510	LOG (llevError, "Couldn't find archetype.\n");
491
492	return NULL;	511	return 0;
493	}	512	}
494		513
495	object *op = at->clone.clone ();	514	object *op = at->clone ();
496	op->arch = at;	515	op->arch = at;
497	op->instantiate ();	516	op->instantiate ();
		517
498	return op;	518	return op;
499	}	519	}
500		520
501	/*	521	/*
502	* Creates an object. This function is called by get_archetype()	522	* Creates an object. This function is called by get_archetype()
…		…
505	* an object, and never NULL.	525	* an object, and never NULL.
506	*/	526	*/
507	object *	527	object *
508	create_singularity (const char *name)	528	create_singularity (const char *name)
509	{	529	{
510	object *op;	530	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		531
		532	if (!strcmp (name, "bug"))
		533	abort ();
		534
511	char buf[MAX_BUF];	535	char buf[MAX_BUF];
		536	sprintf (buf, "bug, please report (%s)", name);
512		537
513	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	538	object *op = get_archetype ("bug");
514	op = object::create ();
515	op->name = op->name_pl = buf;	539	op->name = op->name_pl = buf;
516	SET_FLAG (op, FLAG_NO_PICK);	540
517	return op;	541	return op;
518	}	542	}
519		543
520	/*	544	/*
521	* Finds which archetype matches the given name, and returns a new	545	* Finds which archetype matches the given name, and returns a new
…		…
531		555
532	return arch_to_object (at);	556	return arch_to_object (at);
533	}	557	}
534		558
535	/*	559	/*
536	* Finds, using the hashtable, which archetype matches the given name.
537	* returns a pointer to the found archetype, otherwise NULL.
538	*/
539	archetype *
540	archetype::find (const char *name)
541	{
542	if (!name)
543	return 0;
544
545	AUTODECL (i, ht.find (name));
546
547	if (i == ht.end ())
548	return 0;
549	else
550	return i->second;
551	}
552
553	archetype *
554	archetype::get (const char *name)
555	{
556	archetype *at = find (name);
557
558	if (!at)
559	{
560	archetypes.push_back (at = new archetype);
561	at->name = name;
562	at->hash_add ();
563	}
564
565	return at;
566	}
567
568	/*
569	* Adds an archetype to the hashtable.
570	*/
571	void
572	archetype::hash_add ()
573	{
574	ht.insert (std::make_pair (name, this));
575	}
576
577	void
578	archetype::hash_del ()
579	{
580	ht.erase (name);
581	}
582
583	/*
584	* Returns the first archetype using the given type.	560	* Returns the first archetype using the given type.
585	* Used in treasure-generation.	561	* Used in treasure-generation.
586	*/	562	*/
587	archetype *	563	archetype *
588	type_to_archetype (int type)	564	type_to_archetype (int type)
589	{	565	{
590	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	566	for_all_archetypes (at)
591	if (at->clone.type == type)	567	if (at->type == type && at->head_ () != at)
592	return at;	568	return at;
593		569
594	return 0;	570	return 0;
595	}	571	}
596		572
…		…
608	{	584	{
609	LOG (llevError, "Can't clone archetype %d\n", type);	585	LOG (llevError, "Can't clone archetype %d\n", type);
610	return 0;	586	return 0;
611	}	587	}
612		588
613	object *op = at->clone.clone ();	589	object *op = at->clone ();
614	op->instantiate ();	590	op->instantiate ();
615	return op;	591	return op;
616	}	592	}
617		593
618	/*	594	/*
619	* member: make instance from class	595	* member: make instance from class
620	*/	596	*/
621
622	object *	597	object *
623	object_create_arch (archetype *at)	598	object_create_arch (archetype *at)
624	{	599	{
625	object op, prev = 0, *head = 0;	600	object op, prev = 0, *head = 0;
626		601
627	while (at)	602	while (at)
628	{	603	{
629	op = arch_to_object (at);	604	op = arch_to_object (at);
		605
630	op->x = at->clone.x;	606	op->x = at->x;
631	op->y = at->clone.y;	607	op->y = at->y;
632		608
633	if (head)	609	if (head)
634	op->head = head, prev->more = op;	610	op->head = head, prev->more = op;
635		611
636	if (!head)	612	if (!head)
637	head = op;	613	head = op;
638		614
639	prev = op;	615	prev = op;
640	at = at->more;	616	at = (archetype *)at->more;
641	}	617	}
642		618
643	return (head);	619	return head;
644	}	620	}
645		621

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing deliantra/server/common/arch.C (file contents): Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC vs. Revision 1.69 by root, Tue Sep 4 18:20:35 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC vs.
Revision 1.69 by root, Tue Sep 4 18:20:35 2007 UTC