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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.39 by root, Fri Feb 2 22:07:51 2007 UTC vs.
Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC

…		…
29	#include <loader.h>	29	#include <loader.h>
30		30
31	#include <tr1/functional>	31	#include <tr1/functional>
32	#include <tr1/unordered_map>	32	#include <tr1/unordered_map>
33		33
34	int arch_init; /* True if doing arch initialization */
35
36	/* The naming of these functions is really poor - they are all	34	/* The naming of these functions is really poor - they are all
37	* pretty much named '.._arch_...', but they may more may not	35	* pretty much named '.._arch_...', but they may more may not
38	* return archetypes. Some make the arch_to_object call, and thus	36	* return archetypes. Some make the arch_to_object call, and thus
39	* return an object. Perhaps those should be called 'archob' functions	37	* return an object. Perhaps those should be called 'archob' functions
40	* to denote they return an object derived from the archetype.	38	* to denote they return an object derived from the archetype.
41	* MSW 2003-04-29	39	* MSW 2003-04-29
42	*/	40	*/
		41
		42	bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
43		43
44	// the hashtable	44	// the hashtable
45	typedef std::tr1::unordered_map	45	typedef std::tr1::unordered_map
46	<	46	<
47	const char *,	47	const char *,
…		…
50	str_equal,	50	str_equal,
51	slice_allocator< std::pair<const char *const, arch_ptr> >	51	slice_allocator< std::pair<const char *const, arch_ptr> >
52	> HT;	52	> HT;
53		53
54	static HT ht (5000);	54	static HT ht (5000);
		55	static std::vector<archetype *> archetypes;
