1 |
elmex |
1.1 |
/* |
2 |
|
|
* static char *rcsid_arch_c = |
3 |
|
|
* "$Id$"; |
4 |
|
|
*/ |
5 |
|
|
|
6 |
|
|
/* |
7 |
|
|
CrossFire, A Multiplayer game for X-windows |
8 |
|
|
|
9 |
|
|
Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
10 |
|
|
Copyright (C) 1992 Frank Tore Johansen |
11 |
|
|
|
12 |
|
|
This program is free software; you can redistribute it and/or modify |
13 |
|
|
it under the terms of the GNU General Public License as published by |
14 |
|
|
the Free Software Foundation; either version 2 of the License, or |
15 |
|
|
(at your option) any later version. |
16 |
|
|
|
17 |
|
|
This program is distributed in the hope that it will be useful, |
18 |
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
19 |
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
20 |
|
|
GNU General Public License for more details. |
21 |
|
|
|
22 |
|
|
You should have received a copy of the GNU General Public License |
23 |
|
|
along with this program; if not, write to the Free Software |
24 |
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
25 |
|
|
|
26 |
|
|
The authors can be reached via e-mail at crossfire-devel@real-time.com |
27 |
|
|
*/ |
28 |
|
|
|
29 |
|
|
#include <stdio.h> |
30 |
|
|
#include <global.h> |
31 |
|
|
|
32 |
|
|
sint64 *levels; |
33 |
|
|
|
34 |
|
|
#define TRUE 1 |
35 |
|
|
#define FALSE 0 |
36 |
|
|
|
37 |
|
|
float exp_att_mult[NROFATTACKS+2] = { |
38 |
|
|
0.0, /* AT_PHYSICAL */ |
39 |
|
|
0.0, /* AT_MAGIC */ |
40 |
|
|
0.0, /* AT_FIRE */ |
41 |
|
|
0.0, /* AT_ELECTRICITY */ |
42 |
|
|
0.0, /* AT_COLD */ |
43 |
|
|
0.0, /* AT_WATER *//*AT_CONFUSION!*/ |
44 |
|
|
0.4, /* AT_ACID */ |
45 |
|
|
1.5, /* AT_DRAIN */ |
46 |
|
|
0.0, /* AT_WEAPONMAGIC */ |
47 |
|
|
0.1, /* AT_GHOSTHIT */ |
48 |
|
|
0.3, /* AT_POISON */ |
49 |
|
|
0.2, /* AT_DISEASE */ |
50 |
|
|
0.3, /* AT_PARALYZE */ |
51 |
|
|
0.0, /* AT_TURN_UNDEAD */ |
52 |
|
|
0.0, /* AT_FEAR */ |
53 |
|
|
0.0, /* AT_CANCELLATION */ |
54 |
|
|
0.0, /* AT_DEPLETE */ |
55 |
|
|
0.0, /* AT_DEATH */ |
56 |
|
|
0.0, /* AT_CHAOS */ |
57 |
|
|
0.0 /* AT_COUNTERSPELL */ |
58 |
|
|
}; |
59 |
|
|
|
60 |
|
|
float exp_prot_mult[NROFATTACKS+2] = { |
61 |
|
|
0.4, /* AT_PHYSICAL */ |
62 |
|
|
0.5, /* AT_MAGIC */ |
63 |
|
|
0.1, /* AT_FIRE */ |
64 |
|
|
0.1, /* AT_ELECTRICITY */ |
65 |
|
|
0.1, /* AT_COLD */ |
66 |
|
|
0.1, /* AT_WATER */ |
67 |
|
|
0.1, /* AT_ACID */ |
68 |
|
|
0.1, /* AT_DRAIN */ |
69 |
|
|
0.1, /* AT_WEAPONMAGIC */ |
70 |
|
|
0.1, /* AT_GHOSTHIT */ |
71 |
|
|
0.1, /* AT_POISON */ |
72 |
|
|
0.1, /* AT_DISEASE */ |
73 |
|
|
0.1, /* AT_PARALYZE */ |
74 |
|
|
0.1, /* AT_TURN_UNDEAD */ |
75 |
|
|
0.1, /* AT_FEAR */ |
76 |
|
|
0.0, /* AT_CANCELLATION */ |
77 |
|
|
0.0, /* AT_DEPLETE */ |
78 |
|
|
0.0, /* AT_DEATH */ |
79 |
|
|
0.0, /* AT_CHAOS */ |
80 |
|
|
0.0 /* AT_COUNTERSPELL */ |
81 |
|
|
|
82 |
|
|
}; |
83 |
|
|
|
84 |
|
|
/* |
85 |
|
|
* new_exp() is an alternative way to calculate experience based |
86 |
|
|
* on the ability of a monster. |
87 |
|
|
* It's far from perfect, and doesn't consider everything which |
88 |
|
|
* can be considered, thus it's only used in debugging. |
89 |
|
|
* this is only used with one of the dumpflags, |
90 |
|
|
* and not anyplace in the code. |
91 |
|
|
*/ |
92 |
|
|
|
93 |
|
|
int new_exp(const object *ob) { |
94 |
|
|
double att_mult, prot_mult, spec_mult; |
95 |
|
|
double exp; |
96 |
|
|
int i; |
97 |
|
|
long mask = 1; |
98 |
|
|
|
99 |
|
|
att_mult = prot_mult =spec_mult = 1.0; |
100 |
|
|
for(i=0;i<NROFATTACKS;i++) { |
101 |
|
|
mask = 1<<i; |
102 |
|
|
att_mult += (exp_att_mult[i] * ((ob->attacktype&mask) != FALSE)); |
103 |
|
|
/* We multiply & then divide to prevent roundoffs on the floats. |
104 |
|
|
* the doubling is to take into account the table and resistances |
105 |
|
|
* are lower than they once were. |
106 |
|
|
*/ |
107 |
|
|
prot_mult += (exp_prot_mult[i] * 200*ob->resist[i]) / 100.0; |
108 |
|
|
} |
109 |
|
|
spec_mult += (0.3*(QUERY_FLAG(ob,FLAG_SEE_INVISIBLE)!= FALSE)) + |
110 |
|
|
(0.5*(QUERY_FLAG(ob,FLAG_SPLITTING)!= FALSE))+ |
111 |
|
|
(0.3*(QUERY_FLAG(ob,FLAG_HITBACK)!= FALSE)) + |
112 |
|
|
(0.1*(QUERY_FLAG(ob,FLAG_REFL_MISSILE)!= FALSE)) + |
113 |
|
|
(0.3*(QUERY_FLAG(ob,FLAG_REFL_SPELL)!= FALSE)) + |
114 |
|
|
(1.0*(QUERY_FLAG(ob,FLAG_NO_MAGIC)!= FALSE)) + |
115 |
|
|
(0.1*(QUERY_FLAG(ob,FLAG_PICK_UP)!= FALSE)) + |
116 |
|
|
(0.1*(QUERY_FLAG(ob,FLAG_USE_SCROLL)!= FALSE)) + |
117 |
|
|
(0.2*(QUERY_FLAG(ob,FLAG_USE_RANGE)!= FALSE)) + |
118 |
|
|
(0.1*(QUERY_FLAG(ob,FLAG_USE_BOW)!= FALSE)); |
119 |
|
|
|
120 |
|
|
exp = (ob->stats.maxhp<5) ? 5 : ob->stats.maxhp; |
121 |
|
|
exp *= (QUERY_FLAG(ob,FLAG_CAST_SPELL) && has_ability(ob)) |
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; |
124 |
|
|
exp *= att_mult * prot_mult * spec_mult; |
125 |
|
|
exp *= 2.0/(2.0-((FABS(ob->speed)<0.95)?FABS(ob->speed):0.95)); |
126 |
|
|
exp *= (20.0+ob->stats.Con)/20.0; |
127 |
|
|
if (QUERY_FLAG(ob, FLAG_STAND_STILL)) |
128 |
|
|
exp /= 2; |
129 |
|
|
|
130 |
|
|
return (int) exp; |
131 |
|
|
} |
132 |
|
|
|
133 |
|
|
/* |
134 |
|
|
* Returns true if the monster specified has any innate abilities. |
135 |
|
|
*/ |
136 |
|
|
|
137 |
|
|
int has_ability(const object *ob) { |
138 |
|
|
object *tmp; |
139 |
|
|
|
140 |
|
|
for(tmp=ob->inv;tmp!=NULL;tmp=tmp->below) |
141 |
|
|
if(tmp->type==SPELL||tmp->type==SPELLBOOK) |
142 |
|
|
return TRUE; |
143 |
|
|
return FALSE; |
144 |
|
|
} |
145 |
|
|
|
146 |
|
|
/* This loads the experience table from the exp_table |
147 |
|
|
* file. This tends to exit on any errors, since it |
148 |
|
|
* populates the table as it goes along, so if there |
149 |
|
|
* are errors, the table is likely in an inconsistent |
150 |
|
|
* state. |
151 |
|
|
*/ |
152 |
|
|
void init_experience(void) |
153 |
|
|
{ |
154 |
|
|
char buf[MAX_BUF], *cp; |
155 |
|
|
int lastlevel=0, comp; |
156 |
|
|
sint64 lastexp=-1, tmpexp; |
157 |
|
|
FILE *fp; |
158 |
|
|
|
159 |
|
|
|
160 |
|
|
sprintf(buf,"%s/exp_table",settings.confdir); |
161 |
|
|
|
162 |
|
|
if ((fp = open_and_uncompress(buf, 0, &comp)) == NULL) { |
163 |
|
|
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 |
|
|
} |
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 |
|
|
|
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++; |
208 |
|
|
if (lastlevel > settings.max_level) { |
209 |
|
|
LOG(llevError,"Too many levels specified in table (%d > %d)\n", |
210 |
|
|
lastlevel, settings.max_level); |
211 |
|
|
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 |
|
|
} |
221 |
|
|
} |
222 |
|
|
close_and_delete(fp, comp); |
223 |
|
|
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 |
|
|
} |
228 |
|
|
} |
229 |
|
|
|
230 |
|
|
/* Dump the table - useful in terms of debugging to make sure the |
231 |
|
|
* format of the exp_table is correct. |
232 |
|
|
*/ |
233 |
|
|
|
234 |
|
|
void 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 |
|
|
} |