1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include "system.h"
#ifdef NO_PTHREAD_RTL
/* struct passwd differs on some platforms */
#if defined(MACOSX) || defined(IOS) || defined(OPENBSD) || defined(NETBSD)
//No mutex needed on Mac OS X, gethostbyname is thread safe
#if defined(MACOSX)
#define RTL_MUTEX_LOCK
#define RTL_MUTEX_UNLOCK
#else //defined(MACOSX)
static pthread_mutex_t getrtl_mutex = PTHREAD_MUTEX_INITIALIZER;
#define RTL_MUTEX_LOCK pthread_mutex_lock(&getrtl_mutex);
#define RTL_MUTEX_UNLOCK pthread_mutex_unlock(&getrtl_mutex);
#endif //defined(MACOSX)
extern int h_errno;
struct hostent *gethostbyname_r(const char *name, struct hostent *result,
char *buffer, size_t buflen, int *h_errnop)
{
/* buffer layout: name\0
* array_of_pointer_to_aliases
* NULL
* alias1\0...aliasn\0
* array_of_pointer_to_addresses
* NULL
* addr1addr2addr3...addrn
*/
struct hostent* res;
RTL_MUTEX_LOCK
if ( (res = gethostbyname(name)) )
{
int nname, naliases, naddr_list, naliasesdata, n;
char **p, **parray, *data;
/* Check buffer size before copying, we want to leave the
* buffers unmodified in case something goes wrong.
*
* Is this required?
*/
nname= strlen(res->h_name)+1;
naliases = naddr_list = naliasesdata = 0;
for ( p = res->h_aliases; *p != NULL; p++) {
naliases++;
naliasesdata += strlen(*p)+1;
}
for ( p = res->h_addr_list; *p != NULL; p++)
naddr_list++;
if ( nname
+ (naliases+1)*sizeof(char*) + naliasesdata
+ (naddr_list+1)*sizeof(char*) + naddr_list*res->h_length
<= buflen )
{
memcpy(result, res, sizeof(struct hostent));
strcpy(buffer, res->h_name);
result->h_name = buffer;
buffer += nname;
parray = (char**)buffer;
result->h_aliases = parray;
data = buffer + (naliases+1)*sizeof(char*);
for ( p = res->h_aliases; *p != NULL; p++) {
n = strlen(*p)+1;
*parray++ = data;
memcpy(data, *p, n);
data += n;
}
*parray = NULL;
buffer = data;
parray = (char**)buffer;
result->h_addr_list = parray;
data = buffer + (naddr_list+1)*sizeof(char*);
for ( p = res->h_addr_list; *p != NULL; p++) {
*parray++ = data;
memcpy(data, *p, res->h_length);
data += res->h_length;
}
*parray = NULL;
res = result;
}
else
{
errno = ERANGE;
res = NULL;
}
}
else
{
*h_errnop = h_errno;
}
RTL_MUTEX_UNLOCK
return res;
}
#endif // OSX || IOS || OPENBSD || NETBSD
#if defined(MACOSX)
/*
* Add support for resolving Mac native alias files (not the same as unix alias files)
* returns 0 on success.
*/
int macxp_resolveAlias(char *path, int buflen)
{
FSRef aFSRef;
OSStatus nErr;
Boolean bFolder;
Boolean bAliased;
char *unprocessedPath = path;
if ( *unprocessedPath == '/' )
unprocessedPath++;
int nRet = 0;
while ( !nRet && unprocessedPath && *unprocessedPath )
{
unprocessedPath = strchr( unprocessedPath, '/' );
if ( unprocessedPath )
*unprocessedPath = '\0';
nErr = noErr;
bFolder = FALSE;
bAliased = FALSE;
if ( FSPathMakeRef( (const UInt8 *)path, &aFSRef, 0 ) == noErr )
{
nErr = FSResolveAliasFileWithMountFlags( &aFSRef, TRUE, &bFolder, &bAliased, kResolveAliasFileNoUI );
if ( nErr == nsvErr )
{
errno = ENOENT;
nRet = -1;
}
else if ( nErr == noErr && bAliased )
{
char tmpPath[ PATH_MAX ];
if ( FSRefMakePath( &aFSRef, (UInt8 *)tmpPath, PATH_MAX ) == noErr )
{
int nLen = strlen( tmpPath ) + ( unprocessedPath ? strlen( unprocessedPath + 1 ) + 1 : 0 );
if ( nLen < buflen && nLen < PATH_MAX )
{
if ( unprocessedPath )
{
int nTmpPathLen = strlen( tmpPath );
strcat( tmpPath, "/" );
strcat( tmpPath, unprocessedPath + 1 );
strcpy( path, tmpPath);
unprocessedPath = path + nTmpPathLen;
}
else if ( !unprocessedPath )
{
strcpy( path, tmpPath);
}
}
else
{
errno = ENAMETOOLONG;
nRet = -1;
}
}
}
}
if ( unprocessedPath )
*unprocessedPath++ = '/';
}
return nRet;
}
#endif /* defined MACOSX */
#endif /* NO_PTHREAD_RTL */
#ifdef NO_PTHREAD_SEMAPHORES
int sem_init(sem_t* sem, int pshared, unsigned int value)
{
(void)pshared;
pthread_mutex_init(&sem->mutex, PTHREAD_MUTEXATTR_DEFAULT);
pthread_cond_init(&sem->increased, PTHREAD_CONDATTR_DEFAULT);
sem->value = (int)value;
return 0;
}
int sem_destroy(sem_t* sem)
{
pthread_mutex_destroy(&sem->mutex);
pthread_cond_destroy(&sem->increased);
sem->value = 0;
return 0;
}
int sem_wait(sem_t* sem)
{
pthread_mutex_lock(&sem->mutex);
while (sem->value <= 0)
{
pthread_cond_wait(&sem->increased, &sem->mutex);
}
sem->value--;
pthread_mutex_unlock(&sem->mutex);
return 0;
}
int sem_trywait(sem_t* sem)
{
int result = 0;
pthread_mutex_lock(&sem->mutex);
if (sem->value > 0)
{
sem->value--;
}
else
{
errno = EAGAIN;
result = -1;
}
pthread_mutex_unlock(&sem->mutex);
return result;
}
int sem_post(sem_t* sem)
{
pthread_mutex_lock(&sem->mutex);
sem->value++;
pthread_mutex_unlock(&sem->mutex);
pthread_cond_signal(&sem->increased);
return 0;
}
#endif
#if defined(FREEBSD)
char *fcvt(double value, int ndigit, int *decpt, int *sign)
{
static char ret[256];
char buf[256],zahl[256],format[256]="%";
char *v1,*v2;
if (value==0.0) value=1e-30;
if (value<0.0) *sign=1; else *sign=0;
if (value<1.0)
{
*decpt=(int)log10(value);
value*=pow(10.0,1-*decpt);
ndigit+=*decpt-1;
if (ndigit<0) ndigit=0;
}
else
{
*decpt=(int)log10(value)+1;
}
sprintf(zahl,"%d",ndigit);
strcat(format,zahl);
strcat(format,".");
strcat(format,zahl);
strcat(format,"f");
sprintf(buf,format,value);
if (ndigit!=0)
{
v1=strtok(buf,".");
v2=strtok(NULL,".");
strcpy(ret,v1);
strcat(ret,v2);
}
else
{
strcpy(ret,buf);
}
return(ret);
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|