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.11 by pippijn, Mon Jan 15 21:06:18 2007 UTC vs.
Revision 1.44 by root, Thu Nov 22 00:40:12 2018 UTC

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

Diff Legend

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