1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
57 | return 0; |
57 | return 0; |
58 | } |
58 | } |
59 | |
59 | |
60 | ///////////////////////////////////////////////////////////////////////////// |
60 | ///////////////////////////////////////////////////////////////////////////// |
61 | |
61 | |
62 | static const char *const fatalmsgs[80] = { |
|
|
63 | "Failed to allocate memory", |
|
|
64 | "Failed repeatedly to load maps", |
|
|
65 | "Hashtable for archetypes is too small", |
|
|
66 | "Too many errors" |
|
|
67 | }; |
|
|
68 | |
|
|
69 | /* |
62 | /* |
70 | * fatal() is meant to be called whenever a fatal signal is intercepted. |
63 | * fatal() is meant to be called whenever a fatal signal is intercepted. |
71 | * It will call the emergency_save and the clean_tmp_files functions. |
64 | * It will call the emergency_save and the clean_tmp_files functions. |
72 | */ |
65 | */ |
|
|
66 | //TODO: only one caller left |
73 | void |
67 | void |
74 | fatal (int err) |
68 | fatal (const char *msg) |
75 | { |
69 | { |
76 | LOG (llevError, "Fatal: %s\n", fatalmsgs [err]); |
70 | LOG (llevError, "FATAL: %s\n", msg); |
77 | cleanup (fatalmsgs[err], 1); |
71 | cleanup (msg, 1); |
78 | } |
72 | } |
79 | |
73 | |
80 | ///////////////////////////////////////////////////////////////////////////// |
74 | ///////////////////////////////////////////////////////////////////////////// |
81 | |
75 | |
82 | /* |
76 | /* |
… | |
… | |
124 | sint64 omin = r_min; |
118 | sint64 omin = r_min; |
125 | sint64 range = max (0, r_max - r_min + 1); |
119 | sint64 range = max (0, r_max - r_min + 1); |
126 | int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
120 | int base = range > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
127 | |
121 | |
128 | /* |
122 | /* |
129 | * Make a call to get two 32 bit unsigned random numbers, and just to |
123 | * Make a call to get two 32 bit unsigned random numbers, and just do |
130 | * a little bitshifting. |
124 | * a little bitshifting. |
131 | */ |
125 | */ |
132 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
126 | sint64 ran = (sint64) rndm.next () ^ ((sint64) rndm.next () << 31); |
133 | |
127 | |
134 | if (op->type != PLAYER) |
128 | if (op->stats.luck) |
135 | return ((ran % range) + r_min); |
129 | { |
136 | |
|
|
137 | int luck = op->stats.luck; |
130 | int luck = op->stats.luck; |
138 | |
131 | |
139 | if (rndm (base) < min (10, abs (luck))) |
132 | if (rndm (base) < min (10, abs (luck))) |
140 | { |
133 | { |
141 | /* we have a winner */ |
134 | /* we have a winner */ |
142 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
135 | luck = luck > 0 ? 1 : -1; |
|
|
136 | |
143 | range -= luck; |
137 | range -= luck; |
144 | if (range < 1) |
138 | if (range < 1) |
145 | return (omin); /*check again */ |
139 | return omin; /*check again */ |
146 | |
140 | |
147 | ((goodbad) ? (r_min += luck) : (range)); |
141 | if (goodbad) |
|
|
142 | r_min += luck; |
148 | |
143 | |
149 | return (max (omin, min (r_max, (ran % range) + r_min))); |
144 | return (max (omin, min (r_max, (ran % range) + r_min))); |
|
|
145 | } |
150 | } |
146 | } |
151 | |
147 | |
152 | return ran % range + r_min; |
148 | return ran % range + r_min; |
153 | } |
149 | } |
154 | |
150 | |
… | |
… | |
160 | * The args are num D size (ie 4d6) [garbled 20010916] |
156 | * The args are num D size (ie 4d6) [garbled 20010916] |
161 | */ |
157 | */ |
162 | int |
158 | int |
163 | die_roll (int num, int size, const object *op, int goodbad) |
159 | die_roll (int num, int size, const object *op, int goodbad) |
164 | { |
160 | { |
165 | int min, luck, total, i, gotlucky; |
161 | int min_roll, luck, total, i, gotlucky; |
166 | |
162 | |
167 | int diff = size; |
163 | int diff = size; |
168 | min = 1; |
164 | min_roll = 1; |
169 | luck = total = gotlucky = 0; |
165 | luck = total = gotlucky = 0; |
170 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
166 | int base = diff > 2 ? 20 : 50; /* d2 and d3 are corner cases */ |
171 | |
167 | |
172 | if (size < 2 || diff < 1) |
168 | if (size < 2 || diff < 1) |
173 | { |
169 | { |
… | |
… | |
178 | if (op->type == PLAYER) |
174 | if (op->type == PLAYER) |
179 | luck = op->stats.luck; |
175 | luck = op->stats.luck; |
180 | |
176 | |
181 | for (i = 0; i < num; i++) |
177 | for (i = 0; i < num; i++) |
182 | { |
178 | { |
183 | if (rndm (base) < MIN (10, abs (luck)) && !gotlucky) |
179 | if (rndm (base) < min (10, abs (luck)) && !gotlucky) |
184 | { |
180 | { |
185 | /* we have a winner */ |
181 | /* we have a winner */ |
186 | gotlucky++; |
182 | gotlucky++; |
187 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
183 | ((luck > 0) ? (luck = 1) : (luck = -1)); |
188 | diff -= luck; |
184 | diff -= luck; |
189 | if (diff < 1) |
185 | if (diff < 1) |
190 | return (num); /*check again */ |
186 | return (num); /*check again */ |
191 | ((goodbad) ? (min += luck) : (diff)); |
187 | ((goodbad) ? (min_roll += luck) : (diff)); |
192 | total += MAX (1, MIN (size, rndm (diff) + min)); |
188 | total += max (1, min (size, rndm (diff) + min_roll)); |
193 | } |
189 | } |
194 | else |
190 | else |
195 | total += rndm (size) + 1; |
191 | total += rndm (size) + 1; |
196 | } |
192 | } |
197 | |
193 | |
… | |
… | |
314 | path = path_combine (src, dst); |
310 | path = path_combine (src, dst); |
315 | path_normalize (path); |
311 | path_normalize (path); |
316 | return (path); |
312 | return (path); |
317 | } |
313 | } |
318 | |
314 | |
319 | /** |
|
|
320 | * open_and_uncompress() first searches for the original filename. If it exist, |
|
|
321 | * then it opens it and returns the file-pointer. |
|
|
322 | */ |
|
|
323 | FILE * |
|
|
324 | open_and_uncompress (const char *name, int flag, int *compressed) |
|
|
325 | { |
|
|
326 | *compressed = 0; |
|
|
327 | return fopen (name, "r"); |
|
|
328 | } |
|
|
329 | |
|
|
330 | /* |
|
|
331 | * See open_and_uncompress(). |
|
|
332 | */ |
|
|
333 | |
|
|
334 | void |
|
|
335 | close_and_delete (FILE * fp, int compressed) |
|
|
336 | { |
|
|
337 | fclose (fp); |
|
|
338 | } |
|
|
339 | |
|
|
340 | /* |
|
|
341 | * Strip out the media tags from a String. |
|
|
342 | * Warning the input string will contain the result string |
|
|
343 | */ |
|
|
344 | void |
|
|
345 | strip_media_tag (char *message) |
|
|
346 | { |
|
|
347 | int in_tag = 0; |
|
|
348 | char *dest; |
|
|
349 | char *src; |
|
|
350 | |
|
|
351 | src = dest = message; |
|
|
352 | while (*src != '\0') |
|
|
353 | { |
|
|
354 | if (*src == '[') |
|
|
355 | { |
|
|
356 | in_tag = 1; |
|
|
357 | } |
|
|
358 | else if (in_tag && (*src == ']')) |
|
|
359 | in_tag = 0; |
|
|
360 | else if (!in_tag) |
|
|
361 | { |
|
|
362 | *dest = *src; |
|
|
363 | dest++; |
|
|
364 | } |
|
|
365 | src++; |
|
|
366 | } |
|
|
367 | *dest = '\0'; |
|
|
368 | } |
|
|
369 | |
|
|
370 | const char * |
|
|
371 | strrstr (const char *haystack, const char *needle) |
|
|
372 | { |
|
|
373 | const char *lastneedle; |
|
|
374 | |
|
|
375 | lastneedle = NULL; |
|
|
376 | while ((haystack = strstr (haystack, needle)) != NULL) |
|
|
377 | { |
|
|
378 | lastneedle = haystack; |
|
|
379 | haystack++; |
|
|
380 | } |
|
|
381 | return lastneedle; |
|
|
382 | |
|
|
383 | } |
|
|
384 | |
|
|
385 | #define EOL_SIZE (sizeof("\n")-1) |
315 | #define EOL_SIZE (sizeof("\n")-1) |
386 | void |
316 | void |
387 | strip_endline (char *buf) |
317 | strip_endline (char *buf) |
388 | { |
318 | { |
389 | if (strlen (buf) < sizeof ("\n")) |
319 | if (*buf && buf [strlen (buf) - 1] == '\n') |
390 | { |
|
|
391 | return; |
|
|
392 | } |
|
|
393 | if (!strcmp (buf + strlen (buf) - EOL_SIZE, "\n")) |
|
|
394 | buf[strlen (buf) - EOL_SIZE] = '\0'; |
320 | buf [strlen (buf) - 1] = '\0'; |
395 | } |
321 | } |
396 | |
322 | |
397 | /** |
323 | /** |
398 | * Replace in string src all occurrences of key by replacement. The resulting |
324 | * Replace in string src all occurrences of key by replacement. The resulting |
399 | * string is put into result; at most resultsize characters (including the |
325 | * string is put into result; at most resultsize characters (including the |