1 | /* |
1 | /* |
2 | * static char *rcsid_arch_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * "$Id: arch.C,v 1.1 2006/08/13 17:16:00 elmex Exp $"; |
3 | * |
4 | */ |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
|
|
8 | |
|
|
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
10 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
11 | |
7 | * |
12 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
13 | it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
14 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
15 | (at your option) any later version. |
11 | * option) any later version. |
16 | |
12 | * |
17 | 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, |
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
20 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
21 | |
17 | * |
22 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
23 | along with this program; if not, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
25 | |
21 | * |
26 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
27 | */ |
23 | */ |
|
|
24 | |
|
|
25 | #include <cassert> |
28 | |
26 | |
29 | #include <global.h> |
27 | #include <global.h> |
30 | #include <arch.h> |
|
|
31 | #include <funcpoint.h> |
|
|
32 | #include <loader.h> |
28 | #include <loader.h> |
33 | |
29 | |
34 | /* IF set, does a little timing on the archetype load. */ |
30 | #include <tr1/functional> |
35 | #define TIME_ARCH_LOAD 0 |
31 | #include <tr1/unordered_map> |
36 | |
32 | |
37 | static void add_arch(archetype *at); |
33 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
|
|
34 | arch_ptr archetype::empty; |
38 | |
35 | |
39 | static archetype *arch_table[ARCHTABLE]; |
36 | // the hashtable |
40 | int arch_cmp=0; /* How many strcmp's */ |
37 | typedef std::tr1::unordered_map |
41 | int arch_search=0; /* How many searches */ |
38 | < |
42 | int arch_init; /* True if doing arch initialization */ |
39 | const char *, |
|
|
40 | arch_ptr, |
|
|
41 | str_hash, |
|
|
42 | str_equal, |
|
|
43 | slice_allocator< std::pair<const char *const, arch_ptr> > |
|
|
44 | > HT; |
43 | |
45 | |
44 | /* The naming of these functions is really poor - they are all |
46 | static HT ht (10000); |
45 | * pretty much named '.._arch_...', but they may more may not |
47 | archvec archetypes; |
46 | * return archetypes. Some make the arch_to_object call, and thus |
48 | static unordered_vector<archetype *> allarch; |
47 | * return an object. Perhaps those should be called 'archob' functions |
49 | static int dirtycnt; |
48 | * to denote they return an object derived from the archetype. |
50 | |
49 | * MSW 2003-04-29 |
51 | // the vector of other_arch references to be resolved |
50 | */ |
52 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
|
|
53 | // the vector of loaded but not yet committed archetypes |
|
|
54 | static std::vector<archetype *> postponed_arch; |
|
|
55 | |
|
|
56 | //+GPL |
51 | |
57 | |
52 | /** |
58 | /** |
53 | * GROS - This function retrieves an archetype given the name that appears |
59 | * GROS - This function retrieves an archetype given the name that appears |
54 | * during the game (for example, "writing pen" instead of "stylus"). |
60 | * during the game (for example, "writing pen" instead of "stylus"). |
55 | * It does not use the hashtable system, but browse the whole archlist each time. |
61 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
58 | * Params: |
64 | * Params: |
59 | * - name: the name we're searching for (ex: "writing pen"); |
65 | * - name: the name we're searching for (ex: "writing pen"); |
60 | * Return value: |
66 | * Return value: |
61 | * - the archetype found or null if nothing was found. |
67 | * - the archetype found or null if nothing was found. |
62 | */ |
68 | */ |
|
|
69 | archetype * |
63 | archetype *find_archetype_by_object_name(const char *name) { |
70 | find_archetype_by_object_name (const char *name) |
64 | archetype *at; |
71 | { |
|
|
72 | shstr_cmp name_cmp (name); |
65 | |
73 | |
66 | if (name == NULL) |
74 | for_all_archetypes (at) |
67 | return (archetype *) NULL; |
75 | if (at->name == name_cmp) |
68 | |
|
|
69 | for(at = first_archetype;at!=NULL;at=at->next) { |
|
|
70 | if (!strcmp(at->clone.name, name)) |
|
|
71 | return at; |
|
|
72 | } |
|
|
73 | return NULL; |
76 | return at; |
|
|
77 | |
|
|
78 | return 0; |
74 | } |
79 | } |
75 | |
80 | |
76 | /** |
81 | /** |
77 | * This function retrieves an archetype by type and name that appears during |
82 | * This function retrieves an archetype by type and name that appears during |
78 | * the game. It is basically the same as find_archetype_by_object_name() |
83 | * the game. It is basically the same as find_archetype_by_object_name() |
79 | * except that it considers only items of the given type. |
84 | * except that it considers only items of the given type. |
80 | */ |
85 | */ |
|
|
86 | archetype * |
81 | archetype *find_archetype_by_object_type_name(int type, const char *name) { |
87 | find_archetype_by_object_type_name (int type, const char *name) |
82 | archetype *at; |
88 | { |
|
|
89 | shstr_cmp name_cmp (name); |
83 | |
90 | |
84 | if (name == NULL) |
91 | for_all_archetypes (at) |
85 | return NULL; |
92 | if (at->name == name_cmp && at->type == type) |
86 | |
|
|
87 | for (at = first_archetype; at != NULL; at = at->next) { |
|
|
88 | if (at->clone.type == type && strcmp(at->clone.name, name) == 0) |
|
|
89 | return at; |
93 | return at; |
90 | } |
|
|
91 | |
94 | |
92 | return NULL; |
95 | return 0; |
93 | } |
96 | } |
94 | |
97 | |
95 | /* This is a lot like the above function. Instead, we are trying to match |
98 | /* This is a lot like the above function. Instead, we are trying to match |
96 | * the arch->skill values. type is the type of object to match |
99 | * the arch->skill values. type is the type of object to match |
97 | * against (eg, to only match against skills or only skill objects for example). |
100 | * against (eg, to only match against skills or only skill objects for example). |
98 | * If type is -1, ew don't match on type. |
101 | * If type is -1, ew don't match on type. |
99 | */ |
102 | */ |
|
|
103 | object * |
100 | object *get_archetype_by_skill_name(const char *skill, int type) { |
104 | get_archetype_by_skill_name (const char *skill, int type) |
101 | archetype *at; |
105 | { |
|
|
106 | shstr_cmp skill_cmp (skill); |
102 | |
107 | |
103 | if (skill == NULL) |
108 | for_all_archetypes (at) |
104 | return NULL; |
109 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
|
|
110 | return at->instance (); |
105 | |
111 | |
106 | for(at = first_archetype;at!=NULL;at=at->next) { |
112 | return 0; |
107 | if ( ((type == -1) || (type == at->clone.type)) && |
|
|
108 | (!strcmp(at->clone.skill, skill))) |
|
|
109 | return arch_to_object(at); |
|
|
110 | } |
|
|
111 | return NULL; |
|
|
112 | } |
113 | } |
113 | |
114 | |
114 | /* similiar to above - this returns the first archetype |
115 | /* similiar to above - this returns the first archetype |
115 | * that matches both the type and subtype. type and subtype |
116 | * that matches both the type and subtype. type and subtype |
116 | * can be -1 to say ignore, but in this case, the match it does |
117 | * can be -1 to say ignore, but in this case, the match it does |
117 | * may not be very useful. This function is most useful when |
118 | * may not be very useful. This function is most useful when |
118 | * subtypes are known to be unique for a particular type |
119 | * subtypes are known to be unique for a particular type |
119 | * (eg, skills) |
120 | * (eg, skills) |
120 | */ |
121 | */ |
|
|
122 | archetype * |
121 | archetype *get_archetype_by_type_subtype(int type, int subtype) { |
123 | get_archetype_by_type_subtype (int type, int subtype) |
122 | archetype *at; |
124 | { |
123 | |
125 | for_all_archetypes (at) |
124 | for(at = first_archetype;at!=NULL;at=at->next) { |
126 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
125 | if ( ((type == -1) || (type == at->clone.type)) && |
|
|
126 | (subtype == -1 || subtype == at->clone.subtype)) |
|
|
127 | return at; |
|
|
128 | } |
|
|
129 | return NULL; |
127 | return at; |
|
|
128 | |
|
|
129 | return 0; |
130 | } |
130 | } |
131 | |
131 | |
132 | /** |
132 | /** |
133 | * GROS - this returns a new object given the name that appears during the game |
133 | * GROS - this returns a new object given the name that appears during the game |
134 | * (for example, "writing pen" instead of "stylus"). |
134 | * (for example, "writing pen" instead of "stylus"). |
… | |
… | |
136 | * - name: The name we're searching for (ex: "writing pen"); |
136 | * - name: The name we're searching for (ex: "writing pen"); |
137 | * Return value: |
137 | * Return value: |
138 | * - a corresponding object if found; a singularity object if not found. |
138 | * - a corresponding object if found; a singularity object if not found. |
139 | * Note by MSW - it appears that it takes the full name and keeps |
139 | * Note by MSW - it appears that it takes the full name and keeps |
140 | * shortening it until it finds a match. I re-wrote this so that it |
140 | * shortening it until it finds a match. I re-wrote this so that it |
141 | * doesn't malloc it each time - not that this function is used much, |
141 | * doesn't allocate it each time - not that this function is used much, |
142 | * but it otherwise had a big memory leak. |
142 | * but it otherwise had a big memory leak. |
143 | */ |
143 | */ |
|
|
144 | object * |
144 | object *get_archetype_by_object_name(const char *name) { |
145 | get_archetype_by_object_name (const char *name) |
145 | archetype *at; |
146 | { |
146 | char tmpname[MAX_BUF]; |
147 | char tmpname[MAX_BUF]; |
147 | int i; |
|
|
148 | |
148 | |
149 | strncpy(tmpname,name,MAX_BUF-1); |
149 | assign (tmpname, name); |
150 | tmpname[MAX_BUF-1] = 0; |
150 | |
151 | for(i=strlen(tmpname); i>0; i--) { |
151 | for (int i = strlen (tmpname); i > 0; i--) |
|
|
152 | { |
152 | tmpname[i] = 0; |
153 | tmpname[i] = 0; |
|
|
154 | |
153 | at = find_archetype_by_object_name(tmpname); |
155 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
154 | if (at !=NULL) |
156 | return at->instance (); |
|
|
157 | } |
|
|
158 | |
|
|
159 | return create_singularity (name); |
|
|
160 | } |
|
|
161 | |
|
|
162 | /* 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. |
|
|
164 | * pl is the player (only needed to set count properly) |
|
|
165 | * 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 |
|
|
167 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
|
|
168 | * value means a better match. 0 means no match. |
|
|
169 | * |
|
|
170 | * Brief outline of the procedure: |
|
|
171 | * We take apart the name variable into the individual components. |
|
|
172 | * cases for 'all' and unpaid are pretty obvious. |
|
|
173 | * Next, we check for a count (either specified in name, or in the |
|
|
174 | * player object.) |
|
|
175 | * 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. |
|
|
177 | * Last, make a check on the full name. |
|
|
178 | */ |
|
|
179 | int |
|
|
180 | item_matched_string (object *pl, object *op, const char *name) |
|
|
181 | { |
|
|
182 | char *cp, local_name[MAX_BUF]; |
|
|
183 | int count, retval = 0; |
|
|
184 | |
|
|
185 | assign (local_name, name); /* strtok is destructive to name */ |
|
|
186 | |
|
|
187 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
|
|
188 | { |
|
|
189 | while (cp[0] == ' ') |
|
|
190 | ++cp; /* get rid of spaces */ |
|
|
191 | |
|
|
192 | /* LOG(llevDebug,"Trying to match %s\n", cp); */ |
|
|
193 | /* All is a very generic match - low match value */ |
|
|
194 | if (!strcmp (cp, "all")) |
|
|
195 | return 1; |
|
|
196 | |
|
|
197 | /* unpaid is a little more specific */ |
|
|
198 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
|
|
199 | return 2; |
|
|
200 | |
|
|
201 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
|
|
202 | return 2; |
|
|
203 | |
|
|
204 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
|
|
205 | return 2; |
|
|
206 | |
|
|
207 | /* Allow for things like '100 arrows' */ |
|
|
208 | if ((count = atoi (cp)) != 0) |
155 | { |
209 | { |
156 | return arch_to_object(at); |
210 | cp = strchr (cp, ' '); |
|
|
211 | while (cp && cp[0] == ' ') |
|
|
212 | ++cp; /* get rid of spaces */ |
157 | } |
213 | } |
158 | } |
214 | else |
159 | return create_singularity(name); |
|
|
160 | } |
|
|
161 | |
|
|
162 | /* GROS - find_best_weapon_used_match and item_matched_string moved there */ |
|
|
163 | object *find_best_weapon_used_match(object *pl, const char *params) |
|
|
164 | { |
|
|
165 | object *tmp, *best=NULL; |
|
|
166 | int match_val=0,tmpmatch; |
|
|
167 | |
|
|
168 | for (tmp=pl->inv; tmp; tmp=tmp->below) { |
|
|
169 | if (tmp->invisible) continue; |
|
|
170 | if ((tmpmatch=item_matched_string(pl, tmp, params))>match_val) |
|
|
171 | { |
|
|
172 | if ((QUERY_FLAG(tmp, FLAG_APPLIED))&&(tmp->type==WEAPON)) |
|
|
173 | { |
215 | { |
174 | match_val=tmpmatch; |
216 | if (pl->type == PLAYER) |
175 | best=tmp; |
217 | count = pl->contr->count; |
|
|
218 | else |
|
|
219 | count = 0; |
176 | }; |
220 | } |
177 | } |
|
|
178 | } |
|
|
179 | return best; |
|
|
180 | } |
|
|
181 | |
221 | |
182 | /* This is a subset of the parse_id command. Basically, name can be |
222 | if (!cp || cp[0] == '\0' || count < 0) |
183 | * a string seperated lists of things to match, with certain keywords. |
|
|
184 | * pl is the player (only needed to set count properly) |
|
|
185 | * op is the item we are trying to match. Calling function takes care |
|
|
186 | * of what action might need to be done and if it is valid |
|
|
187 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
|
|
188 | * value means a better match. 0 means no match. |
|
|
189 | * |
|
|
190 | * Brief outline of the procedure: |
|
|
191 | * We take apart the name variable into the individual components. |
|
|
192 | * cases for 'all' and unpaid are pretty obvious. |
|
|
193 | * Next, we check for a count (either specified in name, or in the |
|
|
194 | * player object.) |
|
|
195 | * If count is 1, make a quick check on the name. |
|
|
196 | * IF count is >1, we need to make plural name. Return if match. |
|
|
197 | * Last, make a check on the full name. |
|
|
198 | */ |
|
|
199 | int item_matched_string(object *pl, object *op, const char *name) |
|
|
200 | { |
|
|
201 | char *cp, local_name[MAX_BUF]; |
|
|
202 | int count,retval=0; |
|
|
203 | strcpy(local_name, name); /* strtok is destructive to name */ |
|
|
204 | |
|
|
205 | for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { |
|
|
206 | while (cp[0]==' ') ++cp; /* get rid of spaces */ |
|
|
207 | |
|
|
208 | /* LOG(llevDebug,"Trying to match %s\n", cp);*/ |
|
|
209 | /* All is a very generic match - low match value */ |
|
|
210 | if (!strcmp(cp,"all")) return 1; |
|
|
211 | |
|
|
212 | /* unpaid is a little more specific */ |
|
|
213 | if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; |
|
|
214 | if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) && |
|
|
215 | (QUERY_FLAG(op,FLAG_CURSED) ||QUERY_FLAG(op,FLAG_DAMNED))) |
|
|
216 | return 2; |
223 | return 0; |
217 | |
224 | |
218 | if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) |
|
|
219 | return 2; |
|
|
220 | |
225 | |
221 | /* Allow for things like '100 arrows' */ |
|
|
222 | if ((count=atoi(cp))!=0) { |
|
|
223 | cp=strchr(cp, ' '); |
|
|
224 | while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ |
|
|
225 | } |
|
|
226 | else { |
|
|
227 | if (pl->type==PLAYER) |
|
|
228 | count=pl->contr->count; |
|
|
229 | else |
|
|
230 | count = 0; |
|
|
231 | } |
|
|
232 | |
|
|
233 | if (!cp || cp[0]=='\0' || count<0) return 0; |
|
|
234 | |
|
|
235 | |
|
|
236 | /* The code here should go from highest retval to lowest. That |
226 | /* The code here should go from highest retval to lowest. That |
237 | * is because of the 'else' handling - we don't want to match on |
227 | * is because of the 'else' handling - we don't want to match on |
238 | * something and set a low retval, even though it may match a higher retcal |
228 | * something and set a low retval, even though it may match a higher retcal |
239 | * later. So keep it in descending order here, so we try for the best |
229 | * later. So keep it in descending order here, so we try for the best |
240 | * match first, and work downward. |
230 | * match first, and work downward. |
241 | */ |
231 | */ |
|
|
232 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
233 | |
242 | if (!strcasecmp(cp,query_name(op))) retval=20; |
234 | if (!strcasecmp (cp, query_name (op))) |
|
|
235 | retval = 20; |
243 | else if (!strcasecmp(cp,query_short_name(op))) retval=18; |
236 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
|
|
237 | retval = 18; |
244 | else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; |
238 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
|
|
239 | retval = 16; |
245 | else if (!strcasecmp(cp,query_base_name(op,1))) retval=16; |
240 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
|
|
241 | retval = 16; |
246 | else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15; |
242 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
247 | else if (!strncasecmp(cp,query_base_name(op,0), |
243 | retval = 15; |
248 | strlen(cp))) retval=14; |
244 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
249 | else if (!strncasecmp(cp,query_base_name(op,1), |
245 | retval = 14; |
250 | strlen(cp))) retval=14; |
246 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
251 | |
247 | retval = 14; |
252 | /* Do substring checks, so things like 'Str+1' will match. |
248 | /* Do substring checks, so things like 'Str+1' will match. |
253 | * retval of these should perhaps be lower - they are lower |
249 | * retval of these should perhaps be lower - they are lower |
254 | * then the specific strcasecmp aboves, but still higher than |
250 | * then the specific strcasecmp aboves, but still higher than |
255 | * some other match criteria. |
251 | * some other match criteria. |
256 | */ |
252 | */ |
257 | else if (strstr(query_base_name(op,1), cp)) retval = 12; |
253 | else if (strstr (qbn1, cp)) |
258 | else if (strstr(query_base_name(op,0), cp)) retval = 12; |
254 | retval = 12; |
259 | else if (strstr(query_short_name(op), cp)) retval = 12; |
255 | else if (strstr (qbn0, cp)) |
260 | |
256 | retval = 12; |
|
|
257 | else if (strstr (qsn, cp)) |
|
|
258 | retval = 12; |
261 | /* Check against plural/non plural based on count. */ |
259 | /* Check against plural/non plural based on count. */ |
262 | else if (count>1 && !strcasecmp(cp,op->name_pl)) { |
260 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
263 | retval=6; |
261 | retval = 6; |
264 | } |
|
|
265 | else if (count==1 && !strcasecmp(op->name,cp)) { |
262 | else if (count == 1 && !strcasecmp (op->name, cp)) |
266 | retval=6; |
263 | retval = 6; |
267 | } |
|
|
268 | /* base name matched - not bad */ |
264 | /* base name matched - not bad */ |
269 | else if (strcasecmp(cp,op->name)==0 && !count) retval=4; |
265 | else if (strcasecmp (cp, op->name) == 0 && !count) |
|
|
266 | retval = 4; |
270 | /* Check for partial custom name, but give a real low priority */ |
267 | /* Check for partial custom name, but give a real low priority */ |
271 | else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3; |
268 | else if (op->custom_name.contains (cp)) |
|
|
269 | retval = 3; |
272 | |
270 | |
273 | if (retval) { |
271 | if (retval) |
|
|
272 | { |
274 | if (pl->type == PLAYER) |
273 | if (pl->type == PLAYER) |
275 | pl->contr->count=count; |
274 | pl->contr->count = count; |
|
|
275 | |
276 | return retval; |
276 | return retval; |
277 | } |
277 | } |
278 | } |
278 | } |
|
|
279 | |
279 | return 0; |
280 | return 0; |
|
|
281 | } |
|
|
282 | |
|
|
283 | //-GPL |
|
|
284 | |
|
|
285 | archetype::archetype (const char *name) |
|
|
286 | { |
|
|
287 | arch = this; |
|
|
288 | this->archname = this->name = this->name_pl = name; |
|
|
289 | } |
|
|
290 | |
|
|
291 | archetype::~archetype () |
|
|
292 | { |
|
|
293 | unlink (); |
|
|
294 | } |
|
|
295 | |
|
|
296 | void |
|
|
297 | archetype::link () |
|
|
298 | { |
|
|
299 | if (!archetypes.contains (this)) |
|
|
300 | { |
|
|
301 | archetypes.insert (this); |
|
|
302 | ht.insert (std::make_pair (archname, this)); |
|
|
303 | } |
|
|
304 | } |
|
|
305 | |
|
|
306 | void |
|
|
307 | archetype::unlink () |
|
|
308 | { |
|
|
309 | if (archetypes.contains (this)) |
|
|
310 | { |
|
|
311 | archetypes.erase (this); |
|
|
312 | ht.erase (archname); |
|
|
313 | } |
280 | } |
314 | } |
281 | |
315 | |
282 | /* |
316 | /* |
283 | * Initialises the internal linked list of archetypes (read from file). |
317 | * Finds, using the hashtable, which archetype matches the given name. |
284 | * Then the global "empty_archetype" pointer is initialised. |
318 | * returns a pointer to the found archetype, otherwise NULL. |
285 | * Then the blocksview[] array is initialised. |
|
|
286 | */ |
319 | */ |
287 | |
320 | archetype * |
288 | void init_archetypes(void) { /* called from add_player() and edit() */ |
321 | archetype::find (const char *name) |
289 | if(first_archetype!=NULL) /* Only do this once */ |
322 | { |
|
|
323 | if (!name) |
290 | return; |
324 | return 0; |
291 | arch_init = 1; |
|
|
292 | load_archetypes(); |
|
|
293 | arch_init = 0; |
|
|
294 | empty_archetype=find_archetype("empty_archetype"); |
|
|
295 | /* init_blocksview();*/ |
|
|
296 | } |
|
|
297 | |
325 | |
298 | /* |
326 | auto (i, ht.find (name)); |
299 | * Stores debug-information about how efficient the hashtable |
|
|
300 | * used for archetypes has been in the static errmsg array. |
|
|
301 | */ |
|
|
302 | |
327 | |
303 | void arch_info(object *op) { |
328 | if (i == ht.end ()) |
304 | sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp); |
329 | return 0; |
305 | new_draw_info(NDI_BLACK, 0, op,errmsg); |
330 | else |
|
|
331 | return i->second; |
306 | } |
332 | } |
307 | |
333 | |
308 | /* |
|
|
309 | * Initialise the hashtable used by the archetypes. |
|
|
310 | */ |
|
|
311 | |
|
|
312 | void clear_archetable(void) { |
|
|
313 | memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *)); |
|
|
314 | } |
|
|
315 | |
|
|
316 | /* |
|
|
317 | * An alternative way to init the hashtable which is slower, but _works_... |
|
|
318 | */ |
|
|
319 | |
|
|
320 | void init_archetable(void) { |
|
|
321 | archetype *at; |
334 | archetype * |
322 | LOG(llevDebug," Setting up archetable...\n"); |
335 | archetype::read (object_thawer &f) |
323 | for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) |
336 | { |
324 | add_arch(at); |
337 | assert (f.kw == KW_object); |
325 | LOG(llevDebug,"done\n"); |
|
|
326 | } |
|
|
327 | |
338 | |
328 | /* |
339 | std::vector<archetype *> parts; |
329 | * Dumps an archetype to debug-level output. |
|
|
330 | */ |
|
|
331 | |
340 | |
332 | void dump_arch(archetype *at) { |
341 | coroapi::cede_to_tick (); |
333 | dump_object(&at->clone); |
|
|
334 | } |
|
|
335 | |
342 | |
336 | /* |
343 | for (;;) |
337 | * Dumps _all_ archetypes to debug-level output. |
344 | { |
338 | * If you run crossfire with debug, and enter DM-mode, you can trigger |
345 | archetype *at = new archetype (f.get_str ()); |
339 | * this with the O key. |
|
|
340 | */ |
|
|
341 | |
346 | |
342 | void dump_all_archetypes(void) { |
347 | f.next (); |
343 | archetype *at; |
348 | |
344 | for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) { |
349 | #if 0 |
345 | dump_arch(at); |
350 | // implementing it here in the server does neither allow multiple inheritence |
346 | fprintf(logfile, "%s\n", errmsg); |
351 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
352 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
|
|
353 | // not that any of this is relevant as of yet... |
|
|
354 | if (f.kw == KW_inherit) |
|
|
355 | { |
|
|
356 | if (archetype *at = find (f.get_str ())) |
|
|
357 | *op = at->clone; |
|
|
358 | else |
|
|
359 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
|
|
360 | &at->archname, f.get_str ()); |
|
|
361 | |
|
|
362 | f.next (); |
|
|
363 | } |
|
|
364 | #endif |
|
|
365 | |
|
|
366 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
367 | bool parse_ok = at->parse_kv (f); |
|
|
368 | loading_arch = 0; |
|
|
369 | |
|
|
370 | if (!parse_ok) |
|
|
371 | goto fail; |
|
|
372 | |
|
|
373 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
374 | at->post_load_check (); |
|
|
375 | loading_arch = 0; |
|
|
376 | |
|
|
377 | parts.push_back (at); |
|
|
378 | |
|
|
379 | if (f.kw != KW_more) |
|
|
380 | break; |
|
|
381 | |
|
|
382 | f.next (); |
|
|
383 | |
|
|
384 | if (f.kw != KW_object) |
|
|
385 | { |
|
|
386 | f.parse_error ("more object"); |
|
|
387 | goto fail; |
|
|
388 | } |
|
|
389 | } |
|
|
390 | |
|
|
391 | { |
|
|
392 | auto (at, parts.begin ()); |
|
|
393 | |
|
|
394 | archetype *new_head = parts.front (); |
|
|
395 | archetype *old_head = find (new_head->archname); |
|
|
396 | |
|
|
397 | if (old_head && !old_head->is_head ()) |
|
|
398 | { |
|
|
399 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
400 | &new_head->archname, &old_head->archname); |
|
|
401 | goto fail; |
|
|
402 | } |
|
|
403 | |
|
|
404 | // check that all archetypes belong to the same old object or are new |
|
|
405 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
|
|
406 | { |
|
|
407 | archetype *new_part = *at; |
|
|
408 | archetype *old_part = find (new_part->archname); |
|
|
409 | |
|
|
410 | if (old_part && old_part->head_ () != old_head) |
|
|
411 | { |
|
|
412 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
|
|
413 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
|
|
414 | goto fail; |
|
|
415 | } |
|
|
416 | } |
|
|
417 | |
|
|
418 | // assemble new chain |
|
|
419 | new_head->min_x = new_head->max_x = new_head->x; |
|
|
420 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
421 | |
|
|
422 | archetype *less = new_head; |
|
|
423 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
|
|
424 | { |
|
|
425 | archetype *at = *p; |
|
|
426 | |
|
|
427 | // some flags get inherited from the head (probably a lot more) |
|
|
428 | // doing it here doesn't feel too cozy, but it allows code |
|
|
429 | // to ignore head checks for these flags, which saves time |
|
|
430 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
431 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
432 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
433 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
434 | |
|
|
435 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
436 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
437 | new_head->max_x = max (new_head->max_x, at->x); |
|
|
438 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
439 | |
|
|
440 | at->head = new_head; |
|
|
441 | less->more = at; |
|
|
442 | less = at; |
|
|
443 | } |
|
|
444 | |
|
|
445 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
|
|
446 | |
|
|
447 | return new_head; |
347 | } |
448 | } |
348 | } |
|
|
349 | |
449 | |
350 | void free_all_archs(void) |
450 | fail: |
351 | { |
451 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
352 | archetype *at, *next; |
452 | (*p)->destroy (); |
353 | int i=0,f=0; |
|
|
354 | |
453 | |
355 | for (at=first_archetype; at!=NULL; at=next) { |
|
|
356 | if (at->more) next=at->more; |
|
|
357 | else next=at->next; |
|
|
358 | if (at->name) free_string(at->name); |
|
|
359 | if (at->clone.name) free_string(at->clone.name); |
|
|
360 | if (at->clone.name_pl) free_string(at->clone.name_pl); |
|
|
361 | if (at->clone.title) free_string(at->clone.title); |
|
|
362 | if (at->clone.race) free_string(at->clone.race); |
|
|
363 | if (at->clone.slaying) free_string(at->clone.slaying); |
|
|
364 | if (at->clone.msg) free_string(at->clone.msg); |
|
|
365 | free(at); |
|
|
366 | i++; |
|
|
367 | } |
|
|
368 | LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f); |
|
|
369 | } |
|
|
370 | |
|
|
371 | /* |
|
|
372 | * Allocates, initialises and returns the pointer to an archetype structure. |
|
|
373 | */ |
|
|
374 | |
|
|
375 | archetype *get_archetype_struct(void) { |
|
|
376 | archetype *arch; |
|
|
377 | |
|
|
378 | arch=(archetype *)CALLOC(1,sizeof(archetype)); |
|
|
379 | if(arch==NULL) |
|
|
380 | fatal(OUT_OF_MEMORY); |
|
|
381 | arch->next=NULL; |
|
|
382 | arch->name=NULL; |
|
|
383 | arch->clone.other_arch=NULL; |
|
|
384 | arch->clone.name=NULL; |
|
|
385 | arch->clone.name_pl=NULL; |
|
|
386 | arch->clone.title=NULL; |
|
|
387 | arch->clone.race=NULL; |
|
|
388 | arch->clone.slaying=NULL; |
|
|
389 | arch->clone.msg=NULL; |
|
|
390 | clear_object(&arch->clone); /* to initial state other also */ |
|
|
391 | CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */ |
|
|
392 | SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
393 | arch->head=NULL; |
|
|
394 | arch->more=NULL; |
|
|
395 | return arch; |
454 | return 0; |
396 | } |
455 | } |
397 | |
456 | |
398 | /* |
457 | void |
399 | * Reads/parses the archetype-file, and copies into a linked list |
458 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
400 | * of archetype-structures. |
459 | { |
401 | */ |
460 | ref = 0; |
402 | void first_arch_pass(FILE *fp) { |
461 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
403 | object *op; |
462 | } |
404 | archetype *at,*head=NULL,*last_more=NULL; |
|
|
405 | int i,first=2; |
|
|
406 | |
463 | |
407 | op=get_object(); |
464 | void |
408 | op->arch=first_archetype=at=get_archetype_struct(); |
465 | archetype::commit_load () |
409 | |
466 | { |
410 | while((i=load_object(fp,op,first,0))) { |
467 | // unlink old archetypes and link in new ones */ |
411 | first=0; |
468 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
412 | copy_object(op,&at->clone); |
|
|
413 | at->clone.speed_left= (float) (-0.1); |
|
|
414 | /* copy the body_info to the body_used - this is only really |
|
|
415 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
416 | * by doing so, when a monster is created, it has good starting |
|
|
417 | * values for the body_used info, so when items are created |
|
|
418 | * for it, they can be properly equipped. |
|
|
419 | */ |
|
|
420 | memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info)); |
|
|
421 | |
|
|
422 | switch(i) { |
|
|
423 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
|
|
424 | if(last_more!=NULL) |
|
|
425 | last_more->next=at; |
|
|
426 | if(head!=NULL) |
|
|
427 | head->next=at; |
|
|
428 | head=last_more=at; |
|
|
429 | #if 0 |
|
|
430 | if(!op->type) |
|
|
431 | LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
432 | #endif |
|
|
433 | at->tail_x = 0; |
|
|
434 | at->tail_y = 0; |
|
|
435 | break; |
|
|
436 | |
|
|
437 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
|
|
438 | |
|
|
439 | at->head=head; |
|
|
440 | at->clone.head = &head->clone; |
|
|
441 | if(last_more!=NULL) { |
|
|
442 | last_more->more=at; |
|
|
443 | last_more->clone.more = &at->clone; |
|
|
444 | } |
|
|
445 | last_more=at; |
|
|
446 | |
|
|
447 | /* If this multipart image is still composed of individual small |
|
|
448 | * images, don't set the tail_.. values. We can't use them anyways, |
|
|
449 | * and setting these to zero makes the map sending to the client much |
|
|
450 | * easier as just looking at the head, we know what to do. |
|
|
451 | */ |
|
|
452 | if (at->clone.face != head->clone.face) { |
|
|
453 | head->tail_x = 0; |
|
|
454 | head->tail_y = 0; |
|
|
455 | } else { |
|
|
456 | if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; |
|
|
457 | if (at->clone.y > head->tail_y) head->tail_y = at->clone.y; |
|
|
458 | } |
|
|
459 | break; |
|
|
460 | |
|
|
461 | } |
|
|
462 | |
|
|
463 | at=get_archetype_struct(); |
|
|
464 | clear_object(op); |
|
|
465 | op->arch=at; |
|
|
466 | } |
469 | { |
467 | free(at); |
470 | archetype *at = *p; |
468 | free_object(op); |
|
|
469 | } |
|
|
470 | |
471 | |
471 | /* |
472 | if (archetype *old = find (at->archname)) |
472 | * Reads the archetype file once more, and links all pointers between |
473 | old->unlink (); |
473 | * archetypes. |
|
|
474 | */ |
|
|
475 | |
474 | |
476 | void second_arch_pass(FILE *fp) { |
475 | allarch.push_back (at); |
477 | char buf[MAX_BUF],*variable=buf,*argument,*cp; |
|
|
478 | archetype *at=NULL,*other; |
|
|
479 | |
476 | |
480 | while(fgets(buf,MAX_BUF,fp)!=NULL) { |
477 | at->link (); |
481 | if(*buf=='#') |
478 | ++dirtycnt; |
482 | continue; |
|
|
483 | if((argument=strchr(buf,' '))!=NULL) { |
|
|
484 | *argument='\0',argument++; |
|
|
485 | cp = argument + strlen(argument)-1; |
|
|
486 | while (isspace(*cp)) { |
|
|
487 | *cp='\0'; |
|
|
488 | cp--; |
|
|
489 | } |
|
|
490 | } |
|
|
491 | if(!strcmp("Object",variable)) { |
|
|
492 | if((at=find_archetype(argument))==NULL) |
|
|
493 | LOG(llevError,"Warning: failed to find arch %s\n",argument); |
|
|
494 | } else if(!strcmp("other_arch",variable)) { |
|
|
495 | if(at!=NULL&&at->clone.other_arch==NULL) { |
|
|
496 | if((other=find_archetype(argument))==NULL) |
|
|
497 | LOG(llevError,"Warning: failed to find other_arch %s\n",argument); |
|
|
498 | else if(at!=NULL) |
|
|
499 | at->clone.other_arch=other; |
|
|
500 | } |
479 | } |
501 | } else if(!strcmp("randomitems",variable)) { |
480 | |
502 | if(at!=NULL) { |
481 | postponed_arch.clear (); |
503 | treasurelist *tl=find_treasurelist(argument); |
482 | |
504 | if(tl==NULL) |
483 | // now resolve arch references |
505 | LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument); |
484 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
|
|
485 | { |
|
|
486 | arch_ptr *ap = p->first; |
|
|
487 | archetype *at = find (p->second); |
|
|
488 | |
|
|
489 | if (!at) |
|
|
490 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
|
|
491 | |
|
|
492 | *ap = at; |
|
|
493 | } |
|
|
494 | |
|
|
495 | postponed_arch_ref.clear (); |
|
|
496 | |
|
|
497 | empty = find (shstr_empty_archetype); |
|
|
498 | } |
|
|
499 | |
|
|
500 | void |
|
|
501 | archetype::gc () |
|
|
502 | { |
|
|
503 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
|
|
504 | dirtycnt = max (0, dirtycnt - cnt); |
|
|
505 | |
|
|
506 | do |
|
|
507 | { |
|
|
508 | static int idx; |
|
|
509 | |
|
|
510 | if (idx >= allarch.size ()) |
|
|
511 | if (idx) |
|
|
512 | idx = 0; |
506 | else |
513 | else |
507 | at->clone.randomitems=tl; |
514 | return; |
|
|
515 | |
|
|
516 | archetype *at = allarch [idx]; |
|
|
517 | |
|
|
518 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
|
|
519 | ++idx; |
|
|
520 | else |
|
|
521 | { |
|
|
522 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
|
|
523 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
|
|
524 | allarch.erase (idx); |
|
|
525 | |
|
|
526 | // break chain |
|
|
527 | for (object *op = at->head_ (); op; ) |
|
|
528 | { |
|
|
529 | object *next = op->more; |
|
|
530 | op->head = 0; |
|
|
531 | op->more = 0; |
|
|
532 | op = next; |
|
|
533 | } |
|
|
534 | |
|
|
535 | at->destroy (); |
|
|
536 | at->arch = 0; |
508 | } |
537 | } |
509 | } |
|
|
510 | } |
|
|
511 | } |
|
|
512 | |
|
|
513 | #ifdef DEBUG |
|
|
514 | void check_generators(void) { |
|
|
515 | archetype *at; |
|
|
516 | for(at=first_archetype;at!=NULL;at=at->next) |
|
|
517 | if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL) |
|
|
518 | LOG(llevError,"Warning: %s is generator but lacks other_arch.\n", |
|
|
519 | at->name); |
|
|
520 | } |
|
|
521 | #endif |
|
|
522 | |
|
|
523 | /* |
|
|
524 | * First initialises the archtype hash-table (init_archetable()). |
|
|
525 | * Reads and parses the archetype file (with the first and second-pass |
|
|
526 | * functions). |
|
|
527 | * Then initialises treasures by calling load_treasures(). |
|
|
528 | */ |
|
|
529 | |
|
|
530 | void load_archetypes(void) { |
|
|
531 | FILE *fp; |
|
|
532 | char filename[MAX_BUF]; |
|
|
533 | int comp; |
|
|
534 | #if TIME_ARCH_LOAD |
|
|
535 | struct timeval tv1,tv2; |
|
|
536 | #endif |
|
|
537 | |
|
|
538 | sprintf(filename,"%s/%s",settings.datadir,settings.archetypes); |
|
|
539 | LOG(llevDebug,"Reading archetypes from %s...\n",filename); |
|
|
540 | if((fp=open_and_uncompress(filename,0,&comp))==NULL) { |
|
|
541 | LOG(llevError," Can't open archetype file.\n"); |
|
|
542 | return; |
|
|
543 | } |
|
|
544 | clear_archetable(); |
|
|
545 | LOG(llevDebug," arch-pass 1...\n"); |
|
|
546 | #if TIME_ARCH_LOAD |
|
|
547 | GETTIMEOFDAY(&tv1); |
|
|
548 | #endif |
|
|
549 | first_arch_pass(fp); |
|
|
550 | #if TIME_ARCH_LOAD |
|
|
551 | { int sec, usec; |
|
|
552 | GETTIMEOFDAY(&tv2); |
|
|
553 | sec = tv2.tv_sec - tv1.tv_sec; |
|
|
554 | usec = tv2.tv_usec - tv1.tv_usec; |
|
|
555 | if (usec<0) { usec +=1000000; sec--;} |
|
|
556 | LOG(llevDebug,"Load took %d.%06d seconds\n", sec, usec); |
|
|
557 | } |
538 | } |
558 | #endif |
539 | while (--cnt); |
559 | |
|
|
560 | LOG(llevDebug," done\n"); |
|
|
561 | init_archetable(); |
|
|
562 | warn_archetypes=1; |
|
|
563 | |
|
|
564 | /* do a close and reopen instead of a rewind - necessary in case the |
|
|
565 | * file has been compressed. |
|
|
566 | */ |
|
|
567 | close_and_delete(fp, comp); |
|
|
568 | fp=open_and_uncompress(filename,0,&comp); |
|
|
569 | |
|
|
570 | LOG(llevDebug," loading treasure...\n"); |
|
|
571 | load_treasures(); |
|
|
572 | LOG(llevDebug," done\n arch-pass 2...\n"); |
|
|
573 | second_arch_pass(fp); |
|
|
574 | LOG(llevDebug," done\n"); |
|
|
575 | #ifdef DEBUG |
|
|
576 | check_generators(); |
|
|
577 | #endif |
|
|
578 | close_and_delete(fp, comp); |
|
|
579 | LOG(llevDebug," done\n"); |
|
|
580 | } |
540 | } |
581 | |
541 | |
582 | /* |
|
|
583 | * Creates and returns a new object which is a copy of the given archetype. |
|
|
584 | * This function returns NULL on failure. |
|
|
585 | */ |
|
|
586 | |
|
|
587 | object *arch_to_object(archetype *at) { |
|
|
588 | object *op; |
542 | object * |
589 | if(at==NULL) { |
543 | archetype::instance () |
590 | if(warn_archetypes) |
544 | { |
591 | LOG(llevError,"Couldn't find archetype.\n"); |
545 | object *op = clone (); |
592 | return NULL; |
546 | op->instantiate (); |
593 | } |
|
|
594 | op=get_object(); |
|
|
595 | copy_object(&at->clone,op); |
|
|
596 | op->arch=at; |
|
|
597 | return op; |
547 | return op; |
598 | } |
548 | } |
|
|
549 | |
|
|
550 | //+GPL |
599 | |
551 | |
600 | /* |
552 | /* |
601 | * Creates an object. This function is called by get_archetype() |
553 | * Creates an object. This function is called by get_archetype() |
602 | * if it fails to find the appropriate archetype. |
554 | * if it fails to find the appropriate archetype. |
603 | * Thus get_archetype() will be guaranteed to always return |
555 | * Thus get_archetype() will be guaranteed to always return |
604 | * an object, and never NULL. |
556 | * an object, and never NULL. |
605 | */ |
557 | */ |
606 | |
558 | object * |
607 | object *create_singularity(const char *name) { |
559 | create_singularity (const char *name) |
608 | object *op; |
560 | { |
609 | char buf[MAX_BUF]; |
561 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
610 | sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); |
562 | |
611 | op = get_object(); |
563 | if (!strcmp (name, "bug")) |
612 | op->name = add_string(buf); |
564 | abort (); |
613 | op->name_pl = add_string(buf); |
565 | |
614 | SET_FLAG(op,FLAG_NO_PICK); |
566 | object *op = archetype::get (shstr_bug); |
|
|
567 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
568 | |
615 | return op; |
569 | return op; |
616 | } |
570 | } |
617 | |
571 | |
618 | /* |
572 | /* |
619 | * Finds which archetype matches the given name, and returns a new |
573 | * Finds which archetype matches the given name, and returns a new |
620 | * object containing a copy of the archetype. |
574 | * object containing a copy of the archetype. |
621 | */ |
575 | */ |
622 | |
576 | object * |
623 | object *get_archetype(const char *name) { |
577 | get_archetype (const char *name) |
624 | archetype *at; |
578 | { |
625 | at = find_archetype(name); |
579 | return archetype::get (name); |
626 | if (at == NULL) |
580 | } |
|
|
581 | |
|
|
582 | object * |
|
|
583 | archetype::get (const char *name) |
|
|
584 | { |
|
|
585 | archetype *at = find (name); |
|
|
586 | |
|
|
587 | if (!at) |
627 | return create_singularity(name); |
588 | return create_singularity (name); |
628 | return arch_to_object(at); |
|
|
629 | } |
|
|
630 | |
589 | |
631 | /* |
590 | return at->instance (); |
632 | * Hash-function used by the arch-hashtable. |
|
|
633 | */ |
|
|
634 | |
|
|
635 | unsigned long |
|
|
636 | hasharch(const char *str, int tablesize) { |
|
|
637 | unsigned long hash = 0; |
|
|
638 | int i = 0; |
|
|
639 | const char *p; |
|
|
640 | |
|
|
641 | /* use the one-at-a-time hash function, which supposedly is |
|
|
642 | * better than the djb2-like one used by perl5.005, but |
|
|
643 | * certainly is better then the bug used here before. |
|
|
644 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
645 | */ |
|
|
646 | for (p = str; i < MAXSTRING && *p; p++, i++) { |
|
|
647 | hash += *p; |
|
|
648 | hash += hash << 10; |
|
|
649 | hash ^= hash >> 6; |
|
|
650 | } |
|
|
651 | hash += hash << 3; |
|
|
652 | hash ^= hash >> 11; |
|
|
653 | hash += hash << 15; |
|
|
654 | return hash % tablesize; |
|
|
655 | } |
|
|
656 | |
|
|
657 | /* |
|
|
658 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
659 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
660 | */ |
|
|
661 | |
|
|
662 | archetype *find_archetype(const char *name) { |
|
|
663 | archetype *at; |
|
|
664 | unsigned long index; |
|
|
665 | |
|
|
666 | if (name == NULL) |
|
|
667 | return (archetype *) NULL; |
|
|
668 | |
|
|
669 | index=hasharch(name, ARCHTABLE); |
|
|
670 | arch_search++; |
|
|
671 | for(;;) { |
|
|
672 | at = arch_table[index]; |
|
|
673 | if (at==NULL) { |
|
|
674 | if(warn_archetypes) |
|
|
675 | LOG(llevError,"Couldn't find archetype %s\n",name); |
|
|
676 | return NULL; |
|
|
677 | } |
|
|
678 | arch_cmp++; |
|
|
679 | if (!strcmp(at->name,name)) |
|
|
680 | return at; |
|
|
681 | if(++index>=ARCHTABLE) |
|
|
682 | index=0; |
|
|
683 | } |
|
|
684 | } |
|
|
685 | |
|
|
686 | /* |
|
|
687 | * Adds an archetype to the hashtable. |
|
|
688 | */ |
|
|
689 | |
|
|
690 | static void add_arch(archetype *at) { |
|
|
691 | int index=hasharch(at->name, ARCHTABLE),org_index=index; |
|
|
692 | for(;;) { |
|
|
693 | if(arch_table[index]==NULL) { |
|
|
694 | arch_table[index]=at; |
|
|
695 | return; |
|
|
696 | } |
|
|
697 | if(++index==ARCHTABLE) |
|
|
698 | index=0; |
|
|
699 | if(index==org_index) |
|
|
700 | fatal(ARCHTABLE_TOO_SMALL); |
|
|
701 | } |
|
|
702 | } |
591 | } |
703 | |
592 | |
704 | /* |
593 | /* |
705 | * Returns the first archetype using the given type. |
594 | * Returns the first archetype using the given type. |
706 | * Used in treasure-generation. |
595 | * Used in treasure-generation. |
707 | */ |
596 | */ |
708 | |
|
|
709 | archetype *type_to_archetype(int type) { |
|
|
710 | archetype *at; |
597 | archetype * |
711 | |
598 | type_to_archetype (int type) |
712 | for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) |
599 | { |
713 | if(at->clone.type==type) |
600 | for_all_archetypes (at) |
|
|
601 | if (at->type == type && at->head_ () != at) |
714 | return at; |
602 | return at; |
|
|
603 | |
715 | return NULL; |
604 | return 0; |
716 | } |
605 | } |
717 | |
606 | |
718 | /* |
607 | /* |
719 | * Returns a new object copied from the first archetype matching |
608 | * Returns a new object copied from the first archetype matching |
720 | * the given type. |
609 | * the given type. |
721 | * Used in treasure-generation. |
610 | * Used in treasure-generation. |
722 | */ |
611 | */ |
723 | |
612 | object * |
724 | object *clone_arch(int type) { |
613 | clone_arch (int type) |
725 | archetype *at; |
614 | { |
726 | object *op=get_object(); |
615 | archetype *at = type_to_archetype (type); |
727 | |
616 | |
728 | if((at=type_to_archetype(type))==NULL) { |
617 | if (!at) |
|
|
618 | { |
729 | LOG(llevError,"Can't clone archetype %d\n",type); |
619 | LOG (llevError, "Can't clone archetype %d\n", type); |
730 | free_object(op); |
|
|
731 | return NULL; |
620 | return 0; |
732 | } |
621 | } |
733 | copy_object(&at->clone,op); |
622 | |
734 | return op; |
623 | return at->instance (); |
735 | } |
624 | } |
736 | |
625 | |
737 | /* |
626 | /* |
738 | * member: make instance from class |
627 | * member: make instance from class |
739 | */ |
628 | */ |
740 | |
629 | object * |
741 | object *object_create_arch (archetype * at) |
630 | object_create_arch (archetype *at) |
742 | { |
631 | { |
743 | object *op, *prev = NULL, *head = NULL; |
632 | object *op, *prev = 0, *head = 0; |
744 | |
633 | |
745 | while (at) { |
634 | while (at) |
746 | op = arch_to_object (at); |
635 | { |
|
|
636 | op = at->instance (); |
|
|
637 | |
747 | op->x = at->clone.x; |
638 | op->x = at->x; |
748 | op->y = at->clone.y; |
639 | op->y = at->y; |
|
|
640 | |
749 | if (head) |
641 | if (head) |
750 | op->head = head, prev->more = op; |
642 | op->head = head, prev->more = op; |
|
|
643 | |
751 | if (!head) |
644 | if (!head) |
752 | head = op; |
645 | head = op; |
|
|
646 | |
753 | prev = op; |
647 | prev = op; |
754 | at = at->more; |
648 | at = (archetype *)at->more; |
755 | } |
649 | } |
|
|
650 | |
756 | return (head); |
651 | return head; |
757 | } |
652 | } |
758 | |
653 | |
759 | /*** end of arch.c ***/ |
654 | //-GPL |
|
|
655 | |