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.2 by root, Tue Aug 29 08:01:35 2006 UTC vs.
Revision 1.39 by root, Tue Jan 3 11:25:30 2012 UTC

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

Diff Legend

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