ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/exp.C
(Generate patch)

Comparing deliantra/server/common/exp.C (file contents):
Revision 1.5 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.34 by root, Wed Apr 28 20:51:58 2010 UTC

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

Diff Legend

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