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