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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.49 by root, Mon Apr 16 12:37:08 2007 UTC vs.
Revision 1.68 by root, Sun Jul 1 05:00:17 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>
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	if (!strcmp (&archname, "Gaea")) fprintf (stderr, "oI\n");//D
		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	archetype *at = find (name);
		337
		338	if (!at)
		339	{
		340	at = new archetype (name);
		341	at->link ();
		342	}
		343
		344	return at;
		345	}
		346
		347	archetype *
322	archetype::load (object_thawer &f)	348	archetype::read (object_thawer &f)
323	{	349	{
324	assert (f.kw == KW_object);	350	assert (f.kw == KW_object);
325		351
326	typedef std::pair<archetype , object > part;	352	loading_arch = true; // hack to tell parse_kv et al. to behave
		353
327	std::vector<part> parts;	354	std::vector<archetype *> parts;
		355
		356	coroapi::cede_to_tick_every (10);
328		357
329	for (;;)	358	for (;;)
330	{	359	{
		360	// the archetype might have been referenced earlier
		361	// so try to find an existing stub archetype first
331	archetype *at = get (f.get_str ());	362	archetype *at = find (f.get_str ());
332	object *op = object::create ();
333		363
		364	if (!at \|\| !at->stub)
		365	at = new archetype (f.get_str ());
		366
		367	f.next ();
		368
		369	#if 0
		370	// implementing it here in the server does neither allow multiple inheritence
		371	// nor does it cleanly "just override". it would allow use in map files, though,
		372	// and other resource files dynamically laoded (as opposed to being preprocessed).
		373	// not that any of this is relevant as of yet...
		374	if (f.kw == KW_inherit)
		375	{
		376	if (archetype *at = find (f.get_str ()))
		377	*op = at->clone;
		378	else
		379	LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
		380	&at->archname, f.get_str ());
		381
		382	f.next ();
		383	}
		384	#endif
		385
334	if (!op->parse_kv (f))	386	if (!at->parse_kv (f))
335	goto fail;	387	goto fail;
336		388
337	parts.push_back (std::make_pair (at, op));	389	at->post_load_check ();
		390
		391	parts.push_back (at);
338		392
339	if (f.kw != KW_more)	393	if (f.kw != KW_more)
340	break;	394	break;
341		395
342	f.next ();	396	f.next ();
		397
343	assert (f.kw == KW_object);	398	if (f.kw != KW_object)
		399	{
		400	f.parse_error ("more object");
		401	goto fail;
		402	}
344	}	403	}
		404
		405	loading_arch = false;
345		406
346	{	407	{
		408	auto (at, parts.begin ());
		409
347	archetype *head = parts.front ().first;	410	archetype *new_head = parts.front ();
		411	archetype *old_head = find (new_head->archname);
348		412
349	// check that all archetypes belong to the same object or are heads	413	if (old_head && !old_head->is_head ())
350	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
351	{	414	{
352	archetype *at = p->first;	415	LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
		416	&new_head->archname, &old_head->archname);
		417	goto fail;
		418	}
353		419
354	if (at->head != head && at->head)	420	// check that all archetypes belong to the same old object or are new
		421	for (auto (at, parts.begin ()); at != parts.end (); ++at)
		422	{
		423	archetype new_part = at;
		424	archetype *old_part = find (new_part->archname);
		425
		426	if (old_part && old_part->head_ () != old_head)
355	{	427	{
356	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);	428	LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
357	goto fail;	429	&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;	430	goto fail;
364	}	431	}
365	}	432	}
366		433
367	// sever chain of existing head object	434	// deactivate existing archetype
368	for (archetype more, at = head; at; at = more)	435	for (archetype at = old_head; at; at = (archetype )at->more)
		436	at->unlink ();
		437
		438	// assemble new chain
		439	new_head->min_x = new_head->max_x = new_head->x;
		440	new_head->min_y = new_head->max_y = new_head->y;
		441
		442	archetype *less = new_head;
		443	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
369	{	444	{
370	more = at->more;	445	archetype at = p;
371		446
		447	// some flags get inherited formt he head (probably a lot more)
		448	// doing it here doesn't feel too cozy, but it allows code
		449	// to ignore head checks for these flags, which saves time
		450	at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
		451	at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
		452	at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
		453	at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
		454
		455	if (at->x < new_head->min_x) new_head->min_x = at->x;
		456	if (at->y < new_head->min_y) new_head->min_y = at->y;
		457	if (at->x > new_head->max_x) new_head->max_x = at->x;
		458	if (at->y > new_head->max_y) new_head->max_y = at->y;
		459
372	at->head = 0;	460	at->head = new_head;
373	at->more = 0;	461	less->more = at;
		462	less = at;
374	}	463	}
375		464
376	// replace/update head	465	// now activate it
377	overwrite (head, parts.front ().second);	466	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->next)
383	{	467	{
384	head->next = first_archetype;	468	archetype at = p;
385	first_archetype = head;	469	at->stub = false;
		470	at->link ();
386	}	471	}
387		472
388	// reassemble new chain	473	return new_head;
389	archetype *prev = head;
390	for (AUTODECL (p, parts.begin () + 1); p != parts.end (); ++p)
391	{
392	archetype *at = p->first;
393	overwrite (at, p->second);
394
395	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
396	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
397
398	at->head = head;
399	at->clone.head = &head->clone;
400	prev->more = at;
401	prev->clone.more = &at->clone;
402
403	prev = at;
404	}
405	}	474	}
406		475
407	return true;
408
409	fail:	476	fail:
410	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)	477	for (auto (p, parts.begin ()); p != parts.end (); ++p)
411	p->second->destroy (true);	478	(*p)->destroy (true);
412		479
413	return false;
414	}
415
416	/*
417	* Reads/parses the archetype-file, and copies into a linked list
418	* of archetype-structures.
419	*/
420	static bool
421	load_archetypes (object_thawer &f)
422	{
423	for (;;)
424	{
425	switch (f.kw)
426	{
427	case KW_object:
428	loading_arch = true;
429	if (!archetype::load (f))
430	{
431	loading_arch = false;
432	return false;
433	}
434
435	loading_arch = false;	480	loading_arch = false;
436	continue;	481	return 0;
437
438	case KW_EOF:
439	return true;
440
441	default:
442	if (!f.parse_error ("archetypes file"))
443	return false;
444	}
445
446	f.next ();
447	}
448	}	482	}
449		483
450	/*	484	/*
451	* First initialises the archtype hash-table (init_archetable()).	485	* Initialize global archtype pointers:
452	* Reads and parses the archetype file (with the first and second-pass
453	* functions).
454	*/	486	*/
455	bool	487	void
456	load_archetype_file (const char *filename)	488	init_archetype_pointers ()
457	{	489	{
458	object_thawer f (filename);	490	ring_arch = archetype::find ("ring");
459		491	amulet_arch = archetype::find ("amulet");
460	f.next ();	492	staff_arch = archetype::find ("staff");
461		493	crown_arch = archetype::find ("crown");
462	// make sure the next - long - step is only done after a tick
463	coroapi::wait_for_tick_begin ();
464
465	if (!load_archetypes (f))
466	return false;
467
468	warn_archetypes = 1;
469
470	empty_archetype = archetype::find ("empty_archetype");	494	empty_archetype = archetype::find ("empty_archetype");
471	if (!empty_archetype)
472	return false;
473
474	coroapi::cede ();
475
476	return true;
477	}	495	}
478		496
479	/*	497	/*
480	* Creates and returns a new object which is a copy of the given archetype.	498	* Creates and returns a new object which is a copy of the given archetype.
481	* This function returns NULL on failure.	499	* This function returns NULL on failure.
…		…
483	object *	501	object *
484	arch_to_object (archetype *at)	502	arch_to_object (archetype *at)
485	{	503	{
486	if (!at)	504	if (!at)
487	{	505	{
488	if (warn_archetypes)
489	LOG (llevError, "Couldn't find archetype.\n");	506	LOG (llevError, "Couldn't find archetype.\n");
490
491	return NULL;	507	return 0;
492	}	508	}
493		509
494	object *op = at->clone.clone ();	510	object *op = at->clone ();
495	op->arch = at;	511	op->arch = at;
496	op->instantiate ();	512	op->instantiate ();
		513
497	return op;	514	return op;
498	}	515	}
499		516
500	/*	517	/*
501	* Creates an object. This function is called by get_archetype()	518	* Creates an object. This function is called by get_archetype()
…		…
504	* an object, and never NULL.	521	* an object, and never NULL.
505	*/	522	*/
506	object *	523	object *
507	create_singularity (const char *name)	524	create_singularity (const char *name)
508	{	525	{
509	object *op;	526	LOG (llevError \| logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
		527
		528	if (!strcmp (name, "bug"))
		529	abort ();
		530
510	char buf[MAX_BUF];	531	char buf[MAX_BUF];
		532	sprintf (buf, "bug, please report (%s)", name);
511		533
512	sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);	534	object *op = get_archetype ("bug");
513	op = object::create ();
514	op->name = op->name_pl = buf;	535	op->name = op->name_pl = buf;
515	SET_FLAG (op, FLAG_NO_PICK);	536
516	return op;	537	return op;
517	}	538	}
518		539
519	/*	540	/*
520	* Finds which archetype matches the given name, and returns a new	541	* Finds which archetype matches the given name, and returns a new
…		…
530		551
531	return arch_to_object (at);	552	return arch_to_object (at);
532	}	553	}
533		554
534	/*	555	/*
535	* Hash-function used by the arch-hashtable.
536	*/
537
538	unsigned long
539	hasharch (const char *str, int tablesize)
540	{
541	unsigned long hash = 0;
542	unsigned int i = 0;
543	const char *p;
544
545	/* use the one-at-a-time hash function, which supposedly is
546	* better than the djb2-like one used by perl5.005, but
547	* certainly is better then the bug used here before.
548	* see http://burtleburtle.net/bob/hash/doobs.html
549	*/
550	for (p = str; i < MAXSTRING && *p; p++, i++)
551	{
552	hash += *p;
553	hash += hash << 10;
554	hash ^= hash >> 6;
555	}
556
557	hash += hash << 3;
558	hash ^= hash >> 11;
559	hash += hash << 15;
560
561	return hash % tablesize;
562	}
563
564	/*
565	* Finds, using the hashtable, which archetype matches the given name.
566	* returns a pointer to the found archetype, otherwise NULL.
567	*/
568	archetype *
569	archetype::find (const char *name)
570	{
571	if (!name)
572	return 0;
573
574	AUTODECL (i, ht.find (name));
575
576	if (i == ht.end ())
577	return 0;
578	else
579	return i->second;
580	}
581
582	archetype *
583	archetype::get (const char *name)
584	{
585	archetype *at = find (name);
586
587	if (!at)
588	{
589	archetypes.push_back (at = new archetype);
590	at->name = name;
591	at->hash_add ();
592	}
593
594	return at;
595	}
596
597	/*
598	* Adds an archetype to the hashtable.
599	*/
600	void
601	archetype::hash_add ()
602	{
603	ht.insert (std::make_pair (name, this));
604	}
605
606	void
607	archetype::hash_del ()
608	{
609	ht.erase (name);
610	}
611
612	/*
613	* Returns the first archetype using the given type.	556	* Returns the first archetype using the given type.
614	* Used in treasure-generation.	557	* Used in treasure-generation.
615	*/	558	*/
616	archetype *	559	archetype *
617	type_to_archetype (int type)	560	type_to_archetype (int type)
618	{	561	{
619	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	562	for_all_archetypes (at)
620	if (at->clone.type == type)	563	if (at->type == type && at->head_ () != at)
621	return at;	564	return at;
622		565
623	return 0;	566	return 0;
624	}	567	}
625		568
…		…
637	{	580	{
638	LOG (llevError, "Can't clone archetype %d\n", type);	581	LOG (llevError, "Can't clone archetype %d\n", type);
639	return 0;	582	return 0;
640	}	583	}
641		584
642	object *op = at->clone.clone ();	585	object *op = at->clone ();
643	op->instantiate ();	586	op->instantiate ();
644	return op;	587	return op;
645	}	588	}
646		589
647	/*	590	/*
648	* member: make instance from class	591	* member: make instance from class
649	*/	592	*/
650
651	object *	593	object *
652	object_create_arch (archetype *at)	594	object_create_arch (archetype *at)
653	{	595	{
654	object op, prev = 0, *head = 0;	596	object op, prev = 0, *head = 0;
655		597
656	while (at)	598	while (at)
657	{	599	{
658	op = arch_to_object (at);	600	op = arch_to_object (at);
		601
659	op->x = at->clone.x;	602	op->x = at->x;
660	op->y = at->clone.y;	603	op->y = at->y;
661		604
662	if (head)	605	if (head)
663	op->head = head, prev->more = op;	606	op->head = head, prev->more = op;
664		607
665	if (!head)	608	if (!head)
666	head = op;	609	head = op;
667		610
668	prev = op;	611	prev = op;
669	at = at->more;	612	at = (archetype *)at->more;
670	}	613	}
671		614
672	return (head);	615	return head;
673	}	616	}
674		617

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.49 by root, Mon Apr 16 12:37:08 2007 UTC vs. Revision 1.68 by root, Sun Jul 1 05:00:17 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.49 by root, Mon Apr 16 12:37:08 2007 UTC vs.
Revision 1.68 by root, Sun Jul 1 05:00:17 2007 UTC