55		56
56	/**	57	/**
57	* GROS - This function retrieves an archetype given the name that appears	58	* GROS - This function retrieves an archetype given the name that appears
58	* during the game (for example, "writing pen" instead of "stylus").	59	* during the game (for example, "writing pen" instead of "stylus").
59	* It does not use the hashtable system, but browse the whole archlist each time.	60	* It does not use the hashtable system, but browse the whole archlist each time.
…		…
179	item_matched_string (object pl, object op, const char *name)	180	item_matched_string (object pl, object op, const char *name)
180	{	181	{
181	char *cp, local_name[MAX_BUF];	182	char *cp, local_name[MAX_BUF];
182	int count, retval = 0;	183	int count, retval = 0;
183		184
184	strcpy (local_name, name); /* strtok is destructive to name */	185	assign (local_name, name); /* strtok is destructive to name */
185		186
186	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))	187	for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
187	{	188	{
188	while (cp[0] == ' ')	189	while (cp[0] == ' ')
189	++cp; /* get rid of spaces */	190	++cp; /* get rid of spaces */
…		…
274	}	275	}
275		276
276	return 0;	277	return 0;
277	}	278	}
278		279
279	/*
280	* Initialises the internal linked list of archetypes (read from file).
281	* Then the global "empty_archetype" pointer is initialised.
282	* Then the blocksview[] array is initialised.
283	*/
284
285	void
286	init_archetypes (void)
287	{ /* called from add_player() and edit() */
288	if (first_archetype != NULL) /* Only do this once */
289	return;
290
291	arch_init = 1;
292	load_archetypes ();
293	arch_init = 0;
294	empty_archetype = archetype::find ("empty_archetype");
295
296	/* init_blocksview();*/
297	}
298
299	/*
300	* An alternative way to init the hashtable which is slower, but _works_...
301	*/
302	void
303	init_archetable (void)
304	{
305	archetype *at;
306
307	LOG (llevDebug, " Setting up archetable...\n");
308
309	for (at = first_archetype; at; at = at->more ? at->more : at->next)
310	at->hash_add ();
311
312	LOG (llevDebug, "done\n");
313	}
314
315	void
316	free_all_archs (void)
317	{
318	archetype at, next;
319	int i = 0, f = 0;
320
321	for (at = first_archetype; at; at = next)
322	{
323	if (at->more)
324	next = at->more;
325	else
326	next = at->next;
327
328	delete
329	at;
330
331	i++;
332	}
333
334	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
335	}
336
337	archetype::archetype ()	280	archetype::archetype ()
338	{	281	{
		282	clone.arch = this;
		283
339	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */	284	CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
340	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */	285	SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
341	}	286	}
342		287
343	archetype::~archetype ()	288	archetype::~archetype ()
344	{	289	{
		290	//TODO: nuke ->more's
		291	}
		292
		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
		311	overwrite (archetype at, object op)
		312	{
		313	at->clone = *op;
		314
		315	at->clone.arch = at;
		316	at->clone.inv = op->inv; op->inv = 0;
		317
		318	op->destroy ();
		319	}
		320
		321	bool
		322	archetype::load (object_thawer &f)
		323	{
		324	assert (f.kw == KW_object);
		325
		326	typedef std::pair<archetype , object > part;
		327	std::vector<part> parts;
		328
		329	for (;;)
		330	{
		331	archetype *at = get (f.get_str ());
		332	object *op = object::create ();
		333
		334	if (!op->parse_kv (f))
		335	goto fail;
		336
		337	parts.push_back (std::make_pair (at, op));
		338
		339	if (f.kw != KW_more)
		340	break;
		341
		342	f.next ();
		343	assert (f.kw == KW_object);
		344	}
		345
		346	{
		347	archetype *head = parts.front ().first;
		348
		349	// check that all archetypes belong to the same object or are heads
		350	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
		351	{
		352	archetype *at = p->first;
		353
		354	if (at->head != head && at->head)
		355	{
		356	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
		357	goto fail;
		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;
		364	}
		365	}
		366
		367	// sever chain of existing head object
		368	for (archetype more, at = head; at; at = more)
		369	{
		370	more = at->more;
		371
		372	at->head = 0;
		373	at->more = 0;
		374	}
		375
		376	// replace/update head
		377	overwrite (head, parts.front ().second);
		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	{
		384	head->linked = true;
		385	head->next = first_archetype;
		386	first_archetype = head;
		387	}
		388
		389	// reassemble new chain
		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	}
		407
		408	return true;
		409
		410	fail:
		411	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
		412	p->second->destroy (true);
		413
		414	return false;
345	}	415	}
346		416
347	/*	417	/*
348	* Reads/parses the archetype-file, and copies into a linked list	418	* Reads/parses the archetype-file, and copies into a linked list
349	* of archetype-structures.	419	* of archetype-structures.
350	*/	420	*/
351	void	421	static bool
352	first_arch_pass (object_thawer & fp)	422	load_archetypes (object_thawer &f)
353	{	423	{
354	archetype head = 0, last_more = 0;	424	for (;;)
355
356	archetype *at = new archetype;
357	at->clone.arch = first_archetype = at;
358
359	while (int i = load_object (fp, &at->clone, 0))
360	{	425	{
361	at->clone.speed_left = (float) (-0.1);
362	/* copy the body_info to the body_used - this is only really
363	* need for monsters, but doesn't hurt to do it for everything.
364	* by doing so, when a monster is created, it has good starting
365	* values for the body_used info, so when items are created
366	* for it, they can be properly equipped.
367	*/
368	memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
369
370	switch (i)	426	switch (f.kw)
371	{	427	{
372	case LL_NORMAL: /* A new archetype, just link it with the previous */	428	case KW_object:
373	if (last_more != NULL)	429	loading_arch = true;
374	last_more->next = at;	430	if (!archetype::load (f))
375	if (head != NULL)
376	head->next = at;
377	head = last_more = at;
378	#if 0
379	if (!op->type)
380	LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
381	#endif
382	at->tail_x = 0;
383	at->tail_y = 0;
384	break;
385
386	case LL_MORE: /* Another part of the previous archetype, link it correctly */
387
388	at->head = head;
389	at->clone.head = &head->clone;
390	if (last_more != NULL)
391	{	431	{
392	last_more->more = at;	432	loading_arch = false;
393	last_more->clone.more = &at->clone;	433	return false;
394	}	434	}
395	last_more = at;
396		435
397	/* If this multipart image is still composed of individual small	436	loading_arch = false;
398	* images, don't set the tail_.. values. We can't use them anyways,	437	continue;
399	* and setting these to zero makes the map sending to the client much	438
400	* easier as just looking at the head, we know what to do.	439	case KW_EOF:
401	*/	440	return true;
402	if (at->clone.face != head->clone.face)	441
403	{	442	default:
404	head->tail_x = 0;	443	if (!f.parse_error ("archetypes file"))
405	head->tail_y = 0;
406	}
407	else	444	return false;
408	{
409	if (at->clone.x > head->tail_x)
410	head->tail_x = at->clone.x;
411	if (at->clone.y > head->tail_y)
412	head->tail_y = at->clone.y;
413	}
414	break;
415
416	}	445	}
417		446
418	at = new archetype;	447	f.next ();
419
420	at->clone.arch = at;
421	}
422
423	delete at;
424	}
425
426	/*
427	* Reads the archetype file once more, and links all pointers between
428	* archetypes.
429	*/
430
431	void
432	second_arch_pass (object_thawer & thawer)
433	{
434	char buf[MAX_BUF], variable = buf, argument, *cp;
435	archetype at = NULL, other;
436
437	while (fgets (buf, MAX_BUF, thawer) != NULL)
438	{	448	}
439	if (*buf == '#')
440	continue;
441	if ((argument = strchr (buf, ' ')) != NULL)
442	{
443	*argument = '\0', argument++;
444	cp = argument + strlen (argument) - 1;
445	while (isspace (*cp))
446	{
447	*cp = '\0';
448	cp--;
449	}
450	}
451	if (!strcmp ("Object", variable))
452	{
453	if ((at = archetype::find (argument)) == NULL)
454	LOG (llevError, "Warning: failed to find arch %s\n", argument);
455	}
456	else if (!strcmp ("other_arch", variable))
457	{
458	if (at != NULL && at->clone.other_arch == NULL)
459	{
460	if ((other = archetype::find (argument)) == NULL)
461	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
462	else if (at != NULL)
463	at->clone.other_arch = other;
464	}
465	}
466	else if (!strcmp ("randomitems", variable))
467	{
468	if (at != NULL)
469	{
470	treasurelist *tl = find_treasurelist (argument);
471
472	if (tl == NULL)
473	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
474	else
475	at->clone.randomitems = tl;
476	}
477	}
478	}
479	}	449	}
480
481	#ifdef DEBUG
482	void
483	check_generators (void)
484	{
485	archetype *at;
486
487	for (at = first_archetype; at != NULL; at = at->next)
488	if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
489	LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
490	}
491	#endif
492		450
493	/*	451	/*
494	* First initialises the archtype hash-table (init_archetable()).	452	* First initialises the archtype hash-table (init_archetable()).
495	* Reads and parses the archetype file (with the first and second-pass	453	* Reads and parses the archetype file (with the first and second-pass
496	* functions).	454	* functions).
497	* Then initialises treasures by calling load_treasures().
498	*/	455	*/
499		456	bool
500	void	457	load_archetype_file (const char *filename)
501	load_archetypes (void)
502	{	458	{
503	char filename[MAX_BUF];
504
505	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
506	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
507
508	{
509	object_thawer
510	thawer (filename);	459	object_thawer f (filename);
511		460
512	LOG (llevDebug, " arch-pass 1...\n");	461	f.next ();
513	first_arch_pass (thawer);
514	LOG (llevDebug, " done\n");
515	}
516		462
517	init_archetable ();	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
518	warn_archetypes = 1;	469	warn_archetypes = 1;
519		470
520	{	471	empty_archetype = archetype::find ("empty_archetype");
521	object_thawer	472	if (!empty_archetype)
522	thawer (filename);	473	return false;
523		474
524	LOG (llevDebug, " loading treasure...\n");	475	coroapi::cede ();
525	load_treasures ();	476
526	LOG (llevDebug, " done\n");	477	return true;
527	LOG (llevDebug, " arch-pass 2...\n");
528	second_arch_pass (thawer);
529	LOG (llevDebug, " done\n");
530	#ifdef DEBUG
531	check_generators ();
532	#endif
533	}
534	LOG (llevDebug, " done\n");
535	}	478	}
536		479
537	/*	480	/*
538	* Creates and returns a new object which is a copy of the given archetype.	481	* Creates and returns a new object which is a copy of the given archetype.
539	* This function returns NULL on failure.	482	* This function returns NULL on failure.
540	*/	483	*/
541	object *	484	object *
542	arch_to_object (archetype *at)	485	arch_to_object (archetype *at)
543	{	486	{
544	object *op;	487	if (!at)
545
546	if (at == NULL)
547	{	488	{
548	if (warn_archetypes)	489	if (warn_archetypes)
549	LOG (llevError, "Couldn't find archetype.\n");	490	LOG (llevError, "Couldn't find archetype.\n");
550		491
551	return NULL;	492	return NULL;
552	}	493	}
553		494
554	op = at->clone.clone ();	495	object *op = at->clone.clone ();
555	op->arch = at;	496	op->arch = at;
556	op->instantiate ();	497	op->instantiate ();
557	return op;	498	return op;
558	}	499	}
559		500
…		…
590		531
591	return arch_to_object (at);	532	return arch_to_object (at);
592	}	533	}
593		534
594	/*	535	/*
595	* Hash-function used by the arch-hashtable.
596	*/
597
598	unsigned long
599	hasharch (const char *str, int tablesize)
600	{
601	unsigned long hash = 0;
602	unsigned int i = 0;
603	const char *p;
604
605	/* use the one-at-a-time hash function, which supposedly is
606	* better than the djb2-like one used by perl5.005, but
607	* certainly is better then the bug used here before.
608	* see http://burtleburtle.net/bob/hash/doobs.html
609	*/
610	for (p = str; i < MAXSTRING && *p; p++, i++)
611	{
612	hash += *p;
613	hash += hash << 10;
614	hash ^= hash >> 6;
615	}
616
617	hash += hash << 3;
618	hash ^= hash >> 11;
619	hash += hash << 15;
620
621	return hash % tablesize;
622	}
623
624	/*
625	* Finds, using the hashtable, which archetype matches the given name.	536	* Finds, using the hashtable, which archetype matches the given name.
626	* returns a pointer to the found archetype, otherwise NULL.	537	* returns a pointer to the found archetype, otherwise NULL.
627	*/	538	*/
628	archetype *	539	archetype *
629	archetype::find (const char *name)	540	archetype::find (const char *name)
…		…
637	return 0;	548	return 0;
638	else	549	else
639	return i->second;	550	return i->second;
640	}	551	}
641		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
642	/*	568	/*
643	* Adds an archetype to the hashtable.	569	* Adds an archetype to the hashtable.
644	*/	570	*/
645	void	571	void
646	archetype::hash_add ()	572	archetype::hash_add ()
…		…
659	* Used in treasure-generation.	585	* Used in treasure-generation.
660	*/	586	*/
661	archetype *	587	archetype *
662	type_to_archetype (int type)	588	type_to_archetype (int type)
663	{	589	{
664	archetype *at;
665
666	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	590	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
667	if (at->clone.type == type)	591	if (at->clone.type == type)
668	return at;	592	return at;
669		593
670	return 0;	594	return 0;
671	}	595	}
…		…
673	/*	597	/*
674	* Returns a new object copied from the first archetype matching	598	* Returns a new object copied from the first archetype matching
675	* the given type.	599	* the given type.
676	* Used in treasure-generation.	600	* Used in treasure-generation.
677	*/	601	*/
678
679	object *	602	object *
680	clone_arch (int type)	603	clone_arch (int type)
681	{	604	{
682	archetype *at;	605	archetype *at;
683		606

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.39 by root, Fri Feb 2 22:07:51 2007 UTC vs. Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.39 by root, Fri Feb 2 22:07:51 2007 UTC vs.
Revision 1.50 by root, Mon Apr 16 13:02:28 2007 UTC