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

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC vs.
Revision 1.54 by root, Tue Apr 17 18:59:05 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.
…		…
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	LOG (llevDebug, " Setting up archetable...\n");
306
307	for (archetype *at = first_archetype; at; at = at->next)
308	for (archetype *bt = at; bt; bt = bt->more)
309	bt->hash_add ();
310
311	LOG (llevDebug, "done\n");
312	}
313
314	void
315	free_all_archs (void)
316	{
317	archetype at, next;
318	int i = 0, f = 0;
319
320	for (at = first_archetype; at; at = next)
321	{
322	if (at->more)
323	next = at->more;
324	else
325	next = at->next;
326
327	delete
328	at;
329
330	i++;
331	}
332
333	LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
334	}
335
336	archetype::archetype ()	280	archetype::archetype ()
337	{	281	{
338	clone.arch = this;	282	clone.arch = this;
339		283
340	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 */
…		…
344	archetype::~archetype ()	288	archetype::~archetype ()
345	{	289	{
346	//TODO: nuke ->more's	290	//TODO: nuke ->more's
347	}	291	}
348		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
349	archetype *	321	archetype *
350	archetype::read (object_thawer &f)	322	archetype::read (object_thawer &f)
351	{	323	{
352	assert (f.kw == KW_object);	324	assert (f.kw == KW_object);
353		325
354	archetype *head = new archetype;	326	loading_arch = true; // hack to tell parse_kv et al. to behave
355	f.get (head->name);
356		327
357	if (!head->clone.parse_kv (f))	328	typedef std::pair<archetype , object > part;
358	{	329	std::vector<part> parts;
359	delete head;	330
360	return 0;	331	coroapi::cede_to_tick_every (100);
		332
		333	for (;;)
361	}	334	{
362		335	object *op = object::create ();
363	for (archetype *prev = head; f.kw == KW_more; )	336	archetype *at = get (f.get_str ());
364	{	337	f.get (op->name);
365	f.next ();	338	f.next ();
366		339
367	assert (f.kw == KW_object);
368
369	archetype *more = new archetype;
370	f.get (more->name);
371
372	if (!more->clone.parse_kv (f))	340	if (!op->parse_kv (f))
		341	goto fail;
		342
		343	parts.push_back (std::make_pair (at, op));
		344
		345	if (f.kw != KW_more)
		346	break;
		347
		348	f.next ();
		349
		350	if (f.kw != KW_object)
373	{	351	{
374	delete head;	352	f.parse_error ("more object");
375	return 0;	353	goto fail;
376	}	354	}
		355	}
377		356
378	if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;	357	{
379	if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;	358	archetype *head = parts.front ().first;
380		359
381	more->head = head;	360	// check that all archetypes belong to the same object or are heads
382	more->clone.head = &head->clone;	361	for (auto (p, parts.begin ()); p != parts.end (); ++p)
383	prev->more = more;	362	{
384	prev->clone.more = &more->clone;	363	archetype *at = p->first;
385		364
386	prev = more;	365	if (at->head != head && at->head)
		366	{
		367	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
		368	goto fail;
		369	}
		370
		371	if (at->next && at != head)
		372	{
		373	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
		374	goto fail;
		375	}
387	}	376	}
388		377
		378	// sever chain of existing head object
		379	for (archetype more, at = head; at; at = more)
		380	{
		381	more = at->more;
		382
		383	at->head = 0;
		384	at->more = 0;
		385	}
		386
		387	// replace/update head
		388	overwrite (head, parts.front ().second);
		389	head->tail_x = 0;
		390	head->tail_y = 0;
		391
		392	// link into list of heads, if not already there
		393	if (!head->linked)
		394	{
		395	head->linked = true;
389	head->next = first_archetype;	396	head->next = first_archetype;
390	first_archetype = head;	397	first_archetype = head;
		398	}
391		399
		400	// reassemble new chain
		401	archetype *prev = head;
		402	for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
		403	{
		404	archetype *at = p->first;
		405	overwrite (at, p->second);
		406
		407	if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
		408	if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
		409
		410	at->head = head;
		411	at->clone.head = &head->clone;
		412	prev->more = at;
		413	prev->clone.more = &at->clone;
		414
		415	prev = at;
		416	}
		417
		418	loading_arch = false;
392	return head;	419	return head;
393	}
394
395	/*
396	* Reads/parses the archetype-file, and copies into a linked list
397	* of archetype-structures.
398	*/
399	static bool
400	first_arch_pass (object_thawer &f)
401	{
402	for (;;)
403	{
404	switch (f.kw)
405	{
406	case KW_object:
407	if (!archetype::read (f))
408	return false;
409	continue;
410
411	case KW_EOF:
412	return true;
413
414	default:
415	if (!f.parse_error ("archetypes file"))
416	return false;
417	}
418
419	f.next ();
420	}	420	}
421	}
422		421
		422	fail:
		423	for (auto (p, parts.begin ()); p != parts.end (); ++p)
		424	p->second->destroy (true);
		425
		426	loading_arch = false;
		427	return 0;
		428	}
		429
423	/*	430	/*
424	* Reads the archetype file once more, and links all pointers between	431	* Initialize global archtype pointers:
425	* archetypes.
426	*/	432	*/
427	void	433	void
428	second_arch_pass (object_thawer & thawer)	434	init_archetype_pointers ()
429	{	435	{
430	char buf[MAX_BUF], variable = buf, argument, *cp;	436	ring_arch = archetype::find ("ring");
431	archetype at = NULL, other;	437	amulet_arch = archetype::find ("amulet");
432		438	staff_arch = archetype::find ("staff");
433	while (fgets (buf, MAX_BUF, thawer) != NULL)	439	crown_arch = archetype::find ("crown");
434	{	440	empty_archetype = archetype::find ("empty_archetype");
435	if (*buf == '#')
436	continue;
437
438	if ((argument = strchr (buf, ' ')) != NULL)
439	{
440	*argument = '\0', argument++;
441	cp = argument + strlen (argument) - 1;
442	while (isspace (*cp))
443	{
444	*cp = '\0';
445	cp--;
446	}
447	}
448
449	if (!strcmp ("object", variable))
450	{
451	if ((at = archetype::find (argument)) == NULL)
452	LOG (llevError, "Warning: failed to find arch %s\n", argument);
453	}
454	else if (!strcmp ("other_arch", variable))
455	{
456	if (at != NULL && at->clone.other_arch == NULL)
457	{
458	if ((other = archetype::find (argument)) == NULL)
459	LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
460	else if (at != NULL)
461	at->clone.other_arch = other;
462	}
463	}
464	else if (!strcmp ("randomitems", variable))
465	{
466	if (at)
467	{
468	treasurelist *tl = find_treasurelist (argument);
469
470	if (tl == NULL)
471	LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
472	else
473	at->clone.randomitems = tl;
474	}
475	}
476	}
477	}
478
479	/*
480	* First initialises the archtype hash-table (init_archetable()).
481	* Reads and parses the archetype file (with the first and second-pass
482	* functions).
483	* Then initialises treasures by calling load_treasures().
484	*/
485	void
486	load_archetypes (void)
487	{
488	char filename[MAX_BUF];
489
490	sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
491	LOG (llevDebug, "Reading archetypes from %s:\n", filename);
492
493	{
494	object_thawer f (filename);
495
496	f.next ();
497
498	LOG (llevDebug, " arch-pass 1...\n");
499	if (!first_arch_pass (f))
500	cleanup ("errors during first arch pass are fatal");
501	LOG (llevDebug, " done\n");
502	}
503
504	init_archetable ();
505	warn_archetypes = 1;
506
507	{
508	object_thawer f (filename);
509
510	LOG (llevDebug, " loading treasure...\n");
511	load_treasures ();
512	LOG (llevDebug, " done\n");
513	LOG (llevDebug, " arch-pass 2...\n");
514	second_arch_pass (f);
515	LOG (llevDebug, " done\n");
516	}
517	LOG (llevDebug, " done\n");
518	}	441	}
519		442
520	/*	443	/*
521	* Creates and returns a new object which is a copy of the given archetype.	444	* Creates and returns a new object which is a copy of the given archetype.
522	* This function returns NULL on failure.	445	* This function returns NULL on failure.
…		…
524	object *	447	object *
525	arch_to_object (archetype *at)	448	arch_to_object (archetype *at)
526	{	449	{
527	if (!at)	450	if (!at)
528	{	451	{
529	if (warn_archetypes)
530	LOG (llevError, "Couldn't find archetype.\n");	452	LOG (llevError, "Couldn't find archetype.\n");
531
532	return NULL;	453	return 0;
533	}	454	}
534		455
535	object *op = at->clone.clone ();	456	object *op = at->clone.clone ();
536	op->arch = at;	457	op->arch = at;
537	op->instantiate ();	458	op->instantiate ();
		459
538	return op;	460	return op;
539	}	461	}
540		462
541	/*	463	/*
542	* Creates an object. This function is called by get_archetype()	464	* Creates an object. This function is called by get_archetype()
…		…
571		493
572	return arch_to_object (at);	494	return arch_to_object (at);
573	}	495	}
574		496
575	/*	497	/*
576	* Hash-function used by the arch-hashtable.
577	*/
578
579	unsigned long
580	hasharch (const char *str, int tablesize)
581	{
582	unsigned long hash = 0;
583	unsigned int i = 0;
584	const char *p;
585
586	/* use the one-at-a-time hash function, which supposedly is
587	* better than the djb2-like one used by perl5.005, but
588	* certainly is better then the bug used here before.
589	* see http://burtleburtle.net/bob/hash/doobs.html
590	*/
591	for (p = str; i < MAXSTRING && *p; p++, i++)
592	{
593	hash += *p;
594	hash += hash << 10;
595	hash ^= hash >> 6;
596	}
597
598	hash += hash << 3;
599	hash ^= hash >> 11;
600	hash += hash << 15;
601
602	return hash % tablesize;
603	}
604
605	/*
606	* Finds, using the hashtable, which archetype matches the given name.	498	* Finds, using the hashtable, which archetype matches the given name.
607	* returns a pointer to the found archetype, otherwise NULL.	499	* returns a pointer to the found archetype, otherwise NULL.
608	*/	500	*/
609	archetype *	501	archetype *
610	archetype::find (const char *name)	502	archetype::find (const char *name)
611	{	503	{
612	if (!name)	504	if (!name)
613	return 0;	505	return 0;
614		506
615	AUTODECL (i, ht.find (name));	507	auto (i, ht.find (name));
616		508
617	if (i == ht.end ())	509	if (i == ht.end ())
618	return 0;	510	return 0;
619	else	511	else
620	return i->second;	512	return i->second;
621	}	513	}
622		514
		515	archetype *
		516	archetype::get (const char *name)
		517	{
		518	archetype *at = find (name);
		519
		520	if (!at)
		521	{
		522	archetypes.push_back (at = new archetype);
		523	at->name = name;
		524	at->hash_add ();
		525	}
		526
		527	return at;
		528	}
		529
623	/*	530	/*
624	* Adds an archetype to the hashtable.	531	* Adds an archetype to the hashtable.
625	*/	532	*/
626	void	533	void
627	archetype::hash_add ()	534	archetype::hash_add ()
…		…
640	* Used in treasure-generation.	547	* Used in treasure-generation.
641	*/	548	*/
642	archetype *	549	archetype *
643	type_to_archetype (int type)	550	type_to_archetype (int type)
644	{	551	{
645	archetype *at;
646
647	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	552	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
648	if (at->clone.type == type)	553	if (at->clone.type == type)
649	return at;	554	return at;
650		555
651	return 0;	556	return 0;
652	}	557	}
…		…
654	/*	559	/*
655	* Returns a new object copied from the first archetype matching	560	* Returns a new object copied from the first archetype matching
656	* the given type.	561	* the given type.
657	* Used in treasure-generation.	562	* Used in treasure-generation.
658	*/	563	*/
659
660	object *	564	object *
661	clone_arch (int type)	565	clone_arch (int type)
662	{	566	{
663	archetype *at;	567	archetype *at;
664		568

Diff Legend

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

Comparing deliantra/server/common/arch.C (file contents): Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC vs. Revision 1.54 by root, Tue Apr 17 18:59:05 2007 UTC

Diff Legend

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC vs.
Revision 1.54 by root, Tue Apr 17 18:59:05 2007 UTC