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
|
/*******************************************************************/
/* sltdl: a surrogate ltdl implementation */
/* Copyright (C) 2019 Z. Gilboa */
/* Released under the Standard MIT License; see COPYING.SLTDL. */
/*******************************************************************/
#include <limits.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <pthread.h>
#include <sltdl/sltdl.h>
#include "sltdl_core.h"
static off_t lt_plen;
static off_t lt_plocs;
static char * lt_upath;
static char * lt_vpath;
static char ** lt_vmark;
static char ** lt_pathv;
const char * lt_dlgetsearchpath(void)
{
return lt_upath;
}
static int lt_dlsetsearchpath_locked(const char * path)
{
const char * ch;
char * uch;
char * vch;
char ** pathv;
off_t elements;
if (path[0] != '/')
return 1;
elements = 1;
for (ch=&path[1]; *ch; ch++) {
if (*ch == ':') {
if (ch[1] != '/')
return 1;
elements++;
}
}
if (++elements > lt_plocs) {
if (lt_pathv) {
free(lt_pathv);
lt_pathv = 0;
}
lt_plocs = elements;
lt_plocs += 0x3f;
lt_plocs |= 0x3f;
lt_plocs ^= 0x3f;
if (!(lt_pathv = calloc(lt_plocs,sizeof(char *))))
return 1;
}
if ((ch - path) > lt_plen) {
if (lt_upath) {
free(lt_upath);
lt_upath = 0;
}
lt_plen = ((ch - path + 1) <= 0x800)
? 0x800 : ch - path + 1;
lt_plen += 0x7ff;
lt_plen |= 0x7ff;
lt_plen ^= 0x7ff;
if (!(lt_upath = calloc(2*lt_plen,1)))
return 1;
lt_vpath = <_upath[lt_plen];
}
pathv = lt_pathv;
*pathv++ = lt_vpath;
for (ch=path, uch=lt_upath, vch=lt_vpath; *ch; ch++) {
if (*ch == ':') {
*uch++ = ch[0];
*uch++ = ch[1];
*vch++ = 0;
*pathv = vch;
*vch++ = ch[1];
ch++;
pathv++;
} else {
*uch++ = *ch;
*vch++ = *ch;
}
}
lt_vmark = pathv;
return 0;
}
int lt_dlsetsearchpath(const char * path)
{
lt_slock();
return lt_sunlock(lt_dlsetsearchpath_locked(path));
}
int lt_dladdsearchdir(const char * path)
{
int ret;
const char * ch;
char * buf;
off_t alen;
off_t plen;
if (path[0] != '/')
return 1;
for (ch=path; *ch; ch++)
if (*ch == ':')
return 1;
lt_slock();
alen = strlen(path);
plen = strlen(lt_upath);
/* no allocation needed? */
if (!lt_pathv[lt_plocs - 2] && ((plen + 1 + alen + 1) <= lt_plen)) {
lt_upath[plen] = ':';
lt_vpath[plen] = 0;
plen++;
strcpy(<_upath[plen],path);
strcpy(<_vpath[plen],path);
*lt_vmark++ = <_vpath[plen];
return lt_sunlock(0);
}
/* (allocation needed) */
if (!(buf = malloc(plen + 1 + alen + 1)))
return lt_sunlock(1);
sprintf(buf,"%s:%s",lt_upath,path);
ret = lt_dlsetsearchpath_locked(buf);
free(buf);
return lt_sunlock(ret);
}
int lt_dlinsertsearchdir(const char * mark, const char * path)
{
int ret;
const char * ch;
char * buf;
char * dst;
off_t alen;
off_t plen;
off_t slen;
off_t offset;
char ** pathv;
if (path[0] != '/')
return 1;
if (!mark)
return lt_dladdsearchdir(path);
for (ch=path; *ch; ch++)
if (*ch == ':')
return 1;
lt_slock();
alen = strlen(path);
plen = strlen(lt_upath);
if ((mark < lt_upath) || (mark >= <_upath[plen]))
return lt_sunlock(1);
if ((mark > lt_upath) && (mark[-1] != ':'))
return lt_sunlock(1);
mark = <_vpath[mark - lt_upath];
/* no allocation needed? */
if (!lt_pathv[lt_plocs - 2] && ((plen + 1 + alen + 1) <= lt_plen)) {
for (pathv=lt_vmark; pathv>=lt_pathv; pathv--) {
slen = strlen(pathv[-1]);
offset = pathv[-1] - lt_vpath;
offset += alen + 1;
memcpy(<_upath[offset],pathv[-1],slen);
memcpy(<_vpath[offset],<_upath[offset],slen);
if (pathv < lt_vmark)
lt_upath[offset + slen] = ':';
pathv[0] = pathv[-1];
if (pathv[-1] == mark) {
offset = mark - lt_vpath;
strcpy(<_vpath[offset],path);
memcpy(<_upath[offset],path,alen);
lt_upath[offset+alen] = ':';
lt_vmark++;
return lt_sunlock(0);
}
}
}
/* (allocation needed) */
if (!(buf = malloc(plen + 1 + alen + 1)))
return lt_sunlock(1);
for (dst=buf, pathv=lt_pathv; *pathv; pathv++) {
if (*pathv == mark)
dst += sprintf(dst,"%s:",path);
if (pathv[1])
dst += sprintf(dst,"%s:",*pathv);
else
dst += sprintf(dst,"%s",*pathv);
}
ret = lt_dlsetsearchpath_locked(buf);
free(buf);
return lt_sunlock(ret);
}
int lt_dlpathopen(const char * module, const char ** extv)
{
int fdat;
int fdmod;
char ** ppath;
const char ** pext;
size_t mlen;
size_t elen;
char path[1024];
if ((mlen = strlen(module)) >= sizeof(path))
return -1;
memcpy(path,module,mlen);
lt_slock();
for (ppath=lt_pathv; *ppath; ppath++) {
fdat = open(*ppath,O_RDONLY|O_DIRECTORY|O_CLOEXEC,0);
if (fdat >= 0) {
for (pext=extv; *pext; pext++) {
if (mlen + (elen = strlen(*pext)) >= (sizeof(path))) {
close(fdat);
return (-1);
}
memcpy(&path[mlen],*pext,elen);
path[mlen+elen] = 0;
fdmod = openat(fdat,path,O_EXEC|O_CLOEXEC,0);
if (fdmod >= 0) {
close(fdat);
return lt_sunlock(fdmod);
}
}
close(fdat);
}
}
return lt_sunlock(-1);
}
|
