1 | /* |
1 | /* |
2 | * libeio implementation |
2 | * libeio implementation |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013 Marc Alexander Lehmann <libeio@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * |
9 | * |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
11 | * this list of conditions and the following disclaimer. |
11 | * this list of conditions and the following disclaimer. |
12 | * |
12 | * |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
14 | * notice, this list of conditions and the following disclaimer in the |
14 | * notice, this list of conditions and the following disclaimer in the |
15 | * documentation and/or other materials provided with the distribution. |
15 | * documentation and/or other materials provided with the distribution. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
… | |
… | |
43 | |
43 | |
44 | #include "eio.h" |
44 | #include "eio.h" |
45 | #include "ecb.h" |
45 | #include "ecb.h" |
46 | |
46 | |
47 | #ifdef EIO_STACKSIZE |
47 | #ifdef EIO_STACKSIZE |
48 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
48 | # define X_STACKSIZE EIO_STACKSIZE |
49 | #endif |
49 | #endif |
50 | #include "xthread.h" |
50 | #include "xthread.h" |
51 | |
51 | |
52 | #include <errno.h> |
52 | #include <errno.h> |
53 | #include <stddef.h> |
53 | #include <stddef.h> |
… | |
… | |
105 | #ifdef _WIN32 |
105 | #ifdef _WIN32 |
106 | |
106 | |
107 | #undef PAGESIZE |
107 | #undef PAGESIZE |
108 | #define PAGESIZE 4096 /* GetSystemInfo? */ |
108 | #define PAGESIZE 4096 /* GetSystemInfo? */ |
109 | |
109 | |
|
|
110 | /* TODO: look at how perl does stat (non-sloppy), unlink (ro-files), utime, link */ |
|
|
111 | |
110 | #ifdef EIO_STRUCT_STATI64 |
112 | #ifdef EIO_STRUCT_STATI64 |
|
|
113 | /* look at perl's non-sloppy stat */ |
111 | #define stat(path,buf) _stati64 (path,buf) |
114 | #define stat(path,buf) _stati64 (path,buf) |
112 | #define fstat(fd,buf) _fstati64 (fd,buf) |
115 | #define fstat(fd,buf) _fstati64 (fd,buf) |
113 | #endif |
116 | #endif |
114 | #define lstat(path,buf) stat (path,buf) |
117 | #define lstat(path,buf) stat (path,buf) |
115 | #define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1)) |
118 | #define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1)) |
… | |
… | |
117 | #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1)) |
120 | #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1)) |
118 | |
121 | |
119 | #define chmod(path,mode) _chmod (path, mode) |
122 | #define chmod(path,mode) _chmod (path, mode) |
120 | #define dup(fd) _dup (fd) |
123 | #define dup(fd) _dup (fd) |
121 | #define dup2(fd1,fd2) _dup2 (fd1, fd2) |
124 | #define dup2(fd1,fd2) _dup2 (fd1, fd2) |
|
|
125 | #define pipe(fds) _pipe (fds, 4096, O_BINARY) |
122 | |
126 | |
123 | #define fchmod(fd,mode) EIO_ENOSYS () |
127 | #define fchmod(fd,mode) EIO_ENOSYS () |
124 | #define chown(path,uid,gid) EIO_ENOSYS () |
128 | #define chown(path,uid,gid) EIO_ENOSYS () |
125 | #define fchown(fd,uid,gid) EIO_ENOSYS () |
129 | #define fchown(fd,uid,gid) EIO_ENOSYS () |
126 | #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */ |
130 | #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */ |
… | |
… | |
129 | #define sync() EIO_ENOSYS () |
133 | #define sync() EIO_ENOSYS () |
130 | #define readlink(path,buf,s) EIO_ENOSYS () |
134 | #define readlink(path,buf,s) EIO_ENOSYS () |
131 | #define statvfs(path,buf) EIO_ENOSYS () |
135 | #define statvfs(path,buf) EIO_ENOSYS () |
132 | #define fstatvfs(fd,buf) EIO_ENOSYS () |
136 | #define fstatvfs(fd,buf) EIO_ENOSYS () |
133 | |
137 | |
|
|
138 | #define pread(fd,buf,count,offset) eio__pread (fd, buf, count, offset) |
|
|
139 | #define pwrite(fd,buf,count,offset) eio__pwrite (fd, buf, count, offset) |
|
|
140 | |
|
|
141 | #if __GNUC__ |
|
|
142 | typedef long long eio_off_t; /* signed for compatibility to msvc */ |
|
|
143 | #else |
|
|
144 | typedef __int64 eio_off_t; /* unsigned not supported by msvc */ |
|
|
145 | #endif |
|
|
146 | |
|
|
147 | static eio_ssize_t |
|
|
148 | eio__pread (int fd, void *buf, eio_ssize_t count, eio_off_t offset) |
|
|
149 | { |
|
|
150 | OVERLAPPED o = { 0 }; |
|
|
151 | DWORD got; |
|
|
152 | |
|
|
153 | o.Offset = offset; |
|
|
154 | o.OffsetHigh = offset >> 32; |
|
|
155 | |
|
|
156 | return ReadFile ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd), buf, count, &got, &o) |
|
|
157 | ? got : -1; |
|
|
158 | } |
|
|
159 | |
|
|
160 | static eio_ssize_t |
|
|
161 | eio__pwrite (int fd, void *buf, eio_ssize_t count, eio_off_t offset) |
|
|
162 | { |
|
|
163 | OVERLAPPED o = { 0 }; |
|
|
164 | DWORD got; |
|
|
165 | |
|
|
166 | o.Offset = offset; |
|
|
167 | o.OffsetHigh = offset >> 32; |
|
|
168 | |
|
|
169 | return WriteFile ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd), buf, count, &got, &o) |
|
|
170 | ? got : -1; |
|
|
171 | } |
|
|
172 | |
|
|
173 | /* rename() uses MoveFile, which fails to overwrite */ |
|
|
174 | #define rename(old,neu) eio__rename (old, neu) |
|
|
175 | |
|
|
176 | static int |
|
|
177 | eio__rename (const char *old, const char *neu) |
|
|
178 | { |
|
|
179 | if (MoveFileEx (old, neu, MOVEFILE_REPLACE_EXISTING)) |
|
|
180 | return 0; |
|
|
181 | |
|
|
182 | /* should steal _dosmaperr */ |
|
|
183 | switch (GetLastError ()) |
|
|
184 | { |
|
|
185 | case ERROR_FILE_NOT_FOUND: |
|
|
186 | case ERROR_PATH_NOT_FOUND: |
|
|
187 | case ERROR_INVALID_DRIVE: |
|
|
188 | case ERROR_NO_MORE_FILES: |
|
|
189 | case ERROR_BAD_NETPATH: |
|
|
190 | case ERROR_BAD_NET_NAME: |
|
|
191 | case ERROR_BAD_PATHNAME: |
|
|
192 | case ERROR_FILENAME_EXCED_RANGE: |
|
|
193 | errno = ENOENT; |
|
|
194 | break; |
|
|
195 | |
|
|
196 | default: |
|
|
197 | errno = EACCES; |
|
|
198 | break; |
|
|
199 | } |
|
|
200 | |
|
|
201 | return -1; |
|
|
202 | } |
|
|
203 | |
134 | /* we could even stat and see if it exists */ |
204 | /* we could even stat and see if it exists */ |
135 | static int |
205 | static int |
136 | symlink (const char *old, const char *neu) |
206 | symlink (const char *old, const char *neu) |
137 | { |
207 | { |
138 | #if WINVER >= 0x0600 |
208 | #if WINVER >= 0x0600 |
… | |
… | |
144 | #endif |
214 | #endif |
145 | |
215 | |
146 | return EIO_ERRNO (ENOENT, -1); |
216 | return EIO_ERRNO (ENOENT, -1); |
147 | } |
217 | } |
148 | |
218 | |
149 | /* POSIX API only */ |
219 | /* POSIX API only, causing trouble for win32 apps */ |
150 | #define CreateHardLink(neu,old,flags) 0 |
220 | #define CreateHardLink(neu,old,flags) 0 /* not really creating hardlink, still using relative paths? */ |
151 | #define CreateSymbolicLink(neu,old,flags) 0 |
221 | #define CreateSymbolicLink(neu,old,flags) 0 /* vista+ only */ |
152 | |
222 | |
153 | struct statvfs |
223 | struct statvfs |
154 | { |
224 | { |
155 | int dummy; |
225 | int dummy; |
156 | }; |
226 | }; |
… | |
… | |
162 | |
232 | |
163 | #else |
233 | #else |
164 | |
234 | |
165 | #include <sys/time.h> |
235 | #include <sys/time.h> |
166 | #include <sys/select.h> |
236 | #include <sys/select.h> |
167 | #include <sys/statvfs.h> |
|
|
168 | #include <unistd.h> |
237 | #include <unistd.h> |
169 | #include <signal.h> |
238 | #include <signal.h> |
170 | #include <dirent.h> |
239 | #include <dirent.h> |
171 | |
240 | |
|
|
241 | #ifdef ANDROID |
|
|
242 | #include <sys/vfs.h> |
|
|
243 | #define statvfs statfs |
|
|
244 | #define fstatvfs fstatfs |
|
|
245 | #include <asm/page.h> /* supposedly limits.h does #define PAGESIZE PAGESIZE */ |
|
|
246 | #else |
|
|
247 | #include <sys/statvfs.h> |
|
|
248 | #endif |
|
|
249 | |
172 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
250 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
173 | #include <sys/mman.h> |
251 | #include <sys/mman.h> |
174 | #endif |
252 | #endif |
175 | |
253 | |
176 | #define D_NAME(entp) entp->d_name |
254 | #define D_NAME(entp) entp->d_name |
177 | |
255 | |
178 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
256 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
179 | #if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
257 | #if __FreeBSD__ || __NetBSD__ || __OpenBSD__ |
180 | #define _DIRENT_HAVE_D_TYPE /* sigh */ |
258 | #define _DIRENT_HAVE_D_TYPE /* sigh */ |
181 | #define D_INO(de) (de)->d_fileno |
259 | #define D_INO(de) (de)->d_fileno |
182 | #define D_NAMLEN(de) (de)->d_namlen |
260 | #define D_NAMLEN(de) (de)->d_namlen |
183 | #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
261 | #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
184 | #define D_INO(de) (de)->d_ino |
262 | #define D_INO(de) (de)->d_ino |
… | |
… | |
247 | #endif |
325 | #endif |
248 | |
326 | |
249 | /* buffer size for various temporary buffers */ |
327 | /* buffer size for various temporary buffers */ |
250 | #define EIO_BUFSIZE 65536 |
328 | #define EIO_BUFSIZE 65536 |
251 | |
329 | |
252 | #define dBUF \ |
330 | #define dBUF \ |
253 | char *eio_buf = malloc (EIO_BUFSIZE); \ |
331 | char *eio_buf = malloc (EIO_BUFSIZE); \ |
254 | errno = ENOMEM; \ |
332 | errno = ENOMEM; \ |
255 | if (!eio_buf) \ |
333 | if (!eio_buf) \ |
256 | return -1 |
334 | return -1 |
257 | |
335 | |
258 | #define FUBd \ |
336 | #define FUBd \ |
259 | free (eio_buf) |
337 | free (eio_buf) |
260 | |
338 | |
261 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
339 | /*****************************************************************************/ |
|
|
340 | |
|
|
341 | struct etp_tmpbuf; |
|
|
342 | |
|
|
343 | #if _POSIX_VERSION >= 200809L |
|
|
344 | #define HAVE_AT 1 |
|
|
345 | #define WD2FD(wd) ((wd) ? (wd)->fd : AT_FDCWD) |
|
|
346 | #ifndef O_SEARCH |
|
|
347 | #define O_SEARCH O_RDONLY |
|
|
348 | #endif |
|
|
349 | #else |
|
|
350 | #define HAVE_AT 0 |
|
|
351 | static const char *wd_expand (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path); |
|
|
352 | #endif |
|
|
353 | |
|
|
354 | struct eio_pwd |
|
|
355 | { |
|
|
356 | #if HAVE_AT |
|
|
357 | int fd; |
|
|
358 | #endif |
|
|
359 | int len; |
|
|
360 | char str[1]; /* actually, a 0-terminated canonical path */ |
|
|
361 | }; |
|
|
362 | |
|
|
363 | /*****************************************************************************/ |
262 | |
364 | |
263 | #define ETP_PRI_MIN EIO_PRI_MIN |
365 | #define ETP_PRI_MIN EIO_PRI_MIN |
264 | #define ETP_PRI_MAX EIO_PRI_MAX |
366 | #define ETP_PRI_MAX EIO_PRI_MAX |
265 | |
367 | |
|
|
368 | #define ETP_TYPE_QUIT -1 |
|
|
369 | #define ETP_TYPE_GROUP EIO_GROUP |
|
|
370 | |
|
|
371 | static void eio_nop_callback (void) { } |
|
|
372 | static void (*eio_want_poll_cb)(void) = eio_nop_callback; |
|
|
373 | static void (*eio_done_poll_cb)(void) = eio_nop_callback; |
|
|
374 | |
|
|
375 | #define ETP_WANT_POLL(pool) eio_want_poll_cb () |
|
|
376 | #define ETP_DONE_POLL(pool) eio_done_poll_cb () |
|
|
377 | |
266 | struct etp_worker; |
378 | struct etp_worker; |
267 | |
|
|
268 | #define ETP_REQ eio_req |
379 | #define ETP_REQ eio_req |
269 | #define ETP_DESTROY(req) eio_destroy (req) |
380 | #define ETP_DESTROY(req) eio_destroy (req) |
270 | static int eio_finish (eio_req *req); |
381 | static int eio_finish (eio_req *req); |
271 | #define ETP_FINISH(req) eio_finish (req) |
382 | #define ETP_FINISH(req) eio_finish (req) |
272 | static void eio_execute (struct etp_worker *self, eio_req *req); |
383 | static void eio_execute (struct etp_worker *self, eio_req *req); |
273 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req) |
384 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk, req) |
274 | |
385 | |
275 | /*****************************************************************************/ |
386 | #include "etp.c" |
276 | |
387 | |
277 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
388 | static struct etp_pool eio_pool; |
278 | |
389 | #define EIO_POOL (&eio_pool) |
279 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
|
|
280 | ecb_inline int |
|
|
281 | tvdiff (struct timeval *tv1, struct timeval *tv2) |
|
|
282 | { |
|
|
283 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
|
|
284 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
|
|
285 | } |
|
|
286 | |
|
|
287 | static unsigned int started, idle, wanted = 4; |
|
|
288 | |
|
|
289 | static void (*want_poll_cb) (void); |
|
|
290 | static void (*done_poll_cb) (void); |
|
|
291 | |
|
|
292 | static unsigned int max_poll_time; /* reslock */ |
|
|
293 | static unsigned int max_poll_reqs; /* reslock */ |
|
|
294 | |
|
|
295 | static volatile unsigned int nreqs; /* reqlock */ |
|
|
296 | static volatile unsigned int nready; /* reqlock */ |
|
|
297 | static volatile unsigned int npending; /* reqlock */ |
|
|
298 | static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */ |
|
|
299 | static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */ |
|
|
300 | |
|
|
301 | static xmutex_t wrklock; |
|
|
302 | static xmutex_t reslock; |
|
|
303 | static xmutex_t reqlock; |
|
|
304 | static xcond_t reqwait; |
|
|
305 | |
|
|
306 | #if !HAVE_PREADWRITE |
|
|
307 | /* |
|
|
308 | * make our pread/pwrite emulation safe against themselves, but not against |
|
|
309 | * normal read/write by using a mutex. slows down execution a lot, |
|
|
310 | * but that's your problem, not mine. |
|
|
311 | */ |
|
|
312 | static xmutex_t preadwritelock; |
|
|
313 | #endif |
|
|
314 | |
|
|
315 | typedef struct etp_worker |
|
|
316 | { |
|
|
317 | /* locked by wrklock */ |
|
|
318 | struct etp_worker *prev, *next; |
|
|
319 | |
|
|
320 | xthread_t tid; |
|
|
321 | |
|
|
322 | /* locked by reslock, reqlock or wrklock */ |
|
|
323 | ETP_REQ *req; /* currently processed request */ |
|
|
324 | |
|
|
325 | #ifdef ETP_WORKER_COMMON |
|
|
326 | ETP_WORKER_COMMON |
|
|
327 | #endif |
|
|
328 | } etp_worker; |
|
|
329 | |
|
|
330 | static etp_worker wrk_first; /* NOT etp */ |
|
|
331 | |
|
|
332 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
|
|
333 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
|
|
334 | |
|
|
335 | /* worker threads management */ |
|
|
336 | |
|
|
337 | static void ecb_cold |
|
|
338 | etp_worker_clear (etp_worker *wrk) |
|
|
339 | { |
|
|
340 | } |
|
|
341 | |
|
|
342 | static void ecb_cold |
|
|
343 | etp_worker_free (etp_worker *wrk) |
|
|
344 | { |
|
|
345 | wrk->next->prev = wrk->prev; |
|
|
346 | wrk->prev->next = wrk->next; |
|
|
347 | |
|
|
348 | free (wrk); |
|
|
349 | } |
|
|
350 | |
|
|
351 | static unsigned int |
|
|
352 | etp_nreqs (void) |
|
|
353 | { |
|
|
354 | int retval; |
|
|
355 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
356 | retval = nreqs; |
|
|
357 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
358 | return retval; |
|
|
359 | } |
|
|
360 | |
|
|
361 | static unsigned int |
|
|
362 | etp_nready (void) |
|
|
363 | { |
|
|
364 | unsigned int retval; |
|
|
365 | |
|
|
366 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
367 | retval = nready; |
|
|
368 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
369 | |
|
|
370 | return retval; |
|
|
371 | } |
|
|
372 | |
|
|
373 | static unsigned int |
|
|
374 | etp_npending (void) |
|
|
375 | { |
|
|
376 | unsigned int retval; |
|
|
377 | |
|
|
378 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
379 | retval = npending; |
|
|
380 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
381 | |
|
|
382 | return retval; |
|
|
383 | } |
|
|
384 | |
|
|
385 | static unsigned int |
|
|
386 | etp_nthreads (void) |
|
|
387 | { |
|
|
388 | unsigned int retval; |
|
|
389 | |
|
|
390 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
391 | retval = started; |
|
|
392 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
393 | |
|
|
394 | return retval; |
|
|
395 | } |
|
|
396 | |
|
|
397 | /* |
|
|
398 | * a somewhat faster data structure might be nice, but |
|
|
399 | * with 8 priorities this actually needs <20 insns |
|
|
400 | * per shift, the most expensive operation. |
|
|
401 | */ |
|
|
402 | typedef struct { |
|
|
403 | ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */ |
|
|
404 | int size; |
|
|
405 | } etp_reqq; |
|
|
406 | |
|
|
407 | static etp_reqq req_queue; |
|
|
408 | static etp_reqq res_queue; |
|
|
409 | |
|
|
410 | static void ecb_noinline ecb_cold |
|
|
411 | reqq_init (etp_reqq *q) |
|
|
412 | { |
|
|
413 | int pri; |
|
|
414 | |
|
|
415 | for (pri = 0; pri < ETP_NUM_PRI; ++pri) |
|
|
416 | q->qs[pri] = q->qe[pri] = 0; |
|
|
417 | |
|
|
418 | q->size = 0; |
|
|
419 | } |
|
|
420 | |
|
|
421 | static int ecb_noinline |
|
|
422 | reqq_push (etp_reqq *q, ETP_REQ *req) |
|
|
423 | { |
|
|
424 | int pri = req->pri; |
|
|
425 | req->next = 0; |
|
|
426 | |
|
|
427 | if (q->qe[pri]) |
|
|
428 | { |
|
|
429 | q->qe[pri]->next = req; |
|
|
430 | q->qe[pri] = req; |
|
|
431 | } |
|
|
432 | else |
|
|
433 | q->qe[pri] = q->qs[pri] = req; |
|
|
434 | |
|
|
435 | return q->size++; |
|
|
436 | } |
|
|
437 | |
|
|
438 | static ETP_REQ * ecb_noinline |
|
|
439 | reqq_shift (etp_reqq *q) |
|
|
440 | { |
|
|
441 | int pri; |
|
|
442 | |
|
|
443 | if (!q->size) |
|
|
444 | return 0; |
|
|
445 | |
|
|
446 | --q->size; |
|
|
447 | |
|
|
448 | for (pri = ETP_NUM_PRI; pri--; ) |
|
|
449 | { |
|
|
450 | eio_req *req = q->qs[pri]; |
|
|
451 | |
|
|
452 | if (req) |
|
|
453 | { |
|
|
454 | if (!(q->qs[pri] = (eio_req *)req->next)) |
|
|
455 | q->qe[pri] = 0; |
|
|
456 | |
|
|
457 | return req; |
|
|
458 | } |
|
|
459 | } |
|
|
460 | |
|
|
461 | abort (); |
|
|
462 | } |
|
|
463 | |
|
|
464 | static int ecb_cold |
|
|
465 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
|
|
466 | { |
|
|
467 | X_MUTEX_CREATE (wrklock); |
|
|
468 | X_MUTEX_CREATE (reslock); |
|
|
469 | X_MUTEX_CREATE (reqlock); |
|
|
470 | X_COND_CREATE (reqwait); |
|
|
471 | |
|
|
472 | reqq_init (&req_queue); |
|
|
473 | reqq_init (&res_queue); |
|
|
474 | |
|
|
475 | wrk_first.next = |
|
|
476 | wrk_first.prev = &wrk_first; |
|
|
477 | |
|
|
478 | started = 0; |
|
|
479 | idle = 0; |
|
|
480 | nreqs = 0; |
|
|
481 | nready = 0; |
|
|
482 | npending = 0; |
|
|
483 | |
|
|
484 | want_poll_cb = want_poll; |
|
|
485 | done_poll_cb = done_poll; |
|
|
486 | |
|
|
487 | return 0; |
|
|
488 | } |
|
|
489 | |
|
|
490 | X_THREAD_PROC (etp_proc); |
|
|
491 | |
|
|
492 | static void ecb_cold |
|
|
493 | etp_start_thread (void) |
|
|
494 | { |
|
|
495 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
|
|
496 | |
|
|
497 | /*TODO*/ |
|
|
498 | assert (("unable to allocate worker thread data", wrk)); |
|
|
499 | |
|
|
500 | X_LOCK (wrklock); |
|
|
501 | |
|
|
502 | if (thread_create (&wrk->tid, etp_proc, (void *)wrk)) |
|
|
503 | { |
|
|
504 | wrk->prev = &wrk_first; |
|
|
505 | wrk->next = wrk_first.next; |
|
|
506 | wrk_first.next->prev = wrk; |
|
|
507 | wrk_first.next = wrk; |
|
|
508 | ++started; |
|
|
509 | } |
|
|
510 | else |
|
|
511 | free (wrk); |
|
|
512 | |
|
|
513 | X_UNLOCK (wrklock); |
|
|
514 | } |
|
|
515 | |
|
|
516 | static void |
|
|
517 | etp_maybe_start_thread (void) |
|
|
518 | { |
|
|
519 | if (ecb_expect_true (etp_nthreads () >= wanted)) |
|
|
520 | return; |
|
|
521 | |
|
|
522 | /* todo: maybe use idle here, but might be less exact */ |
|
|
523 | if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())) |
|
|
524 | return; |
|
|
525 | |
|
|
526 | etp_start_thread (); |
|
|
527 | } |
|
|
528 | |
|
|
529 | static void ecb_cold |
|
|
530 | etp_end_thread (void) |
|
|
531 | { |
|
|
532 | eio_req *req = calloc (1, sizeof (eio_req)); |
|
|
533 | |
|
|
534 | req->type = -1; |
|
|
535 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
|
|
536 | |
|
|
537 | X_LOCK (reqlock); |
|
|
538 | reqq_push (&req_queue, req); |
|
|
539 | X_COND_SIGNAL (reqwait); |
|
|
540 | X_UNLOCK (reqlock); |
|
|
541 | |
|
|
542 | X_LOCK (wrklock); |
|
|
543 | --started; |
|
|
544 | X_UNLOCK (wrklock); |
|
|
545 | } |
|
|
546 | |
|
|
547 | static int |
|
|
548 | etp_poll (void) |
|
|
549 | { |
|
|
550 | unsigned int maxreqs; |
|
|
551 | unsigned int maxtime; |
|
|
552 | struct timeval tv_start, tv_now; |
|
|
553 | |
|
|
554 | X_LOCK (reslock); |
|
|
555 | maxreqs = max_poll_reqs; |
|
|
556 | maxtime = max_poll_time; |
|
|
557 | X_UNLOCK (reslock); |
|
|
558 | |
|
|
559 | if (maxtime) |
|
|
560 | gettimeofday (&tv_start, 0); |
|
|
561 | |
|
|
562 | for (;;) |
|
|
563 | { |
|
|
564 | ETP_REQ *req; |
|
|
565 | |
|
|
566 | etp_maybe_start_thread (); |
|
|
567 | |
|
|
568 | X_LOCK (reslock); |
|
|
569 | req = reqq_shift (&res_queue); |
|
|
570 | |
|
|
571 | if (req) |
|
|
572 | { |
|
|
573 | --npending; |
|
|
574 | |
|
|
575 | if (!res_queue.size && done_poll_cb) |
|
|
576 | done_poll_cb (); |
|
|
577 | } |
|
|
578 | |
|
|
579 | X_UNLOCK (reslock); |
|
|
580 | |
|
|
581 | if (!req) |
|
|
582 | return 0; |
|
|
583 | |
|
|
584 | X_LOCK (reqlock); |
|
|
585 | --nreqs; |
|
|
586 | X_UNLOCK (reqlock); |
|
|
587 | |
|
|
588 | if (ecb_expect_false (req->type == EIO_GROUP && req->size)) |
|
|
589 | { |
|
|
590 | req->int1 = 1; /* mark request as delayed */ |
|
|
591 | continue; |
|
|
592 | } |
|
|
593 | else |
|
|
594 | { |
|
|
595 | int res = ETP_FINISH (req); |
|
|
596 | if (ecb_expect_false (res)) |
|
|
597 | return res; |
|
|
598 | } |
|
|
599 | |
|
|
600 | if (ecb_expect_false (maxreqs && !--maxreqs)) |
|
|
601 | break; |
|
|
602 | |
|
|
603 | if (maxtime) |
|
|
604 | { |
|
|
605 | gettimeofday (&tv_now, 0); |
|
|
606 | |
|
|
607 | if (tvdiff (&tv_start, &tv_now) >= maxtime) |
|
|
608 | break; |
|
|
609 | } |
|
|
610 | } |
|
|
611 | |
|
|
612 | errno = EAGAIN; |
|
|
613 | return -1; |
|
|
614 | } |
|
|
615 | |
|
|
616 | static void |
|
|
617 | etp_cancel (ETP_REQ *req) |
|
|
618 | { |
|
|
619 | req->cancelled = 1; |
|
|
620 | |
|
|
621 | eio_grp_cancel (req); |
|
|
622 | } |
|
|
623 | |
|
|
624 | static void |
|
|
625 | etp_submit (ETP_REQ *req) |
|
|
626 | { |
|
|
627 | req->pri -= ETP_PRI_MIN; |
|
|
628 | |
|
|
629 | if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
|
|
630 | if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
|
|
631 | |
|
|
632 | if (ecb_expect_false (req->type == EIO_GROUP)) |
|
|
633 | { |
|
|
634 | /* I hope this is worth it :/ */ |
|
|
635 | X_LOCK (reqlock); |
|
|
636 | ++nreqs; |
|
|
637 | X_UNLOCK (reqlock); |
|
|
638 | |
|
|
639 | X_LOCK (reslock); |
|
|
640 | |
|
|
641 | ++npending; |
|
|
642 | |
|
|
643 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
|
|
644 | want_poll_cb (); |
|
|
645 | |
|
|
646 | X_UNLOCK (reslock); |
|
|
647 | } |
|
|
648 | else |
|
|
649 | { |
|
|
650 | X_LOCK (reqlock); |
|
|
651 | ++nreqs; |
|
|
652 | ++nready; |
|
|
653 | reqq_push (&req_queue, req); |
|
|
654 | X_COND_SIGNAL (reqwait); |
|
|
655 | X_UNLOCK (reqlock); |
|
|
656 | |
|
|
657 | etp_maybe_start_thread (); |
|
|
658 | } |
|
|
659 | } |
|
|
660 | |
|
|
661 | static void ecb_cold |
|
|
662 | etp_set_max_poll_time (double nseconds) |
|
|
663 | { |
|
|
664 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
|
|
665 | max_poll_time = nseconds * EIO_TICKS; |
|
|
666 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
|
|
667 | } |
|
|
668 | |
|
|
669 | static void ecb_cold |
|
|
670 | etp_set_max_poll_reqs (unsigned int maxreqs) |
|
|
671 | { |
|
|
672 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
|
|
673 | max_poll_reqs = maxreqs; |
|
|
674 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
|
|
675 | } |
|
|
676 | |
|
|
677 | static void ecb_cold |
|
|
678 | etp_set_max_idle (unsigned int nthreads) |
|
|
679 | { |
|
|
680 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
681 | max_idle = nthreads; |
|
|
682 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
683 | } |
|
|
684 | |
|
|
685 | static void ecb_cold |
|
|
686 | etp_set_idle_timeout (unsigned int seconds) |
|
|
687 | { |
|
|
688 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
689 | idle_timeout = seconds; |
|
|
690 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
691 | } |
|
|
692 | |
|
|
693 | static void ecb_cold |
|
|
694 | etp_set_min_parallel (unsigned int nthreads) |
|
|
695 | { |
|
|
696 | if (wanted < nthreads) |
|
|
697 | wanted = nthreads; |
|
|
698 | } |
|
|
699 | |
|
|
700 | static void ecb_cold |
|
|
701 | etp_set_max_parallel (unsigned int nthreads) |
|
|
702 | { |
|
|
703 | if (wanted > nthreads) |
|
|
704 | wanted = nthreads; |
|
|
705 | |
|
|
706 | while (started > wanted) |
|
|
707 | etp_end_thread (); |
|
|
708 | } |
|
|
709 | |
390 | |
710 | /*****************************************************************************/ |
391 | /*****************************************************************************/ |
711 | |
392 | |
712 | static void |
393 | static void |
713 | grp_try_feed (eio_req *grp) |
394 | grp_try_feed (eio_req *grp) |
714 | { |
395 | { |
715 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
396 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
716 | { |
397 | { |
717 | grp->flags &= ~EIO_FLAG_GROUPADD; |
398 | grp->flags &= ~ETP_FLAG_GROUPADD; |
718 | |
399 | |
719 | EIO_FEED (grp); |
400 | EIO_FEED (grp); |
720 | |
401 | |
721 | /* stop if no progress has been made */ |
402 | /* stop if no progress has been made */ |
722 | if (!(grp->flags & EIO_FLAG_GROUPADD)) |
403 | if (!(grp->flags & ETP_FLAG_GROUPADD)) |
723 | { |
404 | { |
724 | grp->feed = 0; |
405 | grp->feed = 0; |
725 | break; |
406 | break; |
726 | } |
407 | } |
727 | } |
408 | } |
… | |
… | |
734 | |
415 | |
735 | /* call feeder, if applicable */ |
416 | /* call feeder, if applicable */ |
736 | grp_try_feed (grp); |
417 | grp_try_feed (grp); |
737 | |
418 | |
738 | /* finish, if done */ |
419 | /* finish, if done */ |
739 | if (!grp->size && grp->int1) |
420 | if (!grp->size && grp->flags & ETP_FLAG_DELAYED) |
740 | return eio_finish (grp); |
421 | return eio_finish (grp); |
741 | else |
422 | else |
742 | return 0; |
423 | return 0; |
743 | } |
424 | } |
744 | |
425 | |
… | |
… | |
780 | } |
461 | } |
781 | |
462 | |
782 | void |
463 | void |
783 | eio_grp_cancel (eio_req *grp) |
464 | eio_grp_cancel (eio_req *grp) |
784 | { |
465 | { |
785 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
466 | etp_grp_cancel (EIO_POOL, grp); |
786 | eio_cancel (grp); |
|
|
787 | } |
467 | } |
788 | |
468 | |
789 | void |
469 | void |
790 | eio_cancel (eio_req *req) |
470 | eio_cancel (eio_req *req) |
791 | { |
471 | { |
792 | etp_cancel (req); |
472 | etp_cancel (EIO_POOL, req); |
793 | } |
473 | } |
794 | |
474 | |
795 | void |
475 | void |
796 | eio_submit (eio_req *req) |
476 | eio_submit (eio_req *req) |
797 | { |
477 | { |
798 | etp_submit (req); |
478 | etp_submit (EIO_POOL, req); |
799 | } |
479 | } |
800 | |
480 | |
801 | unsigned int |
481 | unsigned int |
802 | eio_nreqs (void) |
482 | eio_nreqs (void) |
803 | { |
483 | { |
804 | return etp_nreqs (); |
484 | return etp_nreqs (EIO_POOL); |
805 | } |
485 | } |
806 | |
486 | |
807 | unsigned int |
487 | unsigned int |
808 | eio_nready (void) |
488 | eio_nready (void) |
809 | { |
489 | { |
810 | return etp_nready (); |
490 | return etp_nready (EIO_POOL); |
811 | } |
491 | } |
812 | |
492 | |
813 | unsigned int |
493 | unsigned int |
814 | eio_npending (void) |
494 | eio_npending (void) |
815 | { |
495 | { |
816 | return etp_npending (); |
496 | return etp_npending (EIO_POOL); |
817 | } |
497 | } |
818 | |
498 | |
819 | unsigned int ecb_cold |
499 | unsigned int ecb_cold |
820 | eio_nthreads (void) |
500 | eio_nthreads (void) |
821 | { |
501 | { |
822 | return etp_nthreads (); |
502 | return etp_nthreads (EIO_POOL); |
823 | } |
503 | } |
824 | |
504 | |
825 | void ecb_cold |
505 | void ecb_cold |
826 | eio_set_max_poll_time (double nseconds) |
506 | eio_set_max_poll_time (double nseconds) |
827 | { |
507 | { |
828 | etp_set_max_poll_time (nseconds); |
508 | etp_set_max_poll_time (EIO_POOL, nseconds); |
829 | } |
509 | } |
830 | |
510 | |
831 | void ecb_cold |
511 | void ecb_cold |
832 | eio_set_max_poll_reqs (unsigned int maxreqs) |
512 | eio_set_max_poll_reqs (unsigned int maxreqs) |
833 | { |
513 | { |
834 | etp_set_max_poll_reqs (maxreqs); |
514 | etp_set_max_poll_reqs (EIO_POOL, maxreqs); |
835 | } |
515 | } |
836 | |
516 | |
837 | void ecb_cold |
517 | void ecb_cold |
838 | eio_set_max_idle (unsigned int nthreads) |
518 | eio_set_max_idle (unsigned int nthreads) |
839 | { |
519 | { |
840 | etp_set_max_idle (nthreads); |
520 | etp_set_max_idle (EIO_POOL, nthreads); |
841 | } |
521 | } |
842 | |
522 | |
843 | void ecb_cold |
523 | void ecb_cold |
844 | eio_set_idle_timeout (unsigned int seconds) |
524 | eio_set_idle_timeout (unsigned int seconds) |
845 | { |
525 | { |
846 | etp_set_idle_timeout (seconds); |
526 | etp_set_idle_timeout (EIO_POOL, seconds); |
847 | } |
527 | } |
848 | |
528 | |
849 | void ecb_cold |
529 | void ecb_cold |
850 | eio_set_min_parallel (unsigned int nthreads) |
530 | eio_set_min_parallel (unsigned int nthreads) |
851 | { |
531 | { |
852 | etp_set_min_parallel (nthreads); |
532 | etp_set_min_parallel (EIO_POOL, nthreads); |
853 | } |
533 | } |
854 | |
534 | |
855 | void ecb_cold |
535 | void ecb_cold |
856 | eio_set_max_parallel (unsigned int nthreads) |
536 | eio_set_max_parallel (unsigned int nthreads) |
857 | { |
537 | { |
858 | etp_set_max_parallel (nthreads); |
538 | etp_set_max_parallel (EIO_POOL, nthreads); |
859 | } |
539 | } |
860 | |
540 | |
861 | int eio_poll (void) |
541 | int eio_poll (void) |
862 | { |
542 | { |
863 | return etp_poll (); |
543 | return etp_poll (EIO_POOL); |
864 | } |
544 | } |
865 | |
545 | |
866 | /*****************************************************************************/ |
546 | /*****************************************************************************/ |
867 | /* work around various missing functions */ |
547 | /* work around various missing functions */ |
868 | |
|
|
869 | #if !HAVE_PREADWRITE |
|
|
870 | # undef pread |
|
|
871 | # undef pwrite |
|
|
872 | # define pread eio__pread |
|
|
873 | # define pwrite eio__pwrite |
|
|
874 | |
|
|
875 | static eio_ssize_t |
|
|
876 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
|
|
877 | { |
|
|
878 | eio_ssize_t res; |
|
|
879 | off_t ooffset; |
|
|
880 | |
|
|
881 | X_LOCK (preadwritelock); |
|
|
882 | ooffset = lseek (fd, 0, SEEK_CUR); |
|
|
883 | lseek (fd, offset, SEEK_SET); |
|
|
884 | res = read (fd, buf, count); |
|
|
885 | lseek (fd, ooffset, SEEK_SET); |
|
|
886 | X_UNLOCK (preadwritelock); |
|
|
887 | |
|
|
888 | return res; |
|
|
889 | } |
|
|
890 | |
|
|
891 | static eio_ssize_t |
|
|
892 | eio__pwrite (int fd, void *buf, size_t count, off_t offset) |
|
|
893 | { |
|
|
894 | eio_ssize_t res; |
|
|
895 | off_t ooffset; |
|
|
896 | |
|
|
897 | X_LOCK (preadwritelock); |
|
|
898 | ooffset = lseek (fd, 0, SEEK_CUR); |
|
|
899 | lseek (fd, offset, SEEK_SET); |
|
|
900 | res = write (fd, buf, count); |
|
|
901 | lseek (fd, ooffset, SEEK_SET); |
|
|
902 | X_UNLOCK (preadwritelock); |
|
|
903 | |
|
|
904 | return res; |
|
|
905 | } |
|
|
906 | #endif |
|
|
907 | |
548 | |
908 | #ifndef HAVE_UTIMES |
549 | #ifndef HAVE_UTIMES |
909 | |
550 | |
910 | # undef utimes |
551 | # undef utimes |
911 | # define utimes(path,times) eio__utimes (path, times) |
552 | # define utimes(path,times) eio__utimes (path, times) |
… | |
… | |
953 | int res; |
594 | int res; |
954 | |
595 | |
955 | #if HAVE_SYS_SYNCFS |
596 | #if HAVE_SYS_SYNCFS |
956 | res = (int)syscall (__NR_syncfs, (int)(fd)); |
597 | res = (int)syscall (__NR_syncfs, (int)(fd)); |
957 | #else |
598 | #else |
958 | res = -1; |
599 | res = EIO_ENOSYS (); |
959 | errno = ENOSYS; |
|
|
960 | #endif |
600 | #endif |
961 | |
601 | |
962 | if (res < 0 && errno == ENOSYS && fd >= 0) |
602 | if (res < 0 && errno == ENOSYS && fd >= 0) |
963 | sync (); |
603 | sync (); |
964 | |
604 | |
… | |
… | |
994 | } |
634 | } |
995 | |
635 | |
996 | static int |
636 | static int |
997 | eio__fallocate (int fd, int mode, off_t offset, size_t len) |
637 | eio__fallocate (int fd, int mode, off_t offset, size_t len) |
998 | { |
638 | { |
999 | #if HAVE_FALLOCATE |
639 | #if HAVE_LINUX_FALLOCATE |
1000 | return fallocate (fd, mode, offset, len); |
640 | return fallocate (fd, mode, offset, len); |
1001 | #else |
641 | #else |
1002 | errno = ENOSYS; |
642 | return EIO_ENOSYS (); |
1003 | return -1; |
|
|
1004 | #endif |
643 | #endif |
1005 | } |
644 | } |
1006 | |
645 | |
1007 | #if !HAVE_READAHEAD |
646 | #if !HAVE_READAHEAD |
1008 | # undef readahead |
647 | # undef readahead |
… | |
… | |
1023 | todo -= len; |
662 | todo -= len; |
1024 | } |
663 | } |
1025 | |
664 | |
1026 | FUBd; |
665 | FUBd; |
1027 | |
666 | |
1028 | errno = 0; |
667 | /* linux's readahead basically only fails for EBADF or EINVAL (not mmappable) */ |
|
|
668 | /* but not for e.g. EIO or eof, so we also never fail */ |
1029 | return count; |
669 | return 0; |
1030 | } |
670 | } |
1031 | |
671 | |
1032 | #endif |
672 | #endif |
1033 | |
673 | |
1034 | /* sendfile always needs emulation */ |
674 | /* sendfile always needs emulation */ |
… | |
… | |
1069 | |
709 | |
1070 | /* according to source inspection, this is correct, and useful behaviour */ |
710 | /* according to source inspection, this is correct, and useful behaviour */ |
1071 | if (sbytes) |
711 | if (sbytes) |
1072 | res = sbytes; |
712 | res = sbytes; |
1073 | |
713 | |
1074 | # elif defined (__APPLE__) |
714 | # elif defined __APPLE__ |
1075 | off_t sbytes = count; |
715 | off_t sbytes = count; |
1076 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
716 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
1077 | |
717 | |
1078 | /* according to the manpage, sbytes is always valid */ |
718 | /* according to the manpage, sbytes is always valid */ |
1079 | if (sbytes) |
719 | if (sbytes) |
… | |
… | |
1106 | HANDLE h = TO_SOCKET (ifd); |
746 | HANDLE h = TO_SOCKET (ifd); |
1107 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
747 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
1108 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
748 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
1109 | |
749 | |
1110 | #else |
750 | #else |
1111 | res = -1; |
751 | res = EIO_ENOSYS (); |
1112 | errno = ENOSYS; |
|
|
1113 | #endif |
752 | #endif |
1114 | |
753 | |
1115 | /* we assume sendfile can copy at least 128mb in one go */ |
754 | /* we assume sendfile can copy at least 128mb in one go */ |
1116 | if (res <= 128 * 1024 * 1024) |
755 | if (res <= 128 * 1024 * 1024) |
1117 | { |
756 | { |
… | |
… | |
1304 | |
943 | |
1305 | /*****************************************************************************/ |
944 | /*****************************************************************************/ |
1306 | /* requests implemented outside eio_execute, because they are so large */ |
945 | /* requests implemented outside eio_execute, because they are so large */ |
1307 | |
946 | |
1308 | static void |
947 | static void |
1309 | eio__realpath (eio_req *req, etp_worker *self) |
948 | eio__lseek (eio_req *req) |
1310 | { |
949 | { |
1311 | char *rel = req->ptr1; |
950 | /* this usually gets optimised away completely, or your compiler sucks, */ |
|
|
951 | /* or the whence constants really are not 0, 1, 2 */ |
|
|
952 | int whence = req->int2 == EIO_SEEK_SET ? SEEK_SET |
|
|
953 | : req->int2 == EIO_SEEK_CUR ? SEEK_CUR |
|
|
954 | : req->int2 == EIO_SEEK_END ? SEEK_END |
|
|
955 | : req->int2; |
|
|
956 | |
|
|
957 | req->offs = lseek (req->int1, req->offs, whence); |
|
|
958 | req->result = req->offs == (off_t)-1 ? -1 : 0; |
|
|
959 | } |
|
|
960 | |
|
|
961 | /* result will always end up in tmpbuf, there is always space for adding a 0-byte */ |
|
|
962 | static int |
|
|
963 | eio__realpath (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path) |
|
|
964 | { |
1312 | char *res; |
965 | char *res; |
|
|
966 | const char *rel = path; |
1313 | char *tmp1, *tmp2; |
967 | char *tmp1, *tmp2; |
1314 | #if SYMLOOP_MAX > 32 |
968 | #if SYMLOOP_MAX > 32 |
1315 | int symlinks = SYMLOOP_MAX; |
969 | int symlinks = SYMLOOP_MAX; |
1316 | #else |
970 | #else |
1317 | int symlinks = 32; |
971 | int symlinks = 32; |
1318 | #endif |
972 | #endif |
1319 | |
973 | |
1320 | req->result = -1; |
|
|
1321 | |
|
|
1322 | errno = EINVAL; |
974 | errno = EINVAL; |
1323 | if (!rel) |
975 | if (!rel) |
1324 | return; |
976 | return -1; |
1325 | |
977 | |
1326 | errno = ENOENT; |
978 | errno = ENOENT; |
1327 | if (!*rel) |
979 | if (!*rel) |
1328 | return; |
980 | return -1; |
1329 | |
981 | |
1330 | if (!req->ptr2) |
982 | res = etp_tmpbuf_get (tmpbuf, PATH_MAX * 3); |
1331 | { |
983 | #ifdef _WIN32 |
1332 | X_LOCK (wrklock); |
984 | if (_access (rel, 4) != 0) |
1333 | req->flags |= EIO_FLAG_PTR2_FREE; |
|
|
1334 | X_UNLOCK (wrklock); |
|
|
1335 | req->ptr2 = malloc (PATH_MAX * 3); |
|
|
1336 | |
|
|
1337 | errno = ENOMEM; |
|
|
1338 | if (!req->ptr2) |
|
|
1339 | return; |
985 | return -1; |
1340 | } |
|
|
1341 | |
986 | |
1342 | res = req->ptr2; |
987 | symlinks = GetFullPathName (rel, PATH_MAX * 3, res, 0); |
|
|
988 | |
|
|
989 | errno = ENAMETOOLONG; |
|
|
990 | if (symlinks >= PATH_MAX * 3) |
|
|
991 | return -1; |
|
|
992 | |
|
|
993 | errno = EIO; |
|
|
994 | if (symlinks <= 0) |
|
|
995 | return -1; |
|
|
996 | |
|
|
997 | return symlinks; |
|
|
998 | |
|
|
999 | #else |
1343 | tmp1 = res + PATH_MAX; |
1000 | tmp1 = res + PATH_MAX; |
1344 | tmp2 = tmp1 + PATH_MAX; |
1001 | tmp2 = tmp1 + PATH_MAX; |
1345 | |
1002 | |
1346 | #if 0 /* disabled, the musl way to do things is just too racy */ |
1003 | #if 0 /* disabled, the musl way to do things is just too racy */ |
1347 | #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME) |
1004 | #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME) |
… | |
… | |
1351 | |
1008 | |
1352 | if (fd >= 0) |
1009 | if (fd >= 0) |
1353 | { |
1010 | { |
1354 | sprintf (tmp1, "/proc/self/fd/%d", fd); |
1011 | sprintf (tmp1, "/proc/self/fd/%d", fd); |
1355 | req->result = readlink (tmp1, res, PATH_MAX); |
1012 | req->result = readlink (tmp1, res, PATH_MAX); |
|
|
1013 | /* here we should probably stat the open file and the disk file, to make sure they still match */ |
1356 | close (fd); |
1014 | close (fd); |
1357 | |
|
|
1358 | /* here we should probably stat the open file and the disk file, to make sure they still match */ |
|
|
1359 | |
1015 | |
1360 | if (req->result > 0) |
1016 | if (req->result > 0) |
1361 | goto done; |
1017 | goto done; |
1362 | } |
1018 | } |
1363 | else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO) |
1019 | else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO) |
1364 | return; |
1020 | return -1; |
1365 | } |
1021 | } |
1366 | #endif |
1022 | #endif |
1367 | #endif |
1023 | #endif |
1368 | |
1024 | |
1369 | if (*rel != '/') |
1025 | if (*rel != '/') |
1370 | { |
1026 | { |
|
|
1027 | int len; |
|
|
1028 | |
|
|
1029 | errno = ENOENT; |
|
|
1030 | if (wd == EIO_INVALID_WD) |
|
|
1031 | return -1; |
|
|
1032 | |
|
|
1033 | if (wd == EIO_CWD) |
|
|
1034 | { |
1371 | if (!getcwd (res, PATH_MAX)) |
1035 | if (!getcwd (res, PATH_MAX)) |
1372 | return; |
1036 | return -1; |
|
|
1037 | |
|
|
1038 | len = strlen (res); |
|
|
1039 | } |
|
|
1040 | else |
|
|
1041 | memcpy (res, wd->str, len = wd->len); |
1373 | |
1042 | |
1374 | if (res [1]) /* only use if not / */ |
1043 | if (res [1]) /* only use if not / */ |
1375 | res += strlen (res); |
1044 | res += len; |
1376 | } |
1045 | } |
1377 | |
1046 | |
1378 | while (*rel) |
1047 | while (*rel) |
1379 | { |
1048 | { |
1380 | eio_ssize_t len, linklen; |
1049 | eio_ssize_t len, linklen; |
1381 | char *beg = rel; |
1050 | const char *beg = rel; |
1382 | |
1051 | |
1383 | while (*rel && *rel != '/') |
1052 | while (*rel && *rel != '/') |
1384 | ++rel; |
1053 | ++rel; |
1385 | |
1054 | |
1386 | len = rel - beg; |
1055 | len = rel - beg; |
… | |
… | |
1398 | |
1067 | |
1399 | if (beg [1] == '.' && len == 2) |
1068 | if (beg [1] == '.' && len == 2) |
1400 | { |
1069 | { |
1401 | /* .. - back up one component, if possible */ |
1070 | /* .. - back up one component, if possible */ |
1402 | |
1071 | |
1403 | while (res != req->ptr2) |
1072 | while (res != tmpbuf->ptr) |
1404 | if (*--res == '/') |
1073 | if (*--res == '/') |
1405 | break; |
1074 | break; |
1406 | |
1075 | |
1407 | continue; |
1076 | continue; |
1408 | } |
1077 | } |
1409 | } |
1078 | } |
1410 | |
1079 | |
1411 | errno = ENAMETOOLONG; |
1080 | errno = ENAMETOOLONG; |
1412 | if (res + 1 + len + 1 >= tmp1) |
1081 | if (res + 1 + len + 1 >= tmp1) |
1413 | return; |
1082 | return -1; |
1414 | |
1083 | |
1415 | /* copy one component */ |
1084 | /* copy one component */ |
1416 | *res = '/'; |
1085 | *res = '/'; |
1417 | memcpy (res + 1, beg, len); |
1086 | memcpy (res + 1, beg, len); |
1418 | |
1087 | |
1419 | /* zero-terminate, for readlink */ |
1088 | /* zero-terminate, for readlink */ |
1420 | res [len + 1] = 0; |
1089 | res [len + 1] = 0; |
1421 | |
1090 | |
1422 | /* now check if it's a symlink */ |
1091 | /* now check if it's a symlink */ |
1423 | linklen = readlink (req->ptr2, tmp1, PATH_MAX); |
1092 | linklen = readlink (tmpbuf->ptr, tmp1, PATH_MAX); |
1424 | |
1093 | |
1425 | if (linklen < 0) |
1094 | if (linklen < 0) |
1426 | { |
1095 | { |
1427 | if (errno != EINVAL) |
1096 | if (errno != EINVAL) |
1428 | return; |
1097 | return -1; |
1429 | |
1098 | |
1430 | /* it's a normal directory. hopefully */ |
1099 | /* it's a normal directory. hopefully */ |
1431 | res += len + 1; |
1100 | res += len + 1; |
1432 | } |
1101 | } |
1433 | else |
1102 | else |
… | |
… | |
1435 | /* yay, it was a symlink - build new path in tmp2 */ |
1104 | /* yay, it was a symlink - build new path in tmp2 */ |
1436 | int rellen = strlen (rel); |
1105 | int rellen = strlen (rel); |
1437 | |
1106 | |
1438 | errno = ENAMETOOLONG; |
1107 | errno = ENAMETOOLONG; |
1439 | if (linklen + 1 + rellen >= PATH_MAX) |
1108 | if (linklen + 1 + rellen >= PATH_MAX) |
1440 | return; |
1109 | return -1; |
1441 | |
1110 | |
1442 | errno = ELOOP; |
1111 | errno = ELOOP; |
1443 | if (!--symlinks) |
1112 | if (!--symlinks) |
1444 | return; |
1113 | return -1; |
1445 | |
1114 | |
1446 | if (*tmp1 == '/') |
1115 | if (*tmp1 == '/') |
1447 | res = req->ptr2; /* symlink resolves to an absolute path */ |
1116 | res = tmpbuf->ptr; /* symlink resolves to an absolute path */ |
1448 | |
1117 | |
1449 | /* we need to be careful, as rel might point into tmp2 already */ |
1118 | /* we need to be careful, as rel might point into tmp2 already */ |
1450 | memmove (tmp2 + linklen + 1, rel, rellen + 1); |
1119 | memmove (tmp2 + linklen + 1, rel, rellen + 1); |
1451 | tmp2 [linklen] = '/'; |
1120 | tmp2 [linklen] = '/'; |
1452 | memcpy (tmp2, tmp1, linklen); |
1121 | memcpy (tmp2, tmp1, linklen); |
… | |
… | |
1454 | rel = tmp2; |
1123 | rel = tmp2; |
1455 | } |
1124 | } |
1456 | } |
1125 | } |
1457 | |
1126 | |
1458 | /* special case for the lone root path */ |
1127 | /* special case for the lone root path */ |
1459 | if (res == req->ptr2) |
1128 | if (res == tmpbuf->ptr) |
1460 | *res++ = '/'; |
1129 | *res++ = '/'; |
1461 | |
1130 | |
1462 | req->result = res - (char *)req->ptr2; |
1131 | return res - (char *)tmpbuf->ptr; |
1463 | |
1132 | #endif |
1464 | done: |
|
|
1465 | req->ptr2 = realloc (req->ptr2, req->result); /* trade time for space savings */ |
|
|
1466 | } |
1133 | } |
1467 | |
1134 | |
1468 | static signed char |
1135 | static signed char |
1469 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
1136 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
1470 | { |
1137 | { |
… | |
… | |
1658 | #ifdef _WIN32 |
1325 | #ifdef _WIN32 |
1659 | { |
1326 | { |
1660 | int len = strlen ((const char *)req->ptr1); |
1327 | int len = strlen ((const char *)req->ptr1); |
1661 | char *path = malloc (MAX_PATH); |
1328 | char *path = malloc (MAX_PATH); |
1662 | const char *fmt; |
1329 | const char *fmt; |
|
|
1330 | const char *reqpath = wd_expand (&self->tmpbuf, req->wd, req->ptr1); |
1663 | |
1331 | |
1664 | if (!len) |
1332 | if (!len) |
1665 | fmt = "./*"; |
1333 | fmt = "./*"; |
1666 | else if (((const char *)req->ptr1)[len - 1] == '/' || ((const char *)req->ptr1)[len - 1] == '\\') |
1334 | else if (reqpath[len - 1] == '/' || reqpath[len - 1] == '\\') |
1667 | fmt = "%s*"; |
1335 | fmt = "%s*"; |
1668 | else |
1336 | else |
1669 | fmt = "%s/*"; |
1337 | fmt = "%s/*"; |
1670 | |
1338 | |
1671 | _snprintf (path, MAX_PATH, fmt, (const char *)req->ptr1); |
1339 | _snprintf (path, MAX_PATH, fmt, reqpath); |
1672 | dirp = FindFirstFile (path, &entp); |
1340 | dirp = FindFirstFile (path, &entp); |
1673 | free (path); |
1341 | free (path); |
1674 | |
1342 | |
1675 | if (dirp == INVALID_HANDLE_VALUE) |
1343 | if (dirp == INVALID_HANDLE_VALUE) |
1676 | { |
1344 | { |
1677 | dirp = 0; |
1345 | /* should steal _dosmaperr */ |
1678 | |
|
|
1679 | switch (GetLastError ()) |
1346 | switch (GetLastError ()) |
1680 | { |
1347 | { |
1681 | case ERROR_FILE_NOT_FOUND: |
1348 | case ERROR_FILE_NOT_FOUND: |
1682 | req->result = 0; |
1349 | req->result = 0; |
1683 | break; |
1350 | break; |
1684 | |
1351 | |
1685 | case ERROR_INVALID_NAME: |
1352 | case ERROR_INVALID_NAME: |
1686 | case ERROR_PATH_NOT_FOUND: |
1353 | case ERROR_PATH_NOT_FOUND: |
1687 | case ERROR_NO_MORE_FILES: |
1354 | case ERROR_NO_MORE_FILES: |
1688 | errno = ENOENT; |
1355 | errno = ENOENT; |
1689 | break; |
1356 | break; |
1690 | |
1357 | |
1691 | case ERROR_NOT_ENOUGH_MEMORY: |
1358 | case ERROR_NOT_ENOUGH_MEMORY: |
1692 | errno = ENOMEM; |
1359 | errno = ENOMEM; |
1693 | break; |
1360 | break; |
1694 | |
1361 | |
1695 | default: |
1362 | default: |
1696 | errno = EINVAL; |
1363 | errno = EINVAL; |
1697 | break; |
1364 | break; |
1698 | } |
1365 | } |
|
|
1366 | |
|
|
1367 | return; |
1699 | } |
1368 | } |
1700 | } |
1369 | } |
1701 | #else |
1370 | #else |
|
|
1371 | #if HAVE_AT |
|
|
1372 | if (req->wd) |
|
|
1373 | { |
|
|
1374 | int fd = openat (WD2FD (req->wd), req->ptr1, O_CLOEXEC | O_SEARCH | O_DIRECTORY); |
|
|
1375 | |
|
|
1376 | if (fd < 0) |
|
|
1377 | return; |
|
|
1378 | |
|
|
1379 | dirp = fdopendir (fd); |
|
|
1380 | |
|
|
1381 | if (!dirp) |
|
|
1382 | close (fd); |
|
|
1383 | } |
|
|
1384 | else |
1702 | dirp = opendir (req->ptr1); |
1385 | dirp = opendir (req->ptr1); |
|
|
1386 | #else |
|
|
1387 | dirp = opendir (wd_expand (&self->tmpbuf, req->wd, req->ptr1)); |
|
|
1388 | #endif |
|
|
1389 | |
|
|
1390 | if (!dirp) |
|
|
1391 | return; |
1703 | #endif |
1392 | #endif |
1704 | |
1393 | |
1705 | if (req->flags & EIO_FLAG_PTR1_FREE) |
1394 | if (req->flags & EIO_FLAG_PTR1_FREE) |
1706 | free (req->ptr1); |
1395 | free (req->ptr1); |
1707 | |
1396 | |
1708 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1397 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1709 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1398 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1710 | req->ptr2 = names = malloc (namesalloc); |
1399 | req->ptr2 = names = malloc (namesalloc); |
1711 | |
1400 | |
1712 | if (dirp && names && (!flags || dents)) |
1401 | if (!names || (flags && !dents)) |
|
|
1402 | return; |
|
|
1403 | |
1713 | for (;;) |
1404 | for (;;) |
1714 | { |
1405 | { |
1715 | int done; |
1406 | int done; |
1716 | |
1407 | |
1717 | #ifdef _WIN32 |
1408 | #ifdef _WIN32 |
1718 | done = !dirp; |
1409 | done = !dirp; |
1719 | #else |
1410 | #else |
1720 | errno = 0; |
1411 | errno = 0; |
1721 | entp = readdir (dirp); |
1412 | entp = readdir (dirp); |
1722 | done = !entp; |
1413 | done = !entp; |
1723 | #endif |
1414 | #endif |
1724 | |
1415 | |
1725 | if (done) |
1416 | if (done) |
1726 | { |
1417 | { |
1727 | #ifndef _WIN32 |
1418 | #ifndef _WIN32 |
1728 | int old_errno = errno; |
1419 | int old_errno = errno; |
1729 | closedir (dirp); |
1420 | closedir (dirp); |
1730 | errno = old_errno; |
1421 | errno = old_errno; |
1731 | |
1422 | |
1732 | if (errno) |
1423 | if (errno) |
1733 | break; |
1424 | break; |
1734 | #endif |
1425 | #endif |
1735 | |
1426 | |
1736 | /* sort etc. */ |
1427 | /* sort etc. */ |
1737 | req->int1 = flags; |
1428 | req->int1 = flags; |
1738 | req->result = dentoffs; |
1429 | req->result = dentoffs; |
1739 | |
1430 | |
1740 | if (flags & EIO_READDIR_STAT_ORDER) |
1431 | if (flags & EIO_READDIR_STAT_ORDER) |
1741 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
1432 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
1742 | else if (flags & EIO_READDIR_DIRS_FIRST) |
1433 | else if (flags & EIO_READDIR_DIRS_FIRST) |
1743 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
1434 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
1744 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
1435 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
1745 | else |
1436 | else |
|
|
1437 | { |
|
|
1438 | /* in this case, all is known, and we just put dirs first and sort them */ |
|
|
1439 | eio_dirent *oth = dents + dentoffs; |
|
|
1440 | eio_dirent *dir = dents; |
|
|
1441 | |
|
|
1442 | /* now partition dirs to the front, and non-dirs to the back */ |
|
|
1443 | /* by walking from both sides and swapping if necessary */ |
|
|
1444 | while (oth > dir) |
|
|
1445 | { |
|
|
1446 | if (dir->type == EIO_DT_DIR) |
|
|
1447 | ++dir; |
|
|
1448 | else if ((--oth)->type == EIO_DT_DIR) |
|
|
1449 | { |
|
|
1450 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
|
|
1451 | |
|
|
1452 | ++dir; |
|
|
1453 | } |
|
|
1454 | } |
|
|
1455 | |
|
|
1456 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1457 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
|
|
1458 | } |
|
|
1459 | |
|
|
1460 | break; |
|
|
1461 | } |
|
|
1462 | |
|
|
1463 | /* now add the entry to our list(s) */ |
|
|
1464 | name = D_NAME (entp); |
|
|
1465 | |
|
|
1466 | /* skip . and .. entries */ |
|
|
1467 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
|
|
1468 | { |
|
|
1469 | int len = D_NAMLEN (entp) + 1; |
|
|
1470 | |
|
|
1471 | while (ecb_expect_false (namesoffs + len > namesalloc)) |
|
|
1472 | { |
|
|
1473 | namesalloc *= 2; |
|
|
1474 | req->ptr2 = names = realloc (names, namesalloc); |
|
|
1475 | |
|
|
1476 | if (!names) |
|
|
1477 | break; |
|
|
1478 | } |
|
|
1479 | |
|
|
1480 | memcpy (names + namesoffs, name, len); |
|
|
1481 | |
|
|
1482 | if (dents) |
|
|
1483 | { |
|
|
1484 | struct eio_dirent *ent; |
|
|
1485 | |
|
|
1486 | if (ecb_expect_false (dentoffs == dentalloc)) |
1746 | { |
1487 | { |
1747 | /* in this case, all is known, and we just put dirs first and sort them */ |
1488 | dentalloc *= 2; |
|
|
1489 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
|
|
1490 | |
|
|
1491 | if (!dents) |
|
|
1492 | break; |
|
|
1493 | } |
|
|
1494 | |
1748 | eio_dirent *oth = dents + dentoffs; |
1495 | ent = dents + dentoffs; |
1749 | eio_dirent *dir = dents; |
|
|
1750 | |
1496 | |
1751 | /* now partition dirs to the front, and non-dirs to the back */ |
1497 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
1752 | /* by walking from both sides and swapping if necessary */ |
1498 | ent->namelen = len - 1; |
1753 | while (oth > dir) |
1499 | ent->inode = D_INO (entp); |
|
|
1500 | |
|
|
1501 | inode_bits |= ent->inode; |
|
|
1502 | |
|
|
1503 | switch (D_TYPE (entp)) |
|
|
1504 | { |
|
|
1505 | default: |
|
|
1506 | ent->type = EIO_DT_UNKNOWN; |
|
|
1507 | flags |= EIO_READDIR_FOUND_UNKNOWN; |
|
|
1508 | break; |
|
|
1509 | |
|
|
1510 | #ifdef DT_FIFO |
|
|
1511 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
|
|
1512 | #endif |
|
|
1513 | #ifdef DT_CHR |
|
|
1514 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
|
|
1515 | #endif |
|
|
1516 | #ifdef DT_MPC |
|
|
1517 | case DT_MPC: ent->type = EIO_DT_MPC; break; |
|
|
1518 | #endif |
|
|
1519 | #ifdef DT_DIR |
|
|
1520 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
|
|
1521 | #endif |
|
|
1522 | #ifdef DT_NAM |
|
|
1523 | case DT_NAM: ent->type = EIO_DT_NAM; break; |
|
|
1524 | #endif |
|
|
1525 | #ifdef DT_BLK |
|
|
1526 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
|
|
1527 | #endif |
|
|
1528 | #ifdef DT_MPB |
|
|
1529 | case DT_MPB: ent->type = EIO_DT_MPB; break; |
|
|
1530 | #endif |
|
|
1531 | #ifdef DT_REG |
|
|
1532 | case DT_REG: ent->type = EIO_DT_REG; break; |
|
|
1533 | #endif |
|
|
1534 | #ifdef DT_NWK |
|
|
1535 | case DT_NWK: ent->type = EIO_DT_NWK; break; |
|
|
1536 | #endif |
|
|
1537 | #ifdef DT_CMP |
|
|
1538 | case DT_CMP: ent->type = EIO_DT_CMP; break; |
|
|
1539 | #endif |
|
|
1540 | #ifdef DT_LNK |
|
|
1541 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
|
|
1542 | #endif |
|
|
1543 | #ifdef DT_SOCK |
|
|
1544 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
|
|
1545 | #endif |
|
|
1546 | #ifdef DT_DOOR |
|
|
1547 | case DT_DOOR: ent->type = EIO_DT_DOOR; break; |
|
|
1548 | #endif |
|
|
1549 | #ifdef DT_WHT |
|
|
1550 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
|
|
1551 | #endif |
|
|
1552 | } |
|
|
1553 | |
|
|
1554 | ent->score = 7; |
|
|
1555 | |
|
|
1556 | if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1557 | { |
|
|
1558 | if (ent->type == EIO_DT_UNKNOWN) |
1754 | { |
1559 | { |
1755 | if (dir->type == EIO_DT_DIR) |
1560 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1756 | ++dir; |
1561 | ent->score = 1; |
1757 | else if ((--oth)->type == EIO_DT_DIR) |
1562 | else if (!strchr (name, '.')) /* absence of dots indicate likely dirs */ |
1758 | { |
1563 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
1759 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
|
|
1760 | |
|
|
1761 | ++dir; |
|
|
1762 | } |
|
|
1763 | } |
1564 | } |
1764 | |
1565 | else if (ent->type == EIO_DT_DIR) |
1765 | /* now sort the dirs only (dirs all have the same score) */ |
1566 | ent->score = 0; |
1766 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
|
|
1767 | } |
1567 | } |
1768 | |
|
|
1769 | break; |
|
|
1770 | } |
|
|
1771 | |
|
|
1772 | /* now add the entry to our list(s) */ |
|
|
1773 | name = D_NAME (entp); |
|
|
1774 | |
|
|
1775 | /* skip . and .. entries */ |
|
|
1776 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
|
|
1777 | { |
|
|
1778 | int len = D_NAMLEN (entp) + 1; |
|
|
1779 | |
|
|
1780 | while (ecb_expect_false (namesoffs + len > namesalloc)) |
|
|
1781 | { |
|
|
1782 | namesalloc *= 2; |
|
|
1783 | req->ptr2 = names = realloc (names, namesalloc); |
|
|
1784 | |
|
|
1785 | if (!names) |
|
|
1786 | break; |
|
|
1787 | } |
1568 | } |
1788 | |
1569 | |
1789 | memcpy (names + namesoffs, name, len); |
|
|
1790 | |
|
|
1791 | if (dents) |
|
|
1792 | { |
|
|
1793 | struct eio_dirent *ent; |
|
|
1794 | |
|
|
1795 | if (ecb_expect_false (dentoffs == dentalloc)) |
|
|
1796 | { |
|
|
1797 | dentalloc *= 2; |
|
|
1798 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
|
|
1799 | |
|
|
1800 | if (!dents) |
|
|
1801 | break; |
|
|
1802 | } |
|
|
1803 | |
|
|
1804 | ent = dents + dentoffs; |
|
|
1805 | |
|
|
1806 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
|
|
1807 | ent->namelen = len - 1; |
|
|
1808 | ent->inode = D_INO (entp); |
|
|
1809 | |
|
|
1810 | inode_bits |= ent->inode; |
|
|
1811 | |
|
|
1812 | switch (D_TYPE (entp)) |
|
|
1813 | { |
|
|
1814 | default: |
|
|
1815 | ent->type = EIO_DT_UNKNOWN; |
|
|
1816 | flags |= EIO_READDIR_FOUND_UNKNOWN; |
|
|
1817 | break; |
|
|
1818 | |
|
|
1819 | #ifdef DT_FIFO |
|
|
1820 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
|
|
1821 | #endif |
|
|
1822 | #ifdef DT_CHR |
|
|
1823 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
|
|
1824 | #endif |
|
|
1825 | #ifdef DT_MPC |
|
|
1826 | case DT_MPC: ent->type = EIO_DT_MPC; break; |
|
|
1827 | #endif |
|
|
1828 | #ifdef DT_DIR |
|
|
1829 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
|
|
1830 | #endif |
|
|
1831 | #ifdef DT_NAM |
|
|
1832 | case DT_NAM: ent->type = EIO_DT_NAM; break; |
|
|
1833 | #endif |
|
|
1834 | #ifdef DT_BLK |
|
|
1835 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
|
|
1836 | #endif |
|
|
1837 | #ifdef DT_MPB |
|
|
1838 | case DT_MPB: ent->type = EIO_DT_MPB; break; |
|
|
1839 | #endif |
|
|
1840 | #ifdef DT_REG |
|
|
1841 | case DT_REG: ent->type = EIO_DT_REG; break; |
|
|
1842 | #endif |
|
|
1843 | #ifdef DT_NWK |
|
|
1844 | case DT_NWK: ent->type = EIO_DT_NWK; break; |
|
|
1845 | #endif |
|
|
1846 | #ifdef DT_CMP |
|
|
1847 | case DT_CMP: ent->type = EIO_DT_CMP; break; |
|
|
1848 | #endif |
|
|
1849 | #ifdef DT_LNK |
|
|
1850 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
|
|
1851 | #endif |
|
|
1852 | #ifdef DT_SOCK |
|
|
1853 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
|
|
1854 | #endif |
|
|
1855 | #ifdef DT_DOOR |
|
|
1856 | case DT_DOOR: ent->type = EIO_DT_DOOR; break; |
|
|
1857 | #endif |
|
|
1858 | #ifdef DT_WHT |
|
|
1859 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
|
|
1860 | #endif |
|
|
1861 | } |
|
|
1862 | |
|
|
1863 | ent->score = 7; |
|
|
1864 | |
|
|
1865 | if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1866 | { |
|
|
1867 | if (ent->type == EIO_DT_UNKNOWN) |
|
|
1868 | { |
|
|
1869 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
|
|
1870 | ent->score = 1; |
|
|
1871 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
|
|
1872 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
|
|
1873 | } |
|
|
1874 | else if (ent->type == EIO_DT_DIR) |
|
|
1875 | ent->score = 0; |
|
|
1876 | } |
|
|
1877 | } |
|
|
1878 | |
|
|
1879 | namesoffs += len; |
1570 | namesoffs += len; |
1880 | ++dentoffs; |
1571 | ++dentoffs; |
1881 | } |
1572 | } |
1882 | |
1573 | |
1883 | if (EIO_CANCELLED (req)) |
1574 | if (EIO_CANCELLED (req)) |
1884 | { |
1575 | { |
1885 | errno = ECANCELED; |
1576 | errno = ECANCELED; |
1886 | break; |
1577 | break; |
1887 | } |
1578 | } |
1888 | |
1579 | |
1889 | #ifdef _WIN32 |
1580 | #ifdef _WIN32 |
1890 | if (!FindNextFile (dirp, &entp)) |
1581 | if (!FindNextFile (dirp, &entp)) |
1891 | { |
1582 | { |
1892 | FindClose (dirp); |
1583 | FindClose (dirp); |
1893 | dirp = 0; |
1584 | dirp = 0; |
1894 | } |
1585 | } |
1895 | #endif |
1586 | #endif |
1896 | } |
1587 | } |
1897 | } |
1588 | } |
|
|
1589 | |
|
|
1590 | /*****************************************************************************/ |
|
|
1591 | /* working directory stuff */ |
|
|
1592 | /* various deficiencies in the posix 2008 api force us to */ |
|
|
1593 | /* keep the absolute path in string form at all times */ |
|
|
1594 | /* fuck yeah. */ |
|
|
1595 | |
|
|
1596 | #if !HAVE_AT |
|
|
1597 | |
|
|
1598 | /* a bit like realpath, but usually faster because it doesn'T have to return */ |
|
|
1599 | /* an absolute or canonical path */ |
|
|
1600 | static const char * |
|
|
1601 | wd_expand (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path) |
|
|
1602 | { |
|
|
1603 | if (!wd || *path == '/') |
|
|
1604 | return path; |
|
|
1605 | |
|
|
1606 | if (path [0] == '.' && !path [1]) |
|
|
1607 | return wd->str; |
|
|
1608 | |
|
|
1609 | { |
|
|
1610 | int l1 = wd->len; |
|
|
1611 | int l2 = strlen (path); |
|
|
1612 | |
|
|
1613 | char *res = etp_tmpbuf_get (tmpbuf, l1 + l2 + 2); |
|
|
1614 | |
|
|
1615 | memcpy (res, wd->str, l1); |
|
|
1616 | res [l1] = '/'; |
|
|
1617 | memcpy (res + l1 + 1, path, l2 + 1); |
|
|
1618 | |
|
|
1619 | return res; |
|
|
1620 | } |
|
|
1621 | } |
|
|
1622 | |
|
|
1623 | #endif |
|
|
1624 | |
|
|
1625 | static eio_wd |
|
|
1626 | eio__wd_open_sync (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path) |
|
|
1627 | { |
|
|
1628 | int fd; |
|
|
1629 | eio_wd res; |
|
|
1630 | int len = eio__realpath (tmpbuf, wd, path); |
|
|
1631 | |
|
|
1632 | if (len < 0) |
|
|
1633 | return EIO_INVALID_WD; |
|
|
1634 | |
|
|
1635 | #if HAVE_AT |
|
|
1636 | fd = openat (WD2FD (wd), path, O_CLOEXEC | O_SEARCH | O_DIRECTORY); |
|
|
1637 | |
|
|
1638 | if (fd < 0) |
|
|
1639 | return EIO_INVALID_WD; |
|
|
1640 | #endif |
|
|
1641 | |
|
|
1642 | res = malloc (sizeof (*res) + len); /* one extra 0-byte */ |
|
|
1643 | |
|
|
1644 | #if HAVE_AT |
|
|
1645 | res->fd = fd; |
|
|
1646 | #endif |
|
|
1647 | |
|
|
1648 | res->len = len; |
|
|
1649 | memcpy (res->str, tmpbuf->ptr, len); |
|
|
1650 | res->str [len] = 0; |
|
|
1651 | |
|
|
1652 | return res; |
|
|
1653 | } |
|
|
1654 | |
|
|
1655 | eio_wd |
|
|
1656 | eio_wd_open_sync (eio_wd wd, const char *path) |
|
|
1657 | { |
|
|
1658 | struct etp_tmpbuf tmpbuf = { }; |
|
|
1659 | wd = eio__wd_open_sync (&tmpbuf, wd, path); |
|
|
1660 | free (tmpbuf.ptr); |
|
|
1661 | |
|
|
1662 | return wd; |
|
|
1663 | } |
|
|
1664 | |
|
|
1665 | void |
|
|
1666 | eio_wd_close_sync (eio_wd wd) |
|
|
1667 | { |
|
|
1668 | if (wd != EIO_INVALID_WD && wd != EIO_CWD) |
|
|
1669 | { |
|
|
1670 | #if HAVE_AT |
|
|
1671 | close (wd->fd); |
|
|
1672 | #endif |
|
|
1673 | free (wd); |
|
|
1674 | } |
|
|
1675 | } |
|
|
1676 | |
|
|
1677 | #if HAVE_AT |
|
|
1678 | |
|
|
1679 | /* they forgot these */ |
|
|
1680 | |
|
|
1681 | static int |
|
|
1682 | eio__truncateat (int dirfd, const char *path, off_t length) |
|
|
1683 | { |
|
|
1684 | int fd = openat (dirfd, path, O_WRONLY | O_CLOEXEC); |
|
|
1685 | int res; |
|
|
1686 | |
|
|
1687 | if (fd < 0) |
|
|
1688 | return fd; |
|
|
1689 | |
|
|
1690 | res = ftruncate (fd, length); |
|
|
1691 | close (fd); |
|
|
1692 | return res; |
|
|
1693 | } |
|
|
1694 | |
|
|
1695 | static int |
|
|
1696 | eio__statvfsat (int dirfd, const char *path, struct statvfs *buf) |
|
|
1697 | { |
|
|
1698 | int fd = openat (dirfd, path, O_SEARCH | O_CLOEXEC); |
|
|
1699 | int res; |
|
|
1700 | |
|
|
1701 | if (fd < 0) |
|
|
1702 | return fd; |
|
|
1703 | |
|
|
1704 | res = fstatvfs (fd, buf); |
|
|
1705 | close (fd); |
|
|
1706 | return res; |
|
|
1707 | |
|
|
1708 | } |
|
|
1709 | |
|
|
1710 | #endif |
1898 | |
1711 | |
1899 | /*****************************************************************************/ |
1712 | /*****************************************************************************/ |
1900 | |
1713 | |
1901 | #define ALLOC(len) \ |
1714 | #define ALLOC(len) \ |
1902 | if (!req->ptr2) \ |
1715 | if (!req->ptr2) \ |
1903 | { \ |
1716 | { \ |
1904 | X_LOCK (wrklock); \ |
1717 | X_LOCK (EIO_POOL->wrklock); \ |
1905 | req->flags |= EIO_FLAG_PTR2_FREE; \ |
1718 | req->flags |= EIO_FLAG_PTR2_FREE; \ |
1906 | X_UNLOCK (wrklock); \ |
1719 | X_UNLOCK (EIO_POOL->wrklock); \ |
1907 | req->ptr2 = malloc (len); \ |
1720 | req->ptr2 = malloc (len); \ |
1908 | if (!req->ptr2) \ |
1721 | if (!req->ptr2) \ |
1909 | { \ |
1722 | { \ |
1910 | errno = ENOMEM; \ |
1723 | errno = ENOMEM; \ |
1911 | req->result = -1; \ |
1724 | req->result = -1; \ |
1912 | break; \ |
1725 | break; \ |
1913 | } \ |
1726 | } \ |
1914 | } |
1727 | } |
1915 | |
1728 | |
1916 | X_THREAD_PROC (etp_proc) |
|
|
1917 | { |
|
|
1918 | ETP_REQ *req; |
|
|
1919 | struct timespec ts; |
|
|
1920 | etp_worker *self = (etp_worker *)thr_arg; |
|
|
1921 | |
|
|
1922 | #if HAVE_PRCTL_SET_NAME |
|
|
1923 | prctl (PR_SET_NAME, (unsigned long)"eio_thread", 0, 0, 0); |
|
|
1924 | #endif |
|
|
1925 | |
|
|
1926 | /* try to distribute timeouts somewhat evenly */ |
|
|
1927 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
|
|
1928 | |
|
|
1929 | for (;;) |
|
|
1930 | { |
|
|
1931 | ts.tv_sec = 0; |
|
|
1932 | |
|
|
1933 | X_LOCK (reqlock); |
|
|
1934 | |
|
|
1935 | for (;;) |
|
|
1936 | { |
|
|
1937 | self->req = req = reqq_shift (&req_queue); |
|
|
1938 | |
|
|
1939 | if (req) |
|
|
1940 | break; |
|
|
1941 | |
|
|
1942 | if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */ |
|
|
1943 | { |
|
|
1944 | X_UNLOCK (reqlock); |
|
|
1945 | X_LOCK (wrklock); |
|
|
1946 | --started; |
|
|
1947 | X_UNLOCK (wrklock); |
|
|
1948 | goto quit; |
|
|
1949 | } |
|
|
1950 | |
|
|
1951 | ++idle; |
|
|
1952 | |
|
|
1953 | if (idle <= max_idle) |
|
|
1954 | /* we are allowed to idle, so do so without any timeout */ |
|
|
1955 | X_COND_WAIT (reqwait, reqlock); |
|
|
1956 | else |
|
|
1957 | { |
|
|
1958 | /* initialise timeout once */ |
|
|
1959 | if (!ts.tv_sec) |
|
|
1960 | ts.tv_sec = time (0) + idle_timeout; |
|
|
1961 | |
|
|
1962 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
|
|
1963 | ts.tv_sec = 1; /* assuming this is not a value computed above.,.. */ |
|
|
1964 | } |
|
|
1965 | |
|
|
1966 | --idle; |
|
|
1967 | } |
|
|
1968 | |
|
|
1969 | --nready; |
|
|
1970 | |
|
|
1971 | X_UNLOCK (reqlock); |
|
|
1972 | |
|
|
1973 | if (req->type < 0) |
|
|
1974 | goto quit; |
|
|
1975 | |
|
|
1976 | ETP_EXECUTE (self, req); |
|
|
1977 | |
|
|
1978 | X_LOCK (reslock); |
|
|
1979 | |
|
|
1980 | ++npending; |
|
|
1981 | |
|
|
1982 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
|
|
1983 | want_poll_cb (); |
|
|
1984 | |
|
|
1985 | self->req = 0; |
|
|
1986 | etp_worker_clear (self); |
|
|
1987 | |
|
|
1988 | X_UNLOCK (reslock); |
|
|
1989 | } |
|
|
1990 | |
|
|
1991 | quit: |
|
|
1992 | X_LOCK (wrklock); |
|
|
1993 | etp_worker_free (self); |
|
|
1994 | X_UNLOCK (wrklock); |
|
|
1995 | |
|
|
1996 | return 0; |
|
|
1997 | } |
|
|
1998 | |
|
|
1999 | /*****************************************************************************/ |
1729 | /*****************************************************************************/ |
2000 | |
1730 | |
2001 | int ecb_cold |
1731 | int ecb_cold |
2002 | eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1732 | eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
2003 | { |
1733 | { |
2004 | #if !HAVE_PREADWRITE |
1734 | eio_want_poll_cb = want_poll; |
2005 | X_MUTEX_CREATE (preadwritelock); |
1735 | eio_done_poll_cb = done_poll; |
2006 | #endif |
|
|
2007 | |
1736 | |
2008 | return etp_init (want_poll, done_poll); |
1737 | return etp_init (EIO_POOL, 0, 0, 0); |
2009 | } |
1738 | } |
2010 | |
1739 | |
2011 | ecb_inline void |
1740 | ecb_inline void |
2012 | eio_api_destroy (eio_req *req) |
1741 | eio_api_destroy (eio_req *req) |
2013 | { |
1742 | { |
2014 | free (req); |
1743 | free (req); |
2015 | } |
1744 | } |
2016 | |
1745 | |
2017 | #define REQ(rtype) \ |
1746 | #define REQ(rtype) \ |
2018 | eio_req *req; \ |
1747 | eio_req *req; \ |
2019 | \ |
1748 | \ |
2020 | req = (eio_req *)calloc (1, sizeof *req); \ |
1749 | req = (eio_req *)calloc (1, sizeof *req); \ |
2021 | if (!req) \ |
1750 | if (!req) \ |
2022 | return 0; \ |
1751 | return 0; \ |
… | |
… | |
2036 | { \ |
1765 | { \ |
2037 | eio_api_destroy (req); \ |
1766 | eio_api_destroy (req); \ |
2038 | return 0; \ |
1767 | return 0; \ |
2039 | } |
1768 | } |
2040 | |
1769 | |
|
|
1770 | #define SINGLEDOT(ptr) (0[(char *)(ptr)] == '.' && !1[(char *)(ptr)]) |
|
|
1771 | |
2041 | static void |
1772 | static void |
2042 | eio_execute (etp_worker *self, eio_req *req) |
1773 | eio_execute (etp_worker *self, eio_req *req) |
2043 | { |
1774 | { |
|
|
1775 | #if HAVE_AT |
|
|
1776 | int dirfd; |
|
|
1777 | #else |
|
|
1778 | const char *path; |
|
|
1779 | #endif |
|
|
1780 | |
2044 | if (ecb_expect_false (EIO_CANCELLED (req))) |
1781 | if (ecb_expect_false (EIO_CANCELLED (req))) |
2045 | { |
1782 | { |
2046 | req->result = -1; |
1783 | req->result = -1; |
2047 | req->errorno = ECANCELED; |
1784 | req->errorno = ECANCELED; |
2048 | return; |
1785 | return; |
2049 | } |
1786 | } |
2050 | |
1787 | |
|
|
1788 | if (ecb_expect_false (req->wd == EIO_INVALID_WD)) |
|
|
1789 | { |
|
|
1790 | req->result = -1; |
|
|
1791 | req->errorno = ENOENT; |
|
|
1792 | return; |
|
|
1793 | } |
|
|
1794 | |
|
|
1795 | if (req->type >= EIO_OPEN) |
|
|
1796 | { |
|
|
1797 | #if HAVE_AT |
|
|
1798 | dirfd = WD2FD (req->wd); |
|
|
1799 | #else |
|
|
1800 | path = wd_expand (&self->tmpbuf, req->wd, req->ptr1); |
|
|
1801 | #endif |
|
|
1802 | } |
|
|
1803 | |
2051 | switch (req->type) |
1804 | switch (req->type) |
2052 | { |
1805 | { |
|
|
1806 | case EIO_WD_OPEN: req->wd = eio__wd_open_sync (&self->tmpbuf, req->wd, req->ptr1); |
|
|
1807 | req->result = req->wd == EIO_INVALID_WD ? -1 : 0; |
|
|
1808 | break; |
|
|
1809 | case EIO_WD_CLOSE: req->result = 0; |
|
|
1810 | eio_wd_close_sync (req->wd); break; |
|
|
1811 | |
|
|
1812 | case EIO_SEEK: eio__lseek (req); break; |
2053 | case EIO_READ: ALLOC (req->size); |
1813 | case EIO_READ: ALLOC (req->size); |
2054 | req->result = req->offs >= 0 |
1814 | req->result = req->offs >= 0 |
2055 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
1815 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
2056 | : read (req->int1, req->ptr2, req->size); break; |
1816 | : read (req->int1, req->ptr2, req->size); break; |
2057 | case EIO_WRITE: req->result = req->offs >= 0 |
1817 | case EIO_WRITE: req->result = req->offs >= 0 |
… | |
… | |
2059 | : write (req->int1, req->ptr2, req->size); break; |
1819 | : write (req->int1, req->ptr2, req->size); break; |
2060 | |
1820 | |
2061 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
1821 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
2062 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break; |
1822 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break; |
2063 | |
1823 | |
|
|
1824 | #if HAVE_AT |
|
|
1825 | |
2064 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1826 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
2065 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1827 | req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, 0); break; |
2066 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1828 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1829 | req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, AT_SYMLINK_NOFOLLOW); break; |
|
|
1830 | case EIO_CHOWN: req->result = fchownat (dirfd, req->ptr1, req->int2, req->int3, 0); break; |
|
|
1831 | case EIO_CHMOD: req->result = fchmodat (dirfd, req->ptr1, (mode_t)req->int2, 0); break; |
|
|
1832 | case EIO_TRUNCATE: req->result = eio__truncateat (dirfd, req->ptr1, req->offs); break; |
|
|
1833 | case EIO_OPEN: req->result = openat (dirfd, req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
1834 | |
|
|
1835 | case EIO_UNLINK: req->result = unlinkat (dirfd, req->ptr1, 0); break; |
|
|
1836 | case EIO_RMDIR: /* complications arise because "." cannot be removed, so we might have to expand */ |
|
|
1837 | req->result = req->wd && SINGLEDOT (req->ptr1) |
|
|
1838 | ? rmdir (req->wd->str) |
|
|
1839 | : unlinkat (dirfd, req->ptr1, AT_REMOVEDIR); break; |
|
|
1840 | case EIO_MKDIR: req->result = mkdirat (dirfd, req->ptr1, (mode_t)req->int2); break; |
|
|
1841 | case EIO_RENAME: /* complications arise because "." cannot be renamed, so we might have to expand */ |
|
|
1842 | req->result = req->wd && SINGLEDOT (req->ptr1) |
|
|
1843 | ? rename (req->wd->str, req->ptr2) |
|
|
1844 | : renameat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2); break; |
|
|
1845 | case EIO_LINK: req->result = linkat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2, 0); break; |
|
|
1846 | case EIO_SYMLINK: req->result = symlinkat (req->ptr1, dirfd, req->ptr2); break; |
|
|
1847 | case EIO_MKNOD: req->result = mknodat (dirfd, req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
1848 | case EIO_READLINK: ALLOC (PATH_MAX); |
|
|
1849 | req->result = readlinkat (dirfd, req->ptr1, req->ptr2, PATH_MAX); break; |
|
|
1850 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1851 | req->result = eio__statvfsat (dirfd, req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1852 | case EIO_UTIME: |
|
|
1853 | case EIO_FUTIME: |
|
|
1854 | { |
|
|
1855 | struct timespec ts[2]; |
|
|
1856 | struct timespec *times; |
|
|
1857 | |
|
|
1858 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1859 | { |
|
|
1860 | ts[0].tv_sec = req->nv1; |
|
|
1861 | ts[0].tv_nsec = (req->nv1 - ts[0].tv_sec) * 1e9; |
|
|
1862 | ts[1].tv_sec = req->nv2; |
|
|
1863 | ts[1].tv_nsec = (req->nv2 - ts[1].tv_sec) * 1e9; |
|
|
1864 | |
|
|
1865 | times = ts; |
|
|
1866 | } |
|
|
1867 | else |
|
|
1868 | times = 0; |
|
|
1869 | |
|
|
1870 | req->result = req->type == EIO_FUTIME |
|
|
1871 | ? futimens (req->int1, times) |
|
|
1872 | : utimensat (dirfd, req->ptr1, times, 0); |
|
|
1873 | } |
|
|
1874 | break; |
|
|
1875 | |
|
|
1876 | #else |
|
|
1877 | |
|
|
1878 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1879 | req->result = stat (path , (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1880 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
2067 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1881 | req->result = lstat (path , (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1882 | case EIO_CHOWN: req->result = chown (path , req->int2, req->int3); break; |
|
|
1883 | case EIO_CHMOD: req->result = chmod (path , (mode_t)req->int2); break; |
|
|
1884 | case EIO_TRUNCATE: req->result = truncate (path , req->offs); break; |
|
|
1885 | case EIO_OPEN: req->result = open (path , req->int1, (mode_t)req->int2); break; |
|
|
1886 | |
|
|
1887 | case EIO_UNLINK: req->result = unlink (path ); break; |
|
|
1888 | case EIO_RMDIR: req->result = rmdir (path ); break; |
|
|
1889 | case EIO_MKDIR: req->result = mkdir (path , (mode_t)req->int2); break; |
|
|
1890 | case EIO_RENAME: req->result = rename (path , req->ptr2); break; |
|
|
1891 | case EIO_LINK: req->result = link (path , req->ptr2); break; |
|
|
1892 | case EIO_SYMLINK: req->result = symlink (path , req->ptr2); break; |
|
|
1893 | case EIO_MKNOD: req->result = mknod (path , (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
1894 | case EIO_READLINK: ALLOC (PATH_MAX); |
|
|
1895 | req->result = readlink (path, req->ptr2, PATH_MAX); break; |
|
|
1896 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1897 | req->result = statvfs (path , (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1898 | |
|
|
1899 | case EIO_UTIME: |
|
|
1900 | case EIO_FUTIME: |
|
|
1901 | { |
|
|
1902 | struct timeval tv[2]; |
|
|
1903 | struct timeval *times; |
|
|
1904 | |
|
|
1905 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1906 | { |
|
|
1907 | tv[0].tv_sec = req->nv1; |
|
|
1908 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1e6; |
|
|
1909 | tv[1].tv_sec = req->nv2; |
|
|
1910 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1e6; |
|
|
1911 | |
|
|
1912 | times = tv; |
|
|
1913 | } |
|
|
1914 | else |
|
|
1915 | times = 0; |
|
|
1916 | |
|
|
1917 | req->result = req->type == EIO_FUTIME |
|
|
1918 | ? futimes (req->int1, times) |
|
|
1919 | : utimes (req->ptr1, times); |
|
|
1920 | } |
|
|
1921 | break; |
|
|
1922 | |
|
|
1923 | #endif |
|
|
1924 | |
|
|
1925 | case EIO_REALPATH: if (0 <= (req->result = eio__realpath (&self->tmpbuf, req->wd, req->ptr1))) |
|
|
1926 | { |
|
|
1927 | ALLOC (req->result); |
|
|
1928 | memcpy (req->ptr2, self->tmpbuf.ptr, req->result); |
|
|
1929 | } |
|
|
1930 | break; |
|
|
1931 | |
2068 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1932 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
2069 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1933 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
2070 | |
1934 | |
2071 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
2072 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
2073 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
1935 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
2074 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
1936 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
2075 | |
1937 | |
2076 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
|
|
2077 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1938 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
2078 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
|
|
2079 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1939 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
2080 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
|
|
2081 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
1940 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
2082 | |
1941 | |
2083 | case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
2084 | case EIO_CLOSE: req->result = close (req->int1); break; |
1942 | case EIO_CLOSE: req->result = close (req->int1); break; |
2085 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
1943 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
2086 | case EIO_UNLINK: req->result = unlink (req->ptr1); break; |
|
|
2087 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
|
|
2088 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
|
|
2089 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
|
|
2090 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
|
|
2091 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
|
|
2092 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
2093 | |
|
|
2094 | case EIO_REALPATH: eio__realpath (req, self); break; |
|
|
2095 | |
|
|
2096 | case EIO_READLINK: ALLOC (PATH_MAX); |
|
|
2097 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
|
|
2098 | |
|
|
2099 | case EIO_SYNC: req->result = 0; sync (); break; |
1944 | case EIO_SYNC: req->result = 0; sync (); break; |
2100 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1945 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
2101 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1946 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
2102 | case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break; |
1947 | case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break; |
2103 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1948 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
… | |
… | |
2122 | req->result = select (0, 0, 0, 0, &tv); |
1967 | req->result = select (0, 0, 0, 0, &tv); |
2123 | } |
1968 | } |
2124 | #endif |
1969 | #endif |
2125 | break; |
1970 | break; |
2126 | |
1971 | |
2127 | case EIO_UTIME: |
1972 | #if 0 |
2128 | case EIO_FUTIME: |
|
|
2129 | { |
|
|
2130 | struct timeval tv[2]; |
|
|
2131 | struct timeval *times; |
|
|
2132 | |
|
|
2133 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
2134 | { |
|
|
2135 | tv[0].tv_sec = req->nv1; |
|
|
2136 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.; |
|
|
2137 | tv[1].tv_sec = req->nv2; |
|
|
2138 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.; |
|
|
2139 | |
|
|
2140 | times = tv; |
|
|
2141 | } |
|
|
2142 | else |
|
|
2143 | times = 0; |
|
|
2144 | |
|
|
2145 | req->result = req->type == EIO_FUTIME |
|
|
2146 | ? futimes (req->int1, times) |
|
|
2147 | : utimes (req->ptr1, times); |
|
|
2148 | } |
|
|
2149 | break; |
|
|
2150 | |
|
|
2151 | case EIO_GROUP: |
1973 | case EIO_GROUP: |
2152 | abort (); /* handled in eio_request */ |
1974 | abort (); /* handled in eio_request */ |
|
|
1975 | #endif |
2153 | |
1976 | |
2154 | case EIO_NOP: |
1977 | case EIO_NOP: |
2155 | req->result = 0; |
1978 | req->result = 0; |
2156 | break; |
1979 | break; |
2157 | |
1980 | |
2158 | case EIO_CUSTOM: |
1981 | case EIO_CUSTOM: |
2159 | req->feed (req); |
1982 | req->feed (req); |
2160 | break; |
1983 | break; |
2161 | |
1984 | |
2162 | default: |
1985 | default: |
2163 | errno = ENOSYS; |
|
|
2164 | req->result = -1; |
1986 | req->result = EIO_ENOSYS (); |
2165 | break; |
1987 | break; |
2166 | } |
1988 | } |
2167 | |
1989 | |
2168 | req->errorno = errno; |
1990 | req->errorno = errno; |
2169 | } |
1991 | } |
2170 | |
1992 | |
2171 | #ifndef EIO_NO_WRAPPERS |
1993 | #ifndef EIO_NO_WRAPPERS |
2172 | |
1994 | |
|
|
1995 | eio_req *eio_wd_open (const char *path, int pri, eio_cb cb, void *data) |
|
|
1996 | { |
|
|
1997 | REQ (EIO_WD_OPEN); PATH; SEND; |
|
|
1998 | } |
|
|
1999 | |
|
|
2000 | eio_req *eio_wd_close (eio_wd wd, int pri, eio_cb cb, void *data) |
|
|
2001 | { |
|
|
2002 | REQ (EIO_WD_CLOSE); req->wd = wd; SEND; |
|
|
2003 | } |
|
|
2004 | |
2173 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
2005 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
2174 | { |
2006 | { |
2175 | REQ (EIO_NOP); SEND; |
2007 | REQ (EIO_NOP); SEND; |
2176 | } |
2008 | } |
2177 | |
2009 | |
… | |
… | |
2236 | } |
2068 | } |
2237 | |
2069 | |
2238 | eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data) |
2070 | eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data) |
2239 | { |
2071 | { |
2240 | REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND; |
2072 | REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND; |
|
|
2073 | } |
|
|
2074 | |
|
|
2075 | eio_req *eio_seek (int fd, off_t offset, int whence, int pri, eio_cb cb, void *data) |
|
|
2076 | { |
|
|
2077 | REQ (EIO_SEEK); req->int1 = fd; req->offs = offset; req->int2 = whence; SEND; |
2241 | } |
2078 | } |
2242 | |
2079 | |
2243 | eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data) |
2080 | eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data) |
2244 | { |
2081 | { |
2245 | REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND; |
2082 | REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND; |
… | |
… | |
2443 | void |
2280 | void |
2444 | eio_grp_add (eio_req *grp, eio_req *req) |
2281 | eio_grp_add (eio_req *grp, eio_req *req) |
2445 | { |
2282 | { |
2446 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2283 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2447 | |
2284 | |
2448 | grp->flags |= EIO_FLAG_GROUPADD; |
2285 | grp->flags |= ETP_FLAG_GROUPADD; |
2449 | |
2286 | |
2450 | ++grp->size; |
2287 | ++grp->size; |
2451 | req->grp = grp; |
2288 | req->grp = grp; |
2452 | |
2289 | |
2453 | req->grp_prev = 0; |
2290 | req->grp_prev = 0; |