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

Diff Legend

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