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.15 by root, Mon May 28 21:21:40 2007 UTC vs.
Revision 1.39 by root, Tue Jan 3 11:25:30 2012 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * under the terms of the GNU General Public License as published by the Free 9 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License along 18 * You should have received a copy of the Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25#include <stdio.h> 25#include <stdio.h>
26#include <global.h> 26#include <global.h>
27 27
28sint64 *levels; 28sint64 levels[MAXNUMLEVELS];
29 29
30float exp_att_mult[NROFATTACKS + 2] = { 30static const float exp_att_mult[NROFATTACKS + 2] = {
31 0.0, /* AT_PHYSICAL */ 31 0.0, /* AT_PHYSICAL */
32 0.0, /* AT_MAGIC */ 32 0.0, /* AT_MAGIC */
33 0.0, /* AT_FIRE */ 33 0.0, /* AT_FIRE */
34 0.0, /* AT_ELECTRICITY */ 34 0.0, /* AT_ELECTRICITY */
35 0.0, /* AT_COLD */ 35 0.0, /* AT_COLD */
… …
48 0.0, /* AT_DEATH */ 48 0.0, /* AT_DEATH */
49 0.0, /* AT_CHAOS */ 49 0.0, /* AT_CHAOS */
50 0.0 /* AT_COUNTERSPELL */ 50 0.0 /* AT_COUNTERSPELL */
51}; 51};
52 52
53float exp_prot_mult[NROFATTACKS + 2] = { 53static const float exp_prot_mult[NROFATTACKS + 2] = {
54 0.4, /* AT_PHYSICAL */ 54 0.4, /* AT_PHYSICAL */
55 0.5, /* AT_MAGIC */ 55 0.5, /* AT_MAGIC */
56 0.1, /* AT_FIRE */ 56 0.1, /* AT_FIRE */
57 0.1, /* AT_ELECTRICITY */ 57 0.1, /* AT_ELECTRICITY */
58 0.1, /* AT_COLD */ 58 0.1, /* AT_COLD */
… …
72 0.0, /* AT_CHAOS */ 72 0.0, /* AT_CHAOS */
73 0.0 /* AT_COUNTERSPELL */ 73 0.0 /* AT_COUNTERSPELL */
74}; 74};
75 75
76/* 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/*
77 * new_exp() is an alternative way to calculate experience based 90 * new_exp() is an alternative way to calculate experience based
78 * on the ability of a monster. 91 * on the ability of a monster.
79 * It's far from perfect, and doesn't consider everything which 92 * It's far from perfect, and doesn't consider everything which
80 * can be considered, thus it's only used in debugging. 93 * can be considered, thus it's only used in debugging.
81 * this is only used with one of the dumpflags, 94 * this is only used with one of the dumpflags,
… …
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
129int 140int
130has_ability (const object *ob) 141exp_to_level (sint64 exp)
131{ 142{
132 object *tmp; 143 for (int i = 1; i <= settings.max_level; i++)
133 144 if (levels [i] > exp)
134 for (tmp = ob->inv; tmp != NULL; tmp = tmp->below)
135 if (tmp->type == SPELL || tmp->type == SPELLBOOK)
136 return true; 145 return i - 1;
137 return false; 146
147 return settings.max_level;
148}
149
150sint64
151level_to_min_exp (int level)
152{
153 return levels [clamp (level, 0, settings.max_level)];
138} 154}
139 155
140/* This loads the experience table from the exp_table 156/* This loads the experience table from the exp_table
141 * file. This tends to exit on any errors, since it 157 * file.
142 * populates the table as it goes along, so if there
143 * are errors, the table is likely in an inconsistent
144 * state.
145 */ 158 */
146void 159void
147init_experience (void) 160reload_exp_table ()
148{ 161{
149 char buf[MAX_BUF], *cp;
150 int lastlevel = 0, comp; 162 int lastlevel = 0;
151 sint64 lastexp = -1, tmpexp; 163 sint64 lastexp = -1;
152 FILE *fp;
153 164
165 object_thawer thawer (settings.datadir, "exp_table");
154 166
155 sprintf (buf, "%s/exp_table", settings.confdir); 167 if (!thawer)
156
157 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
158 { 168 {
169 LOG (llevError, "unable to load experience table file");
159 return; 170 return;
160 } 171 }
161 while (fgets (buf, MAX_BUF - 1, fp) != NULL) 172
173 if (thawer.kw != KW_max_level)
174 {
175 thawer.parse_error ("experience table file");
176 return;
162 { 177 }
163 if (buf[0] == '#')
164 continue;
165 178
166 /* eliminate newline */ 179 thawer.get (settings.max_level);
167 if ((cp = strrchr (buf, '\n')) != NULL)
168 *cp = '\0';
169 180
170 /* Skip over empty lines */ 181 sint64 newlevels [MAXNUMLEVELS];
171 if (buf[0] == 0) 182
172 continue; 183 while (thawer.next_line ())
173 cp = buf; 184 {
174 while (isspace (*cp) && *cp != 0) 185 sint64 tmpexp;
175 cp++; 186 thawer.get (tmpexp);
176 if (!strncasecmp (cp, "max_level", 9)) 187
188 /* Do some sanity checking - if value is bogus, just exit because
189 * the table otherwise is probably in an inconsistent state
190 */
191 if (tmpexp <= lastexp)
177 { 192 {
178 if (settings.max_level) 193 LOG (llevError, "Experience for level %d is lower than previous level (%" PRId64 " <= %" PRId64 ")\n", lastlevel + 1, tmpexp, lastexp);
179 { 194 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 } 195 }
193 while (isdigit (*cp) && *cp != 0) 196
197 lastlevel++;
198
199 if (lastlevel > settings.max_level)
194 { 200 {
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 LOG (llevError, "Experience for level %d is lower than previous level (%" PRId64 " <= %" PRId64 ")\n", lastlevel + 1, tmpexp, lastexp);
208 exit (1);
209 }
210 lastlevel++;
211 if (lastlevel > settings.max_level)
212 {
213 LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level); 201 LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level);
214 exit (1); 202 exit (1);
215 }
216 levels[lastlevel] = tmpexp;
217 lastexp = tmpexp;
218 /* First, skip over the number we just processed. Then skip over
219 * any spaces, commas, etc.
220 */
221 while (isdigit (*cp) && *cp != 0)
222 cp++;
223 while (!isdigit (*cp) && *cp != 0)
224 cp++;
225 } 203 }
204
205 newlevels [lastlevel] = tmpexp;
206 lastexp = tmpexp;
226 } 207 }
227 close_and_delete (fp, comp); 208
228 if (lastlevel != settings.max_level && lastlevel != 0) 209 if (lastlevel != settings.max_level && lastlevel != 0)
229 { 210 {
230 LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel); 211 LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel);
231 exit (1); 212 return;
232 }
233}
234
235/* Dump the table - useful in terms of debugging to make sure the
236 * format of the exp_table is correct.
237 */
238
239void
240dump_experience ()
241{
242 int i;
243
244 for (i = 1; i <= settings.max_level; i++)
245 { 213 }
246 fprintf (logfile, "%4d %20lld\n", i, (long long) levels[i]); 214
247 } 215 memcpy (levels, newlevels, sizeof (levels));
248 exit (0);
249} 216}
217

Diff Legend

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