1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * 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 GNU General Public License along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | /* |
25 | /* |
26 | * General convenience functions for crossfire. |
26 | * General convenience functions for crossfire. |
27 | */ |
27 | */ |
… | |
… | |
42 | rand_gen rndm; |
42 | rand_gen rndm; |
43 | |
43 | |
44 | void |
44 | void |
45 | tausworthe_random_generator::seed (uint32_t seed) |
45 | tausworthe_random_generator::seed (uint32_t seed) |
46 | { |
46 | { |
47 | state [0] = max ( 2U, seed * 69069U); |
47 | state [0] = seed * 69069U; if (state [0] < 2U) state [0] += 2U; |
48 | state [1] = max ( 8U, state [0] * 69069U); |
48 | state [1] = state [0] * 69069U; if (state [0] < 8U) state [0] += 8U; |
49 | state [2] = max ( 16U, state [1] * 69069U); |
49 | state [2] = state [1] * 69069U; if (state [0] < 16U) state [0] += 16U; |
50 | state [3] = max (128U, state [2] * 69069U); |
50 | state [3] = state [2] * 69069U; if (state [0] < 128) state [0] += 128U; |
51 | |
51 | |
52 | for (int i = 11; --i; ) |
52 | for (int i = 11; --i; ) |
53 | operator ()(); |
53 | operator ()(); |
54 | } |
54 | } |
55 | |
55 | |
… | |
… | |
63 | |
63 | |
64 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
64 | return state [0] ^ state [1] ^ state [2] ^ state [3]; |
65 | } |
65 | } |
66 | |
66 | |
67 | uint32_t |
67 | uint32_t |
68 | tausworthe_random_generator::get_range (uint32_t r_max) |
68 | tausworthe_random_generator::get_range (uint32_t num) |
69 | { |
69 | { |
70 | return next () % r_max; |
70 | return (next () * (uint64_t)num) >> 32U; |
71 | } |
71 | } |
72 | |
72 | |
73 | // return a number within (min .. max) |
73 | // return a number within (min .. max) |
74 | int |
74 | int |
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
75 | tausworthe_random_generator::get_range (int r_min, int r_max) |
76 | { |
76 | { |
77 | return r_min + (*this) (max (r_max - r_min + 1, 1)); |
77 | return r_min + get_range (max (r_max - r_min + 1, 0)); |
78 | } |
78 | } |
79 | |
79 | |
80 | /* |
80 | /* |
81 | * The random functions here take luck into account when rolling random |
81 | * The random functions here take luck into account when rolling random |
82 | * dice or numbers. This function has less of an impact the larger the |
82 | * dice or numbers. This function has less of an impact the larger the |
… | |
… | |
95 | int |
95 | int |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
96 | random_roll (int r_min, int r_max, const object *op, int goodbad) |
97 | { |
97 | { |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
98 | int base = r_max - r_min > 1 ? 20 : 50; /* d2 and d3 are corner cases */ |
99 | |
99 | |
100 | if (r_max < 1 || r_max < r_min) |
100 | if (r_max < r_min) |
101 | { |
101 | { |
102 | LOG (llevError, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
102 | LOG (llevError | logBacktrace, "Calling random_roll with min=%d max=%d\n", r_min, r_max); |
103 | return r_min; |
103 | return r_min; |
104 | } |
104 | } |
105 | |
105 | |
106 | if (op->type == PLAYER) |
106 | if (op->type == PLAYER) |
107 | { |
107 | { |
… | |
… | |
121 | * for exp loss calculations for players changing religions. |
121 | * for exp loss calculations for players changing religions. |
122 | */ |
122 | */ |
123 | sint64 |
123 | sint64 |
124 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
124 | random_roll64 (sint64 min, sint64 max, const object *op, int goodbad) |
125 | { |
125 | { |
126 | sint64 omin, diff, luck, ran; |
|
|
127 | int base; |
|
|
128 | |
|
|
129 | omin = min; |
126 | sint64 omin = min; |
130 | diff = max - min + 1; |
127 | sint64 diff = max - min + 1; |
131 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
128 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
132 | |
129 | |
133 | if (max < 1 || diff < 1) |
130 | if (diff < 0) |
134 | { |
131 | { |
135 | LOG (llevError, "Calling random_roll with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
132 | LOG (llevError | logBacktrace, "Calling random_roll64 with min=%" PRId64 " max=%" PRId64 "\n", min, max); |
136 | return (min); /* avoids a float exception */ |
133 | return (min); /* avoids a float exception */ |
137 | } |
134 | } |
138 | |
135 | |
139 | /* |
136 | /* |
140 | * Make a call to get two 32 bit unsigned random numbers, and just to |
137 | * Make a call to get two 32 bit unsigned random numbers, and just to |
141 | * a little bitshifting. |
138 | * a little bitshifting. |
142 | */ |
139 | */ |
143 | ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
140 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
144 | |
141 | |
145 | if (op->type != PLAYER) |
142 | if (op->type != PLAYER) |
146 | return ((ran % diff) + min); |
143 | return ((ran % diff) + min); |
147 | |
144 | |
148 | luck = op->stats.luck; |
145 | int luck = op->stats.luck; |
|
|
146 | |
149 | if (rndm (base) < MIN (10, abs (luck))) |
147 | if (rndm (base) < MIN (10, abs (luck))) |
150 | { |
148 | { |
151 | /* we have a winner */ |
149 | /* we have a winner */ |
152 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
150 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
153 | diff -= luck; |
151 | diff -= luck; |
154 | if (diff < 1) |
152 | if (diff < 1) |
155 | return (omin); /*check again */ |
153 | return (omin); /*check again */ |
|
|
154 | |
156 | ((goodbad) ? (min += luck) : (diff)); |
155 | ((goodbad) ? (min += luck) : (diff)); |
157 | |
156 | |
158 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
157 | return (MAX (omin, MIN (max, (ran % diff) + min))); |
159 | } |
158 | } |
160 | |
159 | |
161 | return ((ran % diff) + min); |
160 | return ran % diff + min; |
162 | } |
161 | } |
163 | |
162 | |
164 | /* |
163 | /* |
165 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
164 | * Roll a number of dice (2d3, 4d6). Uses op to determine luck, |
166 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
165 | * If goodbad is non-zero, luck increases the roll, if zero, it decreases. |
167 | * Generally, op should be the player/caster/hitter requesting the roll, |
166 | * Generally, op should be the player/caster/hitter requesting the roll, |
168 | * not the recipient (ie, the poor slob getting hit). |
167 | * not the recipient (ie, the poor slob getting hit). |
169 | * The args are num D size (ie 4d6) [garbled 20010916] |
168 | * The args are num D size (ie 4d6) [garbled 20010916] |
170 | */ |
169 | */ |
171 | |
|
|
172 | int |
170 | int |
173 | die_roll (int num, int size, const object *op, int goodbad) |
171 | die_roll (int num, int size, const object *op, int goodbad) |
174 | { |
172 | { |
175 | int min, diff, luck, total, i, gotlucky, base; |
173 | int min, luck, total, i, gotlucky; |
176 | |
174 | |
177 | diff = size; |
175 | int diff = size; |
178 | min = 1; |
176 | min = 1; |
179 | luck = total = gotlucky = 0; |
177 | luck = total = gotlucky = 0; |
180 | ((diff > 2) ? (base = 20) : (base = 50)); /* d2 and d3 are corner cases */ |
178 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
|
|
179 | |
181 | if (size < 2 || diff < 1) |
180 | if (size < 2 || diff < 1) |
182 | { |
181 | { |
183 | LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); |
182 | LOG (llevError, "Calling die_roll with num=%d size=%d\n", num, size); |
184 | return (num); /* avoids a float exception */ |
183 | return num; /* avoids a float exception */ |
185 | } |
184 | } |
186 | |
185 | |
187 | if (op->type == PLAYER) |
186 | if (op->type == PLAYER) |
188 | luck = op->stats.luck; |
187 | luck = op->stats.luck; |
189 | |
188 | |
… | |
… | |
205 | } |
204 | } |
206 | |
205 | |
207 | return total; |
206 | return total; |
208 | } |
207 | } |
209 | |
208 | |
210 | /* decay and destroy perishable items in a map */ |
|
|
211 | void |
|
|
212 | maptile::decay_objects () |
|
|
213 | { |
|
|
214 | if (!spaces) |
|
|
215 | return; |
|
|
216 | |
|
|
217 | for (mapspace *ms = spaces + size (); ms-- > spaces; ) |
|
|
218 | for (object *above, *op = ms->bot; op; op = above) |
|
|
219 | { |
|
|
220 | above = op->above; |
|
|
221 | |
|
|
222 | bool destroy = 0; |
|
|
223 | |
|
|
224 | // do not decay anything above unique floor tiles (yet :) |
|
|
225 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) |
|
|
226 | break; |
|
|
227 | |
|
|
228 | if (QUERY_FLAG (op, FLAG_IS_FLOOR) |
|
|
229 | || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) |
|
|
230 | || QUERY_FLAG (op, FLAG_OBJ_SAVE_ON_OVL) |
|
|
231 | || QUERY_FLAG (op, FLAG_UNIQUE) |
|
|
232 | || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR) |
|
|
233 | || QUERY_FLAG (op, FLAG_UNPAID) |
|
|
234 | || op->is_alive ()) |
|
|
235 | ; // do not decay |
|
|
236 | else if (op->is_weapon ()) |
|
|
237 | { |
|
|
238 | op->stats.dam--; |
|
|
239 | if (op->stats.dam < 0) |
|
|
240 | destroy = 1; |
|
|
241 | } |
|
|
242 | else if (op->is_armor ()) |
|
|
243 | { |
|
|
244 | op->stats.ac--; |
|
|
245 | if (op->stats.ac < 0) |
|
|
246 | destroy = 1; |
|
|
247 | } |
|
|
248 | else if (op->type == FOOD) |
|
|
249 | { |
|
|
250 | op->stats.food -= rndm (5, 20); |
|
|
251 | if (op->stats.food < 0) |
|
|
252 | destroy = 1; |
|
|
253 | } |
|
|
254 | else |
|
|
255 | { |
|
|
256 | int mat = op->materials; |
|
|
257 | |
|
|
258 | if (mat & M_PAPER |
|
|
259 | || mat & M_LEATHER |
|
|
260 | || mat & M_WOOD |
|
|
261 | || mat & M_ORGANIC |
|
|
262 | || mat & M_CLOTH |
|
|
263 | || mat & M_LIQUID |
|
|
264 | || (mat & M_IRON && rndm (1, 5) == 1) |
|
|
265 | || (mat & M_GLASS && rndm (1, 2) == 1) |
|
|
266 | || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) |
|
|
267 | || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) |
|
|
268 | || (mat & M_ICE && temp > 32)) |
|
|
269 | destroy = 1; |
|
|
270 | } |
|
|
271 | |
|
|
272 | /* adjust overall chance below */ |
|
|
273 | if (destroy && rndm (0, 1)) |
|
|
274 | op->destroy (); |
|
|
275 | } |
|
|
276 | } |
|
|
277 | |
|
|
278 | /* convert materialname to materialtype_t */ |
209 | /* convert materialname to materialtype_t */ |
279 | |
210 | |
280 | materialtype_t * |
211 | materialtype_t * |
281 | name_to_material (const shstr &name) |
212 | name_to_material (const shstr &name) |
282 | { |
213 | { |
… | |
… | |
307 | return; |
238 | return; |
308 | |
239 | |
309 | mt = name_to_material (op->materialname); |
240 | mt = name_to_material (op->materialname); |
310 | if (!mt) |
241 | if (!mt) |
311 | { |
242 | { |
312 | LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->name, &op->name, &op->materialname); |
243 | LOG (llevError, "archetype '%s>%s' uses nonexistent material '%s'\n", &op->arch->archname, &op->name, &op->materialname); |
313 | return; |
244 | return; |
314 | } |
245 | } |
315 | |
246 | |
316 | for (j = 0; j < NROFATTACKS; j++) |
247 | for (j = 0; j < NROFATTACKS; j++) |
317 | if (op->resist[j] == 0 && change->resist[j] != 0) |
248 | if (op->resist[j] == 0 && change->resist[j] != 0) |
… | |
… | |
553 | fork_abort (const char *msg) |
484 | fork_abort (const char *msg) |
554 | { |
485 | { |
555 | if (!fork ()) |
486 | if (!fork ()) |
556 | { |
487 | { |
557 | signal (SIGABRT, SIG_DFL); |
488 | signal (SIGABRT, SIG_DFL); |
|
|
489 | // try to put corefiles into a subdirectory, if existing, to allow |
|
|
490 | // an administrator to reduce the I/O load. |
|
|
491 | chdir ("cores"); |
558 | abort (); |
492 | abort (); |
559 | } |
493 | } |
560 | |
494 | |
561 | LOG (llevError, "fork abort: %s\n", msg); |
495 | LOG (llevError, "fork abort: %s\n", msg); |
562 | } |
496 | } |
… | |
… | |
607 | memcpy (dst + maxlen - 4, "...", 4); |
541 | memcpy (dst + maxlen - 4, "...", 4); |
608 | } |
542 | } |
609 | } |
543 | } |
610 | else |
544 | else |
611 | memcpy (dst, src, len + 1); |
545 | memcpy (dst, src, len + 1); |
|
|
546 | } |
|
|
547 | |
|
|
548 | const std::string |
|
|
549 | format (const char *format, ...) |
|
|
550 | { |
|
|
551 | int len; |
|
|
552 | |
|
|
553 | { |
|
|
554 | char buf[128]; |
|
|
555 | |
|
|
556 | va_list ap; |
|
|
557 | va_start (ap, format); |
|
|
558 | len = vsnprintf (buf, sizeof (buf), format, ap); |
|
|
559 | va_end (ap); |
|
|
560 | |
|
|
561 | assert (len >= 0); // shield againstz broken vsnprintf's |
|
|
562 | |
|
|
563 | // was our static buffer short enough? |
|
|
564 | if (len < sizeof (buf)) |
|
|
565 | return std::string (buf, len); |
|
|
566 | } |
|
|
567 | |
|
|
568 | { |
|
|
569 | // longer, try harder |
|
|
570 | char *buf = salloc<char> (len + 1); |
|
|
571 | |
|
|
572 | va_list ap; |
|
|
573 | va_start (ap, format); |
|
|
574 | vsnprintf (buf, len + 1, format, ap); |
|
|
575 | va_end (ap); |
|
|
576 | |
|
|
577 | const std::string s (buf, len); |
|
|
578 | sfree<char> (buf, len + 1); |
|
|
579 | |
|
|
580 | return buf; |
|
|
581 | } |
612 | } |
582 | } |
613 | |
583 | |
614 | tstamp now () |
584 | tstamp now () |
615 | { |
585 | { |
616 | struct timeval tv; |
586 | struct timeval tv; |