1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | 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 |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | (at your option) any later version. |
11 | * 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 Affero GNU General Public License |
18 | 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 |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
20 | |
21 | * |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <stdio.h> |
25 | #include <stdio.h> |
25 | #include <global.h> |
26 | #include <global.h> |
26 | |
27 | |
27 | sint64 *levels; |
28 | sint64 levels[MAXNUMLEVELS]; |
28 | |
29 | |
29 | float exp_att_mult[NROFATTACKS + 2] = { |
30 | static const float exp_att_mult[NROFATTACKS + 2] = { |
30 | 0.0, /* AT_PHYSICAL */ |
31 | 0.0, /* AT_PHYSICAL */ |
31 | 0.0, /* AT_MAGIC */ |
32 | 0.0, /* AT_MAGIC */ |
32 | 0.0, /* AT_FIRE */ |
33 | 0.0, /* AT_FIRE */ |
33 | 0.0, /* AT_ELECTRICITY */ |
34 | 0.0, /* AT_ELECTRICITY */ |
34 | 0.0, /* AT_COLD */ |
35 | 0.0, /* AT_COLD */ |
… | |
… | |
47 | 0.0, /* AT_DEATH */ |
48 | 0.0, /* AT_DEATH */ |
48 | 0.0, /* AT_CHAOS */ |
49 | 0.0, /* AT_CHAOS */ |
49 | 0.0 /* AT_COUNTERSPELL */ |
50 | 0.0 /* AT_COUNTERSPELL */ |
50 | }; |
51 | }; |
51 | |
52 | |
52 | float exp_prot_mult[NROFATTACKS + 2] = { |
53 | static const float exp_prot_mult[NROFATTACKS + 2] = { |
53 | 0.4, /* AT_PHYSICAL */ |
54 | 0.4, /* AT_PHYSICAL */ |
54 | 0.5, /* AT_MAGIC */ |
55 | 0.5, /* AT_MAGIC */ |
55 | 0.1, /* AT_FIRE */ |
56 | 0.1, /* AT_FIRE */ |
56 | 0.1, /* AT_ELECTRICITY */ |
57 | 0.1, /* AT_ELECTRICITY */ |
57 | 0.1, /* AT_COLD */ |
58 | 0.1, /* AT_COLD */ |
… | |
… | |
71 | 0.0, /* AT_CHAOS */ |
72 | 0.0, /* AT_CHAOS */ |
72 | 0.0 /* AT_COUNTERSPELL */ |
73 | 0.0 /* AT_COUNTERSPELL */ |
73 | }; |
74 | }; |
74 | |
75 | |
75 | /* |
76 | /* |
|
|
77 | * Returns true if the monster specified has any innate abilities. |
|
|
78 | */ |
|
|
79 | static int |
|
|
80 | has_ability (const object *ob) |
|
|
81 | { |
|
|
82 | for (object *tmp = ob->inv; tmp; tmp = tmp->below) |
|
|
83 | if (tmp->type == SPELL || tmp->type == SPELLBOOK) |
|
|
84 | return true; |
|
|
85 | |
|
|
86 | return false; |
|
|
87 | } |
|
|
88 | |
|
|
89 | /* |
76 | * new_exp() is an alternative way to calculate experience based |
90 | * new_exp() is an alternative way to calculate experience based |
77 | * on the ability of a monster. |
91 | * on the ability of a monster. |
78 | * It's far from perfect, and doesn't consider everything which |
92 | * It's far from perfect, and doesn't consider everything which |
79 | * can be considered, thus it's only used in debugging. |
93 | * can be considered, thus it's only used in debugging. |
80 | * this is only used with one of the dumpflags, |
94 | * this is only used with one of the dumpflags, |
81 | * and not anyplace in the code. |
95 | * and not anyplace in the code. |
82 | */ |
96 | */ |
83 | |
|
|
84 | int |
97 | int |
85 | new_exp (const object *ob) |
98 | new_exp (const object *ob) |
86 | { |
99 | { |
87 | double att_mult, prot_mult, spec_mult; |
100 | double att_mult, prot_mult, spec_mult; |
88 | double exp; |
101 | double exp; |
… | |
… | |
98 | * the doubling is to take into account the table and resistances |
111 | * the doubling is to take into account the table and resistances |
99 | * are lower than they once were. |
112 | * are lower than they once were. |
100 | */ |
113 | */ |
101 | prot_mult += (exp_prot_mult[i] * 200 * ob->resist[i]) / 100.0; |
114 | prot_mult += (exp_prot_mult[i] * 200 * ob->resist[i]) / 100.0; |
102 | } |
115 | } |
|
|
116 | |
103 | spec_mult += (0.3 * (QUERY_FLAG (ob, FLAG_SEE_INVISIBLE) != 0)) + |
117 | spec_mult += (0.3 * (ob->flag [FLAG_SEE_INVISIBLE] != 0)) + |
104 | (0.5 * (QUERY_FLAG (ob, FLAG_SPLITTING) != 0)) + |
118 | (0.5 * (ob->flag [FLAG_SPLITTING] != 0)) + |
105 | (0.3 * (QUERY_FLAG (ob, FLAG_HITBACK) != 0)) + |
119 | (0.3 * (ob->flag [FLAG_HITBACK] != 0)) + |
106 | (0.1 * (QUERY_FLAG (ob, FLAG_REFL_MISSILE) != 0)) + |
120 | (0.1 * (ob->flag [FLAG_REFL_MISSILE] != 0)) + |
107 | (0.3 * (QUERY_FLAG (ob, FLAG_REFL_SPELL) != 0)) + |
121 | (0.3 * (ob->flag [FLAG_REFL_SPELL] != 0)) + |
108 | (1.0 * (QUERY_FLAG (ob, FLAG_NO_MAGIC) != 0)) + |
122 | (1.0 * (ob->flag [FLAG_NO_MAGIC] != 0)) + |
109 | (0.1 * (QUERY_FLAG (ob, FLAG_PICK_UP) != 0)) + |
123 | (0.1 * (ob->flag [FLAG_PICK_UP] != 0)) + |
110 | (0.1 * (QUERY_FLAG (ob, FLAG_USE_SCROLL) != 0)) + |
124 | (0.1 * (ob->flag [FLAG_USE_SCROLL] != 0)) + |
111 | (0.2 * (QUERY_FLAG (ob, FLAG_USE_RANGE) != 0)) + (0.1 * (QUERY_FLAG (ob, FLAG_USE_BOW) != 0)); |
125 | (0.2 * (ob->flag [FLAG_USE_RANGE] != 0)) + (0.1 * (ob->flag [FLAG_USE_BOW] != 0)); |
112 | |
126 | |
113 | exp = (ob->stats.maxhp < 5) ? 5 : ob->stats.maxhp; |
127 | exp = (ob->stats.maxhp < 5) ? 5 : ob->stats.maxhp; |
114 | exp *= (QUERY_FLAG (ob, FLAG_CAST_SPELL) && has_ability (ob)) ? (40 + (ob->stats.maxsp > 80 ? 80 : ob->stats.maxsp)) / 40 : 1; |
128 | exp *= (ob->flag [FLAG_CAST_SPELL] && has_ability (ob)) ? (40 + (ob->stats.maxsp > 80 ? 80 : ob->stats.maxsp)) / 40 : 1; |
115 | exp *= (80.0 / (70.0 + ob->stats.wc)) * (80.0 / (70.0 + ob->stats.ac)) * (50.0 + ob->stats.dam) / 50.0; |
129 | exp *= (80.0 / (70.0 + ob->stats.wc)) * (80.0 / (70.0 + ob->stats.ac)) * (50.0 + ob->stats.dam) / 50.0; |
116 | exp *= att_mult * prot_mult * spec_mult; |
130 | exp *= att_mult * prot_mult * spec_mult; |
117 | exp *= 2.0 / (2.0 - ((FABS (ob->speed) < 0.95) ? FABS (ob->speed) : 0.95)); |
131 | exp *= 2.0 / (2.0 - min (ob->speed, 0.95)); |
118 | exp *= (20.0 + ob->stats.Con) / 20.0; |
132 | exp *= (20.0 + ob->stats.Con) / 20.0; |
119 | if (QUERY_FLAG (ob, FLAG_STAND_STILL)) |
133 | if (ob->flag [FLAG_STAND_STILL]) |
120 | exp /= 2; |
134 | exp /= 2; |
121 | |
135 | |
122 | return (int) exp; |
136 | return exp; |
123 | } |
137 | } |
124 | |
138 | |
125 | /* |
139 | //TODO: binary search... |
126 | * Returns true if the monster specified has any innate abilities. |
|
|
127 | */ |
|
|
128 | |
|
|
129 | int |
140 | int |
130 | has_ability (const object *ob) |
141 | exp_to_level (sint64 exp) |
131 | { |
142 | { |
132 | object *tmp; |
143 | for (int i = 1; i <= settings.max_level; i++) |
|
|
144 | if (levels [i] > exp) |
|
|
145 | return i - 1; |
133 | |
146 | |
134 | for (tmp = ob->inv; tmp != NULL; tmp = tmp->below) |
147 | return settings.max_level; |
135 | if (tmp->type == SPELL || tmp->type == SPELLBOOK) |
148 | } |
|
|
149 | |
|
|
150 | sint64 |
|
|
151 | level_to_min_exp (int level) |
|
|
152 | { |
|
|
153 | if (level <= 0) |
136 | return true; |
154 | return 0; |
137 | return false; |
155 | else |
|
|
156 | return levels [min (level, settings.max_level)]; |
138 | } |
157 | } |
139 | |
158 | |
140 | /* This loads the experience table from the exp_table |
159 | /* This loads the experience table from the exp_table |
141 | * file. This tends to exit on any errors, since it |
160 | * file. This tends to exit on any errors, since it |
142 | * populates the table as it goes along, so if there |
161 | * populates the table as it goes along, so if there |
143 | * are errors, the table is likely in an inconsistent |
162 | * are errors, the table is likely in an inconsistent |
144 | * state. |
163 | * state. |
145 | */ |
164 | */ |
146 | void |
165 | void |
147 | init_experience (void) |
166 | init_experience () |
148 | { |
167 | { |
149 | char buf[MAX_BUF], *cp; |
|
|
150 | int lastlevel = 0, comp; |
168 | int lastlevel = 0; |
151 | sint64 lastexp = -1, tmpexp; |
169 | sint64 lastexp = -1; |
152 | FILE *fp; |
|
|
153 | |
170 | |
|
|
171 | object_thawer thawer (settings.datadir, "exp_table"); |
154 | |
172 | |
155 | sprintf (buf, "%s/exp_table", settings.confdir); |
173 | if (!thawer) |
156 | |
|
|
157 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
158 | { |
174 | { |
|
|
175 | LOG (llevError, "unable to parse experience table file"); |
159 | return; |
176 | return; |
160 | } |
177 | } |
161 | while (fgets (buf, MAX_BUF - 1, fp) != NULL) |
178 | |
|
|
179 | if (thawer.kw != KW_max_level) |
|
|
180 | { |
|
|
181 | thawer.parse_error ("experience table file"); |
|
|
182 | return; |
162 | { |
183 | } |
163 | if (buf[0] == '#') |
|
|
164 | continue; |
|
|
165 | |
184 | |
166 | /* eliminate newline */ |
185 | thawer.get (settings.max_level); |
167 | if ((cp = strrchr (buf, '\n')) != NULL) |
|
|
168 | *cp = '\0'; |
|
|
169 | |
186 | |
170 | /* Skip over empty lines */ |
187 | sint64 newlevels [MAXNUMLEVELS]; |
171 | if (buf[0] == 0) |
188 | |
172 | continue; |
189 | while (thawer.next_line ()) |
173 | cp = buf; |
190 | { |
174 | while (isspace (*cp) && *cp != 0) |
191 | sint64 tmpexp; |
175 | cp++; |
192 | thawer.get (tmpexp); |
176 | if (!strncasecmp (cp, "max_level", 9)) |
193 | |
|
|
194 | /* Do some sanity checking - if value is bogus, just exit because |
|
|
195 | * the table otherwise is probably in an inconsistent state |
|
|
196 | */ |
|
|
197 | if (tmpexp <= lastexp) |
177 | { |
198 | { |
178 | if (settings.max_level) |
199 | LOG (llevError, "Experience for level %d is lower than previous level (%" PRId64 " <= %" PRId64 ")\n", lastlevel + 1, tmpexp, lastexp); |
179 | { |
200 | return; |
180 | LOG (llevDebug, "Got more than one max_level value from exp_table file?\n"); |
|
|
181 | free (levels); |
|
|
182 | } |
|
|
183 | settings.max_level = atoi (cp + 9); |
|
|
184 | if (!settings.max_level) |
|
|
185 | { |
|
|
186 | LOG (llevDebug, "Got invalid max_level from exp_table file? %s\n", buf); |
|
|
187 | } |
|
|
188 | else |
|
|
189 | { |
|
|
190 | levels = (sint64 *) calloc (settings.max_level + 1, sizeof (sint64)); |
|
|
191 | } |
|
|
192 | } |
201 | } |
193 | while (isdigit (*cp) && *cp != 0) |
202 | |
|
|
203 | lastlevel++; |
|
|
204 | |
|
|
205 | if (lastlevel > settings.max_level) |
194 | { |
206 | { |
195 | if (!settings.max_level) |
|
|
196 | { |
|
|
197 | LOG (llevError, "max_level is not set in exp_table file. Did you remember to update it?\n"); |
|
|
198 | exit (1); |
|
|
199 | } |
|
|
200 | |
|
|
201 | tmpexp = atoll (cp); |
|
|
202 | /* Do some sanity checking - if value is bogus, just exit because |
|
|
203 | * the table otherwise is probably in an inconsistent state |
|
|
204 | */ |
|
|
205 | if (tmpexp <= lastexp) |
|
|
206 | { |
|
|
207 | #ifndef WIN32 |
|
|
208 | LOG (llevError, "Experience for level %d is lower than previous level (%lld <= %lld)\n", lastlevel + 1, tmpexp, lastexp); |
|
|
209 | #else |
|
|
210 | LOG (llevError, "Experience for level %d is lower than previous level (%I64d <= %I64d)\n", lastlevel + 1, tmpexp, lastexp); |
|
|
211 | #endif |
|
|
212 | exit (1); |
|
|
213 | } |
|
|
214 | lastlevel++; |
|
|
215 | if (lastlevel > settings.max_level) |
|
|
216 | { |
|
|
217 | LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level); |
207 | LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level); |
218 | exit (1); |
208 | exit (1); |
219 | } |
|
|
220 | levels[lastlevel] = tmpexp; |
|
|
221 | lastexp = tmpexp; |
|
|
222 | /* First, skip over the number we just processed. Then skip over |
|
|
223 | * any spaces, commas, etc. |
|
|
224 | */ |
|
|
225 | while (isdigit (*cp) && *cp != 0) |
|
|
226 | cp++; |
|
|
227 | while (!isdigit (*cp) && *cp != 0) |
|
|
228 | cp++; |
|
|
229 | } |
209 | } |
|
|
210 | |
|
|
211 | newlevels [lastlevel] = tmpexp; |
|
|
212 | lastexp = tmpexp; |
230 | } |
213 | } |
231 | close_and_delete (fp, comp); |
214 | |
232 | if (lastlevel != settings.max_level && lastlevel != 0) |
215 | if (lastlevel != settings.max_level && lastlevel != 0) |
233 | { |
216 | { |
234 | LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel); |
217 | LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel); |
235 | exit (1); |
218 | return; |
236 | } |
|
|
237 | } |
|
|
238 | |
|
|
239 | /* Dump the table - useful in terms of debugging to make sure the |
|
|
240 | * format of the exp_table is correct. |
|
|
241 | */ |
|
|
242 | |
|
|
243 | void |
|
|
244 | dump_experience () |
|
|
245 | { |
|
|
246 | int i; |
|
|
247 | |
|
|
248 | for (i = 1; i <= settings.max_level; i++) |
|
|
249 | { |
219 | } |
250 | fprintf (logfile, "%4d %20lld\n", i, (long long) levels[i]); |
220 | |
251 | } |
221 | memcpy (levels, newlevels, sizeof (levels)); |
252 | exit (0); |
|
|
253 | } |
222 | } |
|
|
223 | |