1 | |
|
|
2 | /* |
1 | /* |
3 | * static char *rcsid_porting_c = |
|
|
4 | * "$Id: porting.C,v 1.6 2006/09/12 23:22:32 root Exp $"; |
|
|
5 | */ |
|
|
6 | |
|
|
7 | /* |
|
|
8 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
9 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
11 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
12 | |
7 | * |
13 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
14 | 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 |
15 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation; either version 2 of the License, or |
16 | (at your option) any later version. |
11 | * (at your option) any later version. |
17 | |
12 | * |
18 | 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, |
19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
21 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
22 | |
17 | * |
23 | 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 |
24 | along with this program; if not, write to the Free Software |
19 | * along with this program; if not, write to the Free Software |
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
26 | |
21 | * |
27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
28 | */ |
23 | */ |
29 | |
24 | |
30 | /* This file contains various functions that are not really unique for |
25 | /* This file contains various functions that are not really unique for |
31 | * crossfire, but rather provides what should be standard functions |
26 | * crossfire, but rather provides what should be standard functions |
32 | * for systems that do not have them. In this way, most of the |
27 | * for systems that do not have them. In this way, most of the |
33 | * nasty system dependent stuff is contained here, with the program |
28 | * nasty system dependent stuff is contained here, with the program |
34 | * calling these functions. |
29 | * calling these functions. |
35 | */ |
30 | */ |
36 | |
31 | |
37 | |
32 | |
38 | #ifdef WIN32 /* ---win32 exclude/include headers */ |
|
|
39 | # include "process.h" |
|
|
40 | # define pid_t int /* we include it non global, because there is a redefinition in python.h */ |
|
|
41 | #else |
|
|
42 | # include <ctype.h> |
|
|
43 | # include <sys/stat.h> |
|
|
44 | # include <sys/wait.h> |
|
|
45 | |
|
|
46 | # include <sys/param.h> |
|
|
47 | # include <stdio.h> |
|
|
48 | |
|
|
49 | /* Need to pull in the HAVE_... values somehow */ |
33 | /* Need to pull in the HAVE_... values somehow */ |
50 | |
34 | |
51 | /* win32 reminder: always put this in a ifndef win32 block */ |
|
|
52 | # include <autoconf.h> |
35 | #include <autoconf.h> |
53 | #endif |
|
|
54 | |
36 | |
55 | |
37 | #include <cstdio> |
56 | #ifdef HAVE_STDLIB_H |
|
|
57 | # include <stdlib.h> |
38 | #include <cstdlib> |
58 | #endif |
39 | #include <cstdarg> |
59 | |
40 | |
60 | #ifdef HAVE_UNISTD_H |
41 | #include <cctype> |
|
|
42 | |
|
|
43 | #include <sys/stat.h> |
|
|
44 | #include <sys/wait.h> |
|
|
45 | |
|
|
46 | #include <sys/param.h> |
|
|
47 | |
61 | # include <unistd.h> |
48 | #include <unistd.h> |
62 | #endif |
|
|
63 | |
|
|
64 | #include <stdarg.h> |
|
|
65 | |
49 | |
66 | /* Has to be after above includes so we don't redefine some values */ |
50 | /* Has to be after above includes so we don't redefine some values */ |
67 | #include "global.h" |
51 | #include "global.h" |
68 | |
52 | |
69 | static unsigned int curtmp = 0; |
53 | static unsigned int curtmp = 0; |
70 | |
|
|
71 | /***************************************************************************** |
|
|
72 | * File related functions |
|
|
73 | ****************************************************************************/ |
|
|
74 | |
|
|
75 | /* |
|
|
76 | * A replacement for the tempnam() function since it's not defined |
|
|
77 | * at some unix variants. |
|
|
78 | */ |
|
|
79 | |
|
|
80 | char * |
|
|
81 | tempnam_local (const char *dir, const char *pfx) |
|
|
82 | { |
|
|
83 | char *name; |
|
|
84 | pid_t pid = getpid (); |
|
|
85 | |
|
|
86 | /* HURD does not have a hard limit, but we do */ |
|
|
87 | #ifndef MAXPATHLEN |
|
|
88 | # define MAXPATHLEN 4096 |
|
|
89 | #endif |
|
|
90 | |
|
|
91 | if (!(name = (char *) malloc (MAXPATHLEN))) |
|
|
92 | return (NULL); |
|
|
93 | |
|
|
94 | if (!pfx) |
|
|
95 | pfx = "cftmp."; |
|
|
96 | |
|
|
97 | /* This is a pretty simple method - put the pid as a hex digit and |
|
|
98 | * just keep incrementing the last digit. Check to see if the file |
|
|
99 | * already exists - if so, we'll just keep looking - eventually we should |
|
|
100 | * find one that is free. |
|
|
101 | */ |
|
|
102 | if (dir != NULL) |
|
|
103 | { |
|
|
104 | do |
|
|
105 | { |
|
|
106 | #ifdef HAVE_SNPRINTF |
|
|
107 | (void) snprintf (name, MAXPATHLEN, "%s/%s%hx.%d", dir, pfx, pid, curtmp); |
|
|
108 | #else |
|
|
109 | (void) sprintf (name, "%s/%s%hx%d", dir, pfx, pid, curtmp); |
|
|
110 | #endif |
|
|
111 | curtmp++; |
|
|
112 | } |
|
|
113 | while (access (name, F_OK) != -1); |
|
|
114 | return (name); |
|
|
115 | } |
|
|
116 | return (NULL); |
|
|
117 | } |
|
|
118 | |
|
|
119 | |
|
|
120 | |
54 | |
121 | /* This function removes everything in the directory. */ |
55 | /* This function removes everything in the directory. */ |
122 | void |
56 | void |
123 | remove_directory (const char *path) |
57 | remove_directory (const char *path) |
124 | { |
58 | { |
… | |
… | |
162 | { |
96 | { |
163 | LOG (llevError, "Unable to remove directory %s\n", path); |
97 | LOG (llevError, "Unable to remove directory %s\n", path); |
164 | } |
98 | } |
165 | } |
99 | } |
166 | |
100 | |
167 | #if defined(sgi) |
|
|
168 | |
|
|
169 | # include <stdio.h> |
|
|
170 | # include <stdlib.h> |
|
|
171 | # include <string.h> |
|
|
172 | |
|
|
173 | # define popen fixed_popen |
|
|
174 | |
|
|
175 | FILE * |
|
|
176 | popen_local (const char *command, const char *type) |
|
|
177 | { |
|
|
178 | int fd[2]; |
|
|
179 | int pd; |
|
|
180 | FILE *ret; |
|
|
181 | |
|
|
182 | if (!strcmp (type, "r")) |
|
|
183 | pd = STDOUT_FILENO; |
|
|
184 | else if (!strcmp (type, "w")) |
|
|
185 | pd = STDIN_FILENO; |
|
|
186 | else |
|
|
187 | return NULL; |
|
|
188 | |
|
|
189 | if (pipe (fd) != -1) |
|
|
190 | { |
|
|
191 | switch (fork ()) |
|
|
192 | { |
|
|
193 | case -1: |
|
|
194 | close (fd[0]); |
|
|
195 | close (fd[1]); |
|
|
196 | break; |
|
|
197 | case 0: |
|
|
198 | close (fd[0]); |
|
|
199 | if ((fd[1] == pd) || (dup2 (fd[1], pd) == pd)) |
|
|
200 | { |
|
|
201 | if (fd[1] != pd) |
|
|
202 | { |
|
|
203 | close (fd[1]); |
|
|
204 | } |
|
|
205 | execl ("/bin/sh", "sh", "-c", command, NULL); |
|
|
206 | close (pd); |
|
|
207 | } |
|
|
208 | _exit (1); |
|
|
209 | break; |
|
|
210 | default: |
|
|
211 | close (fd[1]); |
|
|
212 | if (ret = fdopen (fd[0], type)) |
|
|
213 | { |
|
|
214 | return ret; |
|
|
215 | } |
|
|
216 | close (fd[0]); |
|
|
217 | break; |
|
|
218 | } |
|
|
219 | } |
|
|
220 | return NULL; |
|
|
221 | } |
|
|
222 | |
|
|
223 | #endif /* defined(sgi) */ |
|
|
224 | |
|
|
225 | |
|
|
226 | /***************************************************************************** |
|
|
227 | * String related function |
|
|
228 | ****************************************************************************/ |
|
|
229 | |
|
|
230 | /* |
|
|
231 | * A replacement of strdup(), since it's not defined at some |
|
|
232 | * unix variants. |
|
|
233 | */ |
|
|
234 | char * |
|
|
235 | strdup_local (const char *str) |
|
|
236 | { |
|
|
237 | char *c = (char *) malloc (sizeof (char) * (strlen (str) + 1)); |
|
|
238 | |
|
|
239 | strcpy (c, str); |
|
|
240 | return c; |
|
|
241 | } |
|
|
242 | |
|
|
243 | |
|
|
244 | #define DIGIT(x) (isdigit(x) ? (x) - '0' : \ |
101 | #define DIGIT(x) (isdigit(x) ? (x) - '0' : \ |
245 | islower (x) ? (x) + 10 - 'a' : (x) + 10 - 'A') |
102 | islower (x) ? (x) + 10 - 'a' : (x) + 10 - 'A') |
246 | #define MBASE ('z' - 'a' + 1 + 10) |
103 | #define MBASE ('z' - 'a' + 1 + 10) |
247 | |
|
|
248 | /* This seems to be lacking on some system */ |
|
|
249 | #if !defined(HAVE_STRNCASECMP) |
|
|
250 | int |
|
|
251 | strncasecmp (const char *s1, const char *s2, int n) |
|
|
252 | { |
|
|
253 | register int c1, c2; |
|
|
254 | |
|
|
255 | while (*s1 && *s2 && n) |
|
|
256 | { |
|
|
257 | c1 = tolower (*s1); |
|
|
258 | c2 = tolower (*s2); |
|
|
259 | if (c1 != c2) |
|
|
260 | return (c1 - c2); |
|
|
261 | s1++; |
|
|
262 | s2++; |
|
|
263 | n--; |
|
|
264 | } |
|
|
265 | if (!n) |
|
|
266 | return (0); |
|
|
267 | return (int) (*s1 - *s2); |
|
|
268 | } |
|
|
269 | #endif |
|
|
270 | |
|
|
271 | #if !defined(HAVE_STRCASECMP) |
|
|
272 | int |
|
|
273 | strcasecmp (const char *s1, const char *s2) |
|
|
274 | { |
|
|
275 | register int c1, c2; |
|
|
276 | |
|
|
277 | while (*s1 && *s2) |
|
|
278 | { |
|
|
279 | c1 = tolower (*s1); |
|
|
280 | c2 = tolower (*s2); |
|
|
281 | if (c1 != c2) |
|
|
282 | return (c1 - c2); |
|
|
283 | s1++; |
|
|
284 | s2++; |
|
|
285 | } |
|
|
286 | if (*s1 == '\0' && *s2 == '\0') |
|
|
287 | return 0; |
|
|
288 | return (int) (*s1 - *s2); |
|
|
289 | } |
|
|
290 | #endif |
|
|
291 | |
104 | |
292 | char * |
105 | char * |
293 | strcasestr_local (const char *s, const char *find) |
106 | strcasestr_local (const char *s, const char *find) |
294 | { |
107 | { |
295 | char c, sc; |
108 | char c, sc; |
… | |
… | |
312 | s--; |
125 | s--; |
313 | } |
126 | } |
314 | return (char *) s; |
127 | return (char *) s; |
315 | } |
128 | } |
316 | |
129 | |
317 | #if !defined(HAVE_SNPRINTF) |
|
|
318 | |
|
|
319 | int |
|
|
320 | snprintf (char *dest, int max, const char *format, ...) |
|
|
321 | { |
|
|
322 | va_list var; |
|
|
323 | int ret; |
|
|
324 | |
|
|
325 | va_start (var, format); |
|
|
326 | ret = vsprintf (dest, format, var); |
|
|
327 | va_end (var); |
|
|
328 | if (ret > max) |
|
|
329 | abort (); |
|
|
330 | |
|
|
331 | return ret; |
|
|
332 | } |
|
|
333 | #endif |
|
|
334 | |
|
|
335 | |
|
|
336 | /* |
|
|
337 | * Based on (n+1)^2 = n^2 + 2n + 1 |
|
|
338 | * given that 1^2 = 1, then |
|
|
339 | * 2^2 = 1 + (2 + 1) = 1 + 3 = 4 |
|
|
340 | * 3^2 = 4 + (4 + 1) = 4 + 5 = 1 + 3 + 5 = 9 |
|
|
341 | * 4^2 = 9 + (6 + 1) = 9 + 7 = 1 + 3 + 5 + 7 = 16 |
|
|
342 | * ... |
|
|
343 | * In other words, a square number can be express as the sum of the |
|
|
344 | * series n^2 = 1 + 3 + ... + (2n-1) |
|
|
345 | */ |
|
|
346 | int |
|
|
347 | isqrt (int n) |
|
|
348 | { |
|
|
349 | int result, sum, prev; |
|
|
350 | |
|
|
351 | result = 0; |
|
|
352 | prev = sum = 1; |
|
|
353 | while (sum <= n) |
|
|
354 | { |
|
|
355 | prev += 2; |
|
|
356 | sum += prev; |
|
|
357 | ++result; |
|
|
358 | } |
|
|
359 | return result; |
|
|
360 | } |
|
|
361 | |
|
|
362 | |
|
|
363 | /* |
130 | /* |
364 | * returns a char-pointer to a static array, in which a representation |
131 | * returns a char-pointer to a static array, in which a representation |
365 | * of the decimal number given will be stored. |
132 | * of the decimal number given will be stored. |
366 | */ |
133 | */ |
367 | |
|
|
368 | char * |
134 | char * |
369 | ltostr10 (signed long n) |
135 | ltostr10 (signed long n) |
370 | { |
136 | { |
371 | static char buf[12]; /* maximum size is n=-2 billion, i.e. 11 characters+1 |
137 | static char buf[12]; /* maximum size is n=-2 billion, i.e. 11 characters+1 |
372 | character for the trailing nul character */ |
138 | character for the trailing nul character */ |
… | |
… | |
388 | * then it opens it and returns the file-pointer. |
154 | * then it opens it and returns the file-pointer. |
389 | */ |
155 | */ |
390 | FILE * |
156 | FILE * |
391 | open_and_uncompress (const char *name, int flag, int *compressed) |
157 | open_and_uncompress (const char *name, int flag, int *compressed) |
392 | { |
158 | { |
393 | size_t i; |
|
|
394 | FILE *fp; |
|
|
395 | |
|
|
396 | *compressed = 0; |
159 | *compressed = 0; |
397 | return fopen (name, "r"); |
160 | return fopen (name, "r"); |
398 | } |
161 | } |
399 | |
162 | |
400 | /* |
163 | /* |
… | |
… | |
417 | char buf[MAX_BUF], *cp = buf; |
180 | char buf[MAX_BUF], *cp = buf; |
418 | struct stat statbuf; |
181 | struct stat statbuf; |
419 | |
182 | |
420 | if (!filename || !*filename) |
183 | if (!filename || !*filename) |
421 | return; |
184 | return; |
|
|
185 | |
422 | strcpy (buf, filename); |
186 | assign (buf, filename); |
423 | |
187 | |
424 | while ((cp = strchr (cp + 1, (int) '/'))) |
188 | while ((cp = strchr (cp + 1, (int) '/'))) |
425 | { |
189 | { |
426 | *cp = '\0'; |
190 | *cp = '\0'; |
427 | if (stat (buf, &statbuf) || !S_ISDIR (statbuf.st_mode)) |
191 | if (stat (buf, &statbuf) || !S_ISDIR (statbuf.st_mode)) |