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.18 by root, Tue Apr 15 03:16:02 2008 UTC vs.
Revision 1.36 by root, Thu May 6 22:35:41 2010 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 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 * Deliantra is free software: you can redistribute it and/or modify 8 * 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 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License 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 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 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
27sint64 *levels; 28sint64 levels[MAXNUMLEVELS];
28 29
29float exp_att_mult[NROFATTACKS + 2] = { 30static 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
52float exp_prot_mult[NROFATTACKS + 2] = { 53static 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 */
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/*
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,
… …
97 * the doubling is to take into account the table and resistances 111 * the doubling is to take into account the table and resistances
98 * are lower than they once were. 112 * are lower than they once were.
99 */ 113 */
100 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;
101 } 115 }
116
102 spec_mult += (0.3 * (QUERY_FLAG (ob, FLAG_SEE_INVISIBLE) != 0)) + 117 spec_mult += (0.3 * (ob->flag [FLAG_SEE_INVISIBLE] != 0)) +
103 (0.5 * (QUERY_FLAG (ob, FLAG_SPLITTING) != 0)) + 118 (0.5 * (ob->flag [FLAG_SPLITTING] != 0)) +
104 (0.3 * (QUERY_FLAG (ob, FLAG_HITBACK) != 0)) + 119 (0.3 * (ob->flag [FLAG_HITBACK] != 0)) +
105 (0.1 * (QUERY_FLAG (ob, FLAG_REFL_MISSILE) != 0)) + 120 (0.1 * (ob->flag [FLAG_REFL_MISSILE] != 0)) +
106 (0.3 * (QUERY_FLAG (ob, FLAG_REFL_SPELL) != 0)) + 121 (0.3 * (ob->flag [FLAG_REFL_SPELL] != 0)) +
107 (1.0 * (QUERY_FLAG (ob, FLAG_NO_MAGIC) != 0)) + 122 (1.0 * (ob->flag [FLAG_NO_MAGIC] != 0)) +
108 (0.1 * (QUERY_FLAG (ob, FLAG_PICK_UP) != 0)) + 123 (0.1 * (ob->flag [FLAG_PICK_UP] != 0)) +
109 (0.1 * (QUERY_FLAG (ob, FLAG_USE_SCROLL) != 0)) + 124 (0.1 * (ob->flag [FLAG_USE_SCROLL] != 0)) +
110 (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));
111 126
112 exp = (ob->stats.maxhp < 5) ? 5 : ob->stats.maxhp; 127 exp = (ob->stats.maxhp < 5) ? 5 : ob->stats.maxhp;
113 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;
114 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;
115 exp *= att_mult * prot_mult * spec_mult; 130 exp *= att_mult * prot_mult * spec_mult;
116 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));
117 exp *= (20.0 + ob->stats.Con) / 20.0; 132 exp *= (20.0 + ob->stats.Con) / 20.0;
118 if (QUERY_FLAG (ob, FLAG_STAND_STILL)) 133 if (ob->flag [FLAG_STAND_STILL])
119 exp /= 2; 134 exp /= 2;
120 135
121 return (int) exp; 136 return exp;
122} 137}
123 138
124/* 139//TODO: binary search...
125 * Returns true if the monster specified has any innate abilities.
126 */
127
128int 140int
129has_ability (const object *ob) 141exp_to_level (sint64 exp)
130{ 142{
131 object *tmp; 143 for (int i = 1; i <= settings.max_level; i++)
144 if (levels [i] > exp)
145 return i - 1;
132 146
133 for (tmp = ob->inv; tmp != NULL; tmp = tmp->below) 147 return settings.max_level;
134 if (tmp->type == SPELL || tmp->type == SPELLBOOK) 148}
149
150sint64
151level_to_min_exp (int level)
152{
153 if (level <= 0)
135 return true; 154 return 0;
136 return false; 155 else
156 return levels [min (level, settings.max_level)];
137} 157}
138 158
139/* This loads the experience table from the exp_table 159/* This loads the experience table from the exp_table
140 * file. This tends to exit on any errors, since it 160 * file.
141 * populates the table as it goes along, so if there
142 * are errors, the table is likely in an inconsistent
143 * state.
144 */ 161 */
145void 162void
146init_experience (void) 163reload_exp_table ()
147{ 164{
148 char buf[MAX_BUF], *cp;
149 int lastlevel = 0, comp; 165 int lastlevel = 0;
150 sint64 lastexp = -1, tmpexp; 166 sint64 lastexp = -1;
151 FILE *fp;
152 167
168 object_thawer thawer (settings.datadir, "exp_table");
153 169
154 sprintf (buf, "%s/exp_table", settings.confdir); 170 if (!thawer)
155
156 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
157 { 171 {
172 LOG (llevError, "unable to load experience table file");
158 return; 173 return;
159 } 174 }
160 while (fgets (buf, MAX_BUF - 1, fp) != NULL) 175
176 if (thawer.kw != KW_max_level)
177 {
178 thawer.parse_error ("experience table file");
179 return;
161 { 180 }
162 if (buf[0] == '#')
163 continue;
164 181
165 /* eliminate newline */ 182 thawer.get (settings.max_level);
166 if ((cp = strrchr (buf, '\n')) != NULL)
167 *cp = '\0';
168 183
169 /* Skip over empty lines */ 184 sint64 newlevels [MAXNUMLEVELS];
170 if (buf[0] == 0) 185
171 continue; 186 while (thawer.next_line ())
172 cp = buf; 187 {
173 while (isspace (*cp) && *cp != 0) 188 sint64 tmpexp;
174 cp++; 189 thawer.get (tmpexp);
175 if (!strncasecmp (cp, "max_level", 9)) 190
191 /* Do some sanity checking - if value is bogus, just exit because
192 * the table otherwise is probably in an inconsistent state
193 */
194 if (tmpexp <= lastexp)
176 { 195 {
177 if (settings.max_level) 196 LOG (llevError, "Experience for level %d is lower than previous level (%" PRId64 " <= %" PRId64 ")\n", lastlevel + 1, tmpexp, lastexp);
178 { 197 return;
179 LOG (llevDebug, "Got more than one max_level value from exp_table file?\n");
180 free (levels);
181 }
182 settings.max_level = atoi (cp + 9);
183 if (!settings.max_level)
184 {
185 LOG (llevDebug, "Got invalid max_level from exp_table file? %s\n", buf);
186 }
187 else
188 {
189 levels = (sint64 *) calloc (settings.max_level + 1, sizeof (sint64));
190 }
191 } 198 }
192 while (isdigit (*cp) && *cp != 0) 199
200 lastlevel++;
201
202 if (lastlevel > settings.max_level)
193 { 203 {
194 if (!settings.max_level)
195 {
196 LOG (llevError, "max_level is not set in exp_table file. Did you remember to update it?\n");
197 exit (1);
198 }
199
200 tmpexp = atoll (cp);
201 /* Do some sanity checking - if value is bogus, just exit because
202 * the table otherwise is probably in an inconsistent state
203 */
204 if (tmpexp <= lastexp)
205 {
206 LOG (llevError, "Experience for level %d is lower than previous level (%" PRId64 " <= %" PRId64 ")\n", lastlevel + 1, tmpexp, lastexp);
207 exit (1);
208 }
209 lastlevel++;
210 if (lastlevel > settings.max_level)
211 {
212 LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level); 204 LOG (llevError, "Too many levels specified in table (%d > %d)\n", lastlevel, settings.max_level);
213 exit (1); 205 exit (1);
214 }
215 levels[lastlevel] = tmpexp;
216 lastexp = tmpexp;
217 /* First, skip over the number we just processed. Then skip over
218 * any spaces, commas, etc.
219 */
220 while (isdigit (*cp) && *cp != 0)
221 cp++;
222 while (!isdigit (*cp) && *cp != 0)
223 cp++;
224 } 206 }
207
208 newlevels [lastlevel] = tmpexp;
209 lastexp = tmpexp;
225 } 210 }
226 close_and_delete (fp, comp); 211
227 if (lastlevel != settings.max_level && lastlevel != 0) 212 if (lastlevel != settings.max_level && lastlevel != 0)
228 { 213 {
229 LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel); 214 LOG (llevError, "Warning: exp_table does not have %d entries (%d)\n", settings.max_level, lastlevel);
230 exit (1); 215 return;
231 } 216 }
232}
233 217
218 memcpy (levels, newlevels, sizeof (levels));
219}
220

Diff Legend

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