[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.49 by root, Mon Apr 16 12:37:08 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
349	archetype *	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
350	archetype::read (object_thawer &f)	322	archetype::load (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	typedef std::pair<archetype , object > part;
355	f.get (head->name);	327	std::vector<part> parts;
356		328
357	if (!head->clone.parse_kv (f))	329	for (;;)
358	{
359	delete head;
360	return 0;
361	}	330	{
		331	archetype *at = get (f.get_str ());
		332	object *op = object::create ();
362		333
363	for (archetype *prev = head; f.kw == KW_more; )	334	if (!op->parse_kv (f))
364	{	335	goto fail;
		336
		337	parts.push_back (std::make_pair (at, op));
		338
		339	if (f.kw != KW_more)
		340	break;
		341
365	f.next ();	342	f.next ();
366
367	assert (f.kw == KW_object);	343	assert (f.kw == KW_object);
		344	}
368		345
369	archetype *more = new archetype;	346	{
370	f.get (more->name);	347	archetype *head = parts.front ().first;
371		348
372	if (!more->clone.parse_kv (f))	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)
373	{	355	{
374	delete head;	356	LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
375	return 0;	357	goto fail;
376	}	358	}
377		359
378	if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;	360	if (at->next && at != head)
379	if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;	361	{
380		362	LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
381	more->head = head;	363	goto fail;
382	more->clone.head = &head->clone;	364	}
383	prev->more = more;
384	prev->clone.more = &more->clone;
385
386	prev = more;
387	}	365	}
388		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->next)
		383	{
389	head->next = first_archetype;	384	head->next = first_archetype;
390	first_archetype = head;	385	first_archetype = head;
		386	}
391		387
		388	// reassemble new chain
		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	}
		406
392	return head;	407	return true;
		408
		409	fail:
		410	for (AUTODECL (p, parts.begin ()); p != parts.end (); ++p)
		411	p->second->destroy (true);
		412
		413	return false;
393	}	414	}
394		415
395	/*	416	/*
396	* Reads/parses the archetype-file, and copies into a linked list	417	* Reads/parses the archetype-file, and copies into a linked list
397	* of archetype-structures.	418	* of archetype-structures.
398	*/	419	*/
399	static bool	420	static bool
400	first_arch_pass (object_thawer &f)	421	load_archetypes (object_thawer &f)
401	{	422	{
402	for (;;)	423	for (;;)
403	{	424	{
404	switch (f.kw)	425	switch (f.kw)
405	{	426	{
406	case KW_object:	427	case KW_object:
		428	loading_arch = true;
407	if (!archetype::read (f))	429	if (!archetype::load (f))
		430	{
		431	loading_arch = false;
408	return false;	432	return false;
		433	}
		434
		435	loading_arch = false;
409	continue;	436	continue;
410		437
411	case KW_EOF:	438	case KW_EOF:
412	return true;	439	return true;
413		440
…		…
419	f.next ();	446	f.next ();
420	}	447	}
421	}	448	}
422		449
423	/*	450	/*
424	* Reads the archetype file once more, and links all pointers between
425	* archetypes.
426	*/
427	void
428	second_arch_pass (object_thawer & thawer)
429	{
430	char buf[MAX_BUF], variable = buf, argument, *cp;
431	archetype at = NULL, other;
432
433	while (fgets (buf, MAX_BUF, thawer) != NULL)
434	{
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()).	451	* First initialises the archtype hash-table (init_archetable()).
481	* Reads and parses the archetype file (with the first and second-pass	452	* Reads and parses the archetype file (with the first and second-pass
482	* functions).	453	* functions).
483	* Then initialises treasures by calling load_treasures().
484	*/	454	*/
485	void	455	bool
486	load_archetypes (void)	456	load_archetype_file (const char *filename)
487	{	457	{
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);	458	object_thawer f (filename);
495		459
496	f.next ();	460	f.next ();
497		461
498	LOG (llevDebug, " arch-pass 1...\n");	462	// make sure the next - long - step is only done after a tick
499	if (!first_arch_pass (f))	463	coroapi::wait_for_tick_begin ();
500	cleanup ("errors during first arch pass are fatal");
501	LOG (llevDebug, " done\n");
502	}
503		464
504	init_archetable ();	465	if (!load_archetypes (f))
		466	return false;
		467
505	warn_archetypes = 1;	468	warn_archetypes = 1;
506		469
507	{	470	empty_archetype = archetype::find ("empty_archetype");
508	object_thawer f (filename);	471	if (!empty_archetype)
		472	return false;
509		473
510	LOG (llevDebug, " loading treasure...\n");	474	coroapi::cede ();
511	load_treasures ();	475
512	LOG (llevDebug, " done\n");	476	return true;
513	LOG (llevDebug, " arch-pass 2...\n");
514	second_arch_pass (f);
515	LOG (llevDebug, " done\n");
516	}
517	LOG (llevDebug, " done\n");
518	}	477	}
519		478
520	/*	479	/*
521	* Creates and returns a new object which is a copy of the given archetype.	480	* Creates and returns a new object which is a copy of the given archetype.
522	* This function returns NULL on failure.	481	* This function returns NULL on failure.
…		…
618	return 0;	577	return 0;
619	else	578	else
620	return i->second;	579	return i->second;
621	}	580	}
622		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
623	/*	597	/*
624	* Adds an archetype to the hashtable.	598	* Adds an archetype to the hashtable.
625	*/	599	*/
626	void	600	void
627	archetype::hash_add ()	601	archetype::hash_add ()
…		…
640	* Used in treasure-generation.	614	* Used in treasure-generation.
641	*/	615	*/
642	archetype *	616	archetype *
643	type_to_archetype (int type)	617	type_to_archetype (int type)
644	{	618	{
645	archetype *at;
646
647	for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)	619	for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
648	if (at->clone.type == type)	620	if (at->clone.type == type)
649	return at;	621	return at;
650		622
651	return 0;	623	return 0;
652	}	624	}
…		…
654	/*	626	/*
655	* Returns a new object copied from the first archetype matching	627	* Returns a new object copied from the first archetype matching
656	* the given type.	628	* the given type.
657	* Used in treasure-generation.	629	* Used in treasure-generation.
658	*/	630	*/
659
660	object *	631	object *
661	clone_arch (int type)	632	clone_arch (int type)
662	{	633	{
663	archetype *at;	634	archetype *at;
664		635

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.49 by root, Mon Apr 16 12:37:08 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.49 by root, Mon Apr 16 12:37:08 2007 UTC