1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
3 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | 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, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | 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 |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <cassert> |
25 | #include <cassert> |
25 | |
26 | |
26 | #include <global.h> |
27 | #include <global.h> |
27 | #include <funcpoint.h> |
28 | #include <funcpoint.h> |
28 | #include <loader.h> |
29 | #include <loader.h> |
29 | |
30 | |
30 | #define USE_UNORDERED_MAP 0 |
|
|
31 | |
|
|
32 | #if USE_UNORDERED_MAP |
|
|
33 | # include <tr1/functional> |
31 | #include <tr1/functional> |
34 | # include <tr1/unordered_map> |
32 | #include <tr1/unordered_map> |
35 | #endif |
|
|
36 | |
33 | |
37 | int arch_cmp = 0; /* How many strcmp's */ |
|
|
38 | int arch_search = 0; /* How many searches */ |
|
|
39 | int arch_init; /* True if doing arch initialization */ |
34 | int arch_init; /* True if doing arch initialization */ |
40 | |
35 | |
41 | /* The naming of these functions is really poor - they are all |
36 | /* The naming of these functions is really poor - they are all |
42 | * pretty much named '.._arch_...', but they may more may not |
37 | * pretty much named '.._arch_...', but they may more may not |
43 | * return archetypes. Some make the arch_to_object call, and thus |
38 | * return archetypes. Some make the arch_to_object call, and thus |
44 | * return an object. Perhaps those should be called 'archob' functions |
39 | * return an object. Perhaps those should be called 'archob' functions |
45 | * to denote they return an object derived from the archetype. |
40 | * to denote they return an object derived from the archetype. |
46 | * MSW 2003-04-29 |
41 | * MSW 2003-04-29 |
47 | */ |
42 | */ |
48 | |
43 | |
49 | #if USE_UNORDERED_MAP |
|
|
50 | // the hashtable |
44 | // the hashtable |
51 | typedef std::tr1::unordered_map |
45 | typedef std::tr1::unordered_map |
52 | < |
46 | < |
53 | std::size_t, |
47 | const char *, |
54 | arch_ptr, |
48 | arch_ptr, |
55 | std::tr1::hash<size_t>, |
49 | str_hash, |
56 | std::equal_to<size_t>, |
50 | str_equal, |
57 | slice_allocator< std::pair<const std::size_t, archetype *> > |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
58 | true, |
|
|
59 | > HT; |
52 | > HT; |
60 | |
53 | |
61 | static HT ht; |
54 | static HT ht (5000); |
62 | #else |
|
|
63 | static arch_ptr arch_table[ARCHTABLE]; |
|
|
64 | #endif |
|
|
65 | |
55 | |
66 | /** |
56 | /** |
67 | * GROS - This function retrieves an archetype given the name that appears |
57 | * GROS - This function retrieves an archetype given the name that appears |
68 | * during the game (for example, "writing pen" instead of "stylus"). |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
69 | * 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. |
… | |
… | |
75 | * - the archetype found or null if nothing was found. |
65 | * - the archetype found or null if nothing was found. |
76 | */ |
66 | */ |
77 | archetype * |
67 | archetype * |
78 | find_archetype_by_object_name (const char *name) |
68 | find_archetype_by_object_name (const char *name) |
79 | { |
69 | { |
80 | archetype *at; |
70 | shstr_cmp name_cmp (name); |
81 | |
71 | |
82 | if (name == NULL) |
|
|
83 | return (archetype *) NULL; |
|
|
84 | |
|
|
85 | for (at = first_archetype; at != NULL; at = at->next) |
72 | for (archetype *at = first_archetype; at; at = at->next) |
86 | { |
73 | if (at->clone.name == name_cmp) |
87 | if (!strcmp (at->clone.name, name)) |
|
|
88 | return at; |
74 | return at; |
89 | } |
75 | |
90 | return NULL; |
76 | return 0; |
91 | } |
77 | } |
92 | |
78 | |
93 | /** |
79 | /** |
94 | * This function retrieves an archetype by type and name that appears during |
80 | * This function retrieves an archetype by type and name that appears during |
95 | * the game. It is basically the same as find_archetype_by_object_name() |
81 | * the game. It is basically the same as find_archetype_by_object_name() |
96 | * except that it considers only items of the given type. |
82 | * except that it considers only items of the given type. |
97 | */ |
83 | */ |
98 | archetype * |
84 | archetype * |
99 | find_archetype_by_object_type_name (int type, const char *name) |
85 | find_archetype_by_object_type_name (int type, const char *name) |
100 | { |
86 | { |
101 | archetype *at; |
87 | shstr_cmp name_cmp (name); |
102 | |
88 | |
103 | if (name == NULL) |
|
|
104 | return NULL; |
|
|
105 | |
|
|
106 | for (at = first_archetype; at != NULL; at = at->next) |
89 | for (archetype *at = first_archetype; at; at = at->next) |
107 | { |
90 | if (at->clone.name == name_cmp && at->clone.type == type) |
108 | if (at->clone.type == type && strcmp (at->clone.name, name) == 0) |
|
|
109 | return at; |
91 | return at; |
110 | } |
|
|
111 | |
92 | |
112 | return NULL; |
93 | return 0; |
113 | } |
94 | } |
114 | |
95 | |
115 | /* This is a lot like the above function. Instead, we are trying to match |
96 | /* This is a lot like the above function. Instead, we are trying to match |
116 | * the arch->skill values. type is the type of object to match |
97 | * the arch->skill values. type is the type of object to match |
117 | * against (eg, to only match against skills or only skill objects for example). |
98 | * against (eg, to only match against skills or only skill objects for example). |
118 | * If type is -1, ew don't match on type. |
99 | * If type is -1, ew don't match on type. |
119 | */ |
100 | */ |
120 | object * |
101 | object * |
121 | get_archetype_by_skill_name (const char *skill, int type) |
102 | get_archetype_by_skill_name (const char *skill, int type) |
122 | { |
103 | { |
123 | archetype *at; |
104 | shstr_cmp skill_cmp (skill); |
124 | |
105 | |
125 | if (skill) |
|
|
126 | for (at = first_archetype; at; at = at->next) |
106 | for (archetype *at = first_archetype; at; at = at->next) |
127 | if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) |
107 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
128 | return arch_to_object (at); |
108 | return arch_to_object (at); |
129 | |
109 | |
130 | return 0; |
110 | return 0; |
131 | } |
111 | } |
132 | |
112 | |
133 | /* similiar to above - this returns the first archetype |
113 | /* similiar to above - this returns the first archetype |
… | |
… | |
138 | * (eg, skills) |
118 | * (eg, skills) |
139 | */ |
119 | */ |
140 | archetype * |
120 | archetype * |
141 | get_archetype_by_type_subtype (int type, int subtype) |
121 | get_archetype_by_type_subtype (int type, int subtype) |
142 | { |
122 | { |
143 | archetype * |
|
|
144 | at; |
|
|
145 | |
|
|
146 | for (at = first_archetype; at != NULL; at = at->next) |
123 | for (archetype *at = first_archetype; at; at = at->next) |
147 | { |
|
|
148 | if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) |
124 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
149 | return at; |
125 | return at; |
150 | } |
126 | |
151 | return NULL; |
127 | return 0; |
152 | } |
128 | } |
153 | |
129 | |
154 | /** |
130 | /** |
155 | * GROS - this returns a new object given the name that appears during the game |
131 | * GROS - this returns a new object given the name that appears during the game |
156 | * (for example, "writing pen" instead of "stylus"). |
132 | * (for example, "writing pen" instead of "stylus"). |
… | |
… | |
164 | * but it otherwise had a big memory leak. |
140 | * but it otherwise had a big memory leak. |
165 | */ |
141 | */ |
166 | object * |
142 | object * |
167 | get_archetype_by_object_name (const char *name) |
143 | get_archetype_by_object_name (const char *name) |
168 | { |
144 | { |
169 | archetype *at; |
|
|
170 | char tmpname[MAX_BUF]; |
145 | char tmpname[MAX_BUF]; |
171 | int i; |
146 | int i; |
172 | |
147 | |
173 | assign (tmpname, name); |
148 | assign (tmpname, name); |
174 | |
149 | |
175 | for (i = strlen (tmpname); i > 0; i--) |
150 | for (i = strlen (tmpname); i > 0; i--) |
176 | { |
151 | { |
177 | tmpname[i] = 0; |
152 | tmpname[i] = 0; |
|
|
153 | |
178 | at = find_archetype_by_object_name (tmpname); |
154 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
179 | |
|
|
180 | if (at) |
|
|
181 | return arch_to_object (at); |
155 | return arch_to_object (at); |
182 | } |
156 | } |
183 | |
157 | |
184 | return create_singularity (name); |
158 | return create_singularity (name); |
185 | } |
159 | } |
… | |
… | |
321 | |
295 | |
322 | /* init_blocksview();*/ |
296 | /* init_blocksview();*/ |
323 | } |
297 | } |
324 | |
298 | |
325 | /* |
299 | /* |
326 | * Stores debug-information about how efficient the hashtable |
|
|
327 | * used for archetypes has been in the static errmsg array. |
|
|
328 | */ |
|
|
329 | |
|
|
330 | void |
|
|
331 | arch_info (object *op) |
|
|
332 | { |
|
|
333 | sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); |
|
|
334 | new_draw_info (NDI_BLACK, 0, op, errmsg); |
|
|
335 | } |
|
|
336 | |
|
|
337 | /* |
|
|
338 | * Initialise the hashtable used by the archetypes. |
|
|
339 | */ |
|
|
340 | |
|
|
341 | void |
|
|
342 | clear_archetable (void) |
|
|
343 | { |
|
|
344 | memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); |
|
|
345 | } |
|
|
346 | |
|
|
347 | /* |
|
|
348 | * An alternative way to init the hashtable which is slower, but _works_... |
300 | * An alternative way to init the hashtable which is slower, but _works_... |
349 | */ |
301 | */ |
350 | |
|
|
351 | void |
302 | void |
352 | init_archetable (void) |
303 | init_archetable (void) |
353 | { |
304 | { |
354 | archetype *at; |
305 | archetype *at; |
355 | |
306 | |
356 | LOG (llevDebug, " Setting up archetable...\n"); |
307 | LOG (llevDebug, " Setting up archetable...\n"); |
357 | |
308 | |
358 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
309 | for (at = first_archetype; at; at = at->more ? at->more : at->next) |
359 | at->hash_add (); |
310 | at->hash_add (); |
360 | |
311 | |
361 | LOG (llevDebug, "done\n"); |
312 | LOG (llevDebug, "done\n"); |
362 | } |
313 | } |
363 | |
314 | |
… | |
… | |
365 | free_all_archs (void) |
316 | free_all_archs (void) |
366 | { |
317 | { |
367 | archetype *at, *next; |
318 | archetype *at, *next; |
368 | int i = 0, f = 0; |
319 | int i = 0, f = 0; |
369 | |
320 | |
370 | for (at = first_archetype; at != NULL; at = next) |
321 | for (at = first_archetype; at; at = next) |
371 | { |
322 | { |
372 | if (at->more) |
323 | if (at->more) |
373 | next = at->more; |
324 | next = at->more; |
374 | else |
325 | else |
375 | next = at->next; |
326 | next = at->next; |
… | |
… | |
556 | |
507 | |
557 | { |
508 | { |
558 | object_thawer |
509 | object_thawer |
559 | thawer (filename); |
510 | thawer (filename); |
560 | |
511 | |
561 | clear_archetable (); |
|
|
562 | LOG (llevDebug, " arch-pass 1...\n"); |
512 | LOG (llevDebug, " arch-pass 1...\n"); |
563 | first_arch_pass (thawer); |
513 | first_arch_pass (thawer); |
564 | LOG (llevDebug, " done\n"); |
514 | LOG (llevDebug, " done\n"); |
565 | } |
515 | } |
566 | |
516 | |
… | |
… | |
673 | |
623 | |
674 | /* |
624 | /* |
675 | * Finds, using the hashtable, which archetype matches the given name. |
625 | * Finds, using the hashtable, which archetype matches the given name. |
676 | * returns a pointer to the found archetype, otherwise NULL. |
626 | * returns a pointer to the found archetype, otherwise NULL. |
677 | */ |
627 | */ |
678 | |
|
|
679 | archetype * |
628 | archetype * |
680 | archetype::find (const char *name) |
629 | archetype::find (const char *name) |
681 | { |
630 | { |
682 | if (!name) |
631 | if (!name) |
683 | return 0; |
632 | return 0; |
684 | |
633 | |
685 | #if USE_UNORDERED_MAP |
|
|
686 | AUTODECL (i, ht.find ((size_t) name)); |
634 | AUTODECL (i, ht.find (name)); |
687 | |
635 | |
688 | if (i == ht.end ()) |
636 | if (i == ht.end ()) |
689 | return 0; |
637 | return 0; |
690 | else |
638 | else |
691 | return i->second; |
639 | return i->second; |
692 | #endif |
|
|
693 | |
|
|
694 | archetype *at; |
|
|
695 | unsigned long index; |
|
|
696 | |
|
|
697 | index = hasharch (name, ARCHTABLE); |
|
|
698 | arch_search++; |
|
|
699 | for (;;) |
|
|
700 | { |
|
|
701 | at = arch_table[index]; |
|
|
702 | |
|
|
703 | if (at == NULL) |
|
|
704 | { |
|
|
705 | if (warn_archetypes) |
|
|
706 | LOG (llevError, "Couldn't find archetype %s\n", name); |
|
|
707 | |
|
|
708 | return NULL; |
|
|
709 | } |
|
|
710 | |
|
|
711 | arch_cmp++; |
|
|
712 | |
|
|
713 | if (!strcmp ((const char *) at->name, name)) |
|
|
714 | return at; |
|
|
715 | |
|
|
716 | if (++index >= ARCHTABLE) |
|
|
717 | index = 0; |
|
|
718 | } |
|
|
719 | } |
640 | } |
720 | |
641 | |
721 | /* |
642 | /* |
722 | * Adds an archetype to the hashtable. |
643 | * Adds an archetype to the hashtable. |
723 | */ |
644 | */ |
724 | void |
645 | void |
725 | archetype::hash_add () |
646 | archetype::hash_add () |
726 | { |
647 | { |
727 | #if USE_UNORDERED_MAP |
|
|
728 | ht.insert (std::make_pair ((size_t) (const char *) name, this)); |
648 | ht.insert (std::make_pair (name, this)); |
729 | #else |
|
|
730 | |
|
|
731 | int index = hasharch ((const char *) name, ARCHTABLE), org_index = index; |
|
|
732 | |
|
|
733 | for (;;) |
|
|
734 | { |
|
|
735 | if (!arch_table[index]) |
|
|
736 | { |
|
|
737 | arch_table[index] = this; |
|
|
738 | break; |
|
|
739 | } |
|
|
740 | |
|
|
741 | if (++index == ARCHTABLE) |
|
|
742 | index = 0; |
|
|
743 | |
|
|
744 | if (index == org_index) |
|
|
745 | fatal (ARCHTABLE_TOO_SMALL); |
|
|
746 | } |
|
|
747 | #endif |
|
|
748 | } |
649 | } |
749 | |
650 | |
750 | void |
651 | void |
751 | archetype::hash_del () |
652 | archetype::hash_del () |
752 | { |
653 | { |
753 | #if USE_UNORDERED_MAP |
654 | ht.erase (name); |
754 | # error remove this from HT |
|
|
755 | #else |
|
|
756 | |
|
|
757 | int index = hasharch ((const char *) name, ARCHTABLE), org_index = index; |
|
|
758 | |
|
|
759 | for (;;) |
|
|
760 | { |
|
|
761 | if (arch_table[index] == this) |
|
|
762 | { |
|
|
763 | arch_table[index] = 0; |
|
|
764 | break; |
|
|
765 | } |
|
|
766 | |
|
|
767 | if (++index == ARCHTABLE) |
|
|
768 | index = 0; |
|
|
769 | |
|
|
770 | if (index == org_index) |
|
|
771 | break; |
|
|
772 | } |
|
|
773 | #endif |
|
|
774 | } |
655 | } |
775 | |
656 | |
776 | /* |
657 | /* |
777 | * Returns the first archetype using the given type. |
658 | * Returns the first archetype using the given type. |
778 | * Used in treasure-generation. |
659 | * Used in treasure-generation. |
779 | */ |
660 | */ |
780 | |
|
|
781 | archetype * |
661 | archetype * |
782 | type_to_archetype (int type) |
662 | type_to_archetype (int type) |
783 | { |
663 | { |
784 | archetype *at; |
664 | archetype *at; |
785 | |
665 | |