ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.pod
Revision: 1.7
Committed: Sun Jun 5 22:44:30 2011 UTC (12 years, 11 months ago) by root
Branch: MAIN
Changes since 1.6: +432 -3 lines
Log Message:
*** empty log message ***

File Contents

# User Rev Content
1 root 1.1 =head1 NAME
2    
3     libeio - truly asynchronous POSIX I/O
4    
5     =head1 SYNOPSIS
6    
7     #include <eio.h>
8    
9     =head1 DESCRIPTION
10    
11     The newest version of this document is also available as an html-formatted
12     web page you might find easier to navigate when reading it for the first
13     time: L<http://pod.tst.eu/http://cvs.schmorp.de/libeio/eio.pod>.
14    
15     Note that this library is a by-product of the C<IO::AIO> perl
16 sf-exg 1.6 module, and many of the subtler points regarding requests lifetime
17 root 1.1 and so on are only documented in its documentation at the
18     moment: L<http://pod.tst.eu/http://cvs.schmorp.de/IO-AIO/AIO.pm>.
19    
20     =head2 FEATURES
21    
22     This library provides fully asynchronous versions of most POSIX functions
23 sf-exg 1.6 dealing with I/O. Unlike most asynchronous libraries, this not only
24 root 1.1 includes C<read> and C<write>, but also C<open>, C<stat>, C<unlink> and
25     similar functions, as well as less rarely ones such as C<mknod>, C<futime>
26     or C<readlink>.
27    
28     It also offers wrappers around C<sendfile> (Solaris, Linux, HP-UX and
29     FreeBSD, with emulation on other platforms) and C<readahead> (Linux, with
30     emulation elsewhere>).
31    
32 root 1.5 The goal is to enable you to write fully non-blocking programs. For
33 root 1.1 example, in a game server, you would not want to freeze for a few seconds
34     just because the server is running a backup and you happen to call
35     C<readdir>.
36    
37     =head2 TIME REPRESENTATION
38    
39     Libeio represents time as a single floating point number, representing the
40     (fractional) number of seconds since the (POSIX) epoch (somewhere near
41     the beginning of 1970, details are complicated, don't ask). This type is
42 sf-exg 1.6 called C<eio_tstamp>, but it is guaranteed to be of type C<double> (or
43 root 1.1 better), so you can freely use C<double> yourself.
44    
45     Unlike the name component C<stamp> might indicate, it is also used for
46     time differences throughout libeio.
47    
48     =head2 FORK SUPPORT
49    
50     Calling C<fork ()> is fully supported by this module. It is implemented in these steps:
51    
52     1. wait till all requests in "execute" state have been handled
53     (basically requests that are already handed over to the kernel).
54     2. fork
55     3. in the parent, continue business as usual, done
56     4. in the child, destroy all ready and pending requests and free the
57     memory used by the worker threads. This gives you a fully empty
58     libeio queue.
59    
60 root 1.7 Note, however, since libeio does use threads, thr above guarantee doesn't
61     cover your libc, for example, malloc and other libc functions are not
62     fork-safe, so there is very little you can do after a fork, and in fatc,
63     the above might crash, and thus change.
64    
65 root 1.1 =head1 INITIALISATION/INTEGRATION
66    
67     Before you can call any eio functions you first have to initialise the
68     library. The library integrates into any event loop, but can also be used
69     without one, including in polling mode.
70    
71     You have to provide the necessary glue yourself, however.
72    
73     =over 4
74    
75     =item int eio_init (void (*want_poll)(void), void (*done_poll)(void))
76    
77     This function initialises the library. On success it returns C<0>, on
78     failure it returns C<-1> and sets C<errno> appropriately.
79    
80     It accepts two function pointers specifying callbacks as argument, both of
81     which can be C<0>, in which case the callback isn't called.
82    
83     =item want_poll callback
84    
85     The C<want_poll> callback is invoked whenever libeio wants attention (i.e.
86     it wants to be polled by calling C<eio_poll>). It is "edge-triggered",
87     that is, it will only be called once when eio wants attention, until all
88     pending requests have been handled.
89    
90     This callback is called while locks are being held, so I<you must
91     not call any libeio functions inside this callback>. That includes
92     C<eio_poll>. What you should do is notify some other thread, or wake up
93     your event loop, and then call C<eio_poll>.
94    
95     =item done_poll callback
96    
97     This callback is invoked when libeio detects that all pending requests
98     have been handled. It is "edge-triggered", that is, it will only be
99     called once after C<want_poll>. To put it differently, C<want_poll> and
100     C<done_poll> are invoked in pairs: after C<want_poll> you have to call
101     C<eio_poll ()> until either C<eio_poll> indicates that everything has been
102     handled or C<done_poll> has been called, which signals the same.
103    
104     Note that C<eio_poll> might return after C<done_poll> and C<want_poll>
105     have been called again, so watch out for races in your code.
106    
107 sf-exg 1.6 As with C<want_poll>, this callback is called while locks are being held,
108 root 1.1 so you I<must not call any libeio functions form within this callback>.
109    
110     =item int eio_poll ()
111    
112     This function has to be called whenever there are pending requests that
113     need finishing. You usually call this after C<want_poll> has indicated
114     that you should do so, but you can also call this function regularly to
115     poll for new results.
116    
117     If any request invocation returns a non-zero value, then C<eio_poll ()>
118     immediately returns with that value as return value.
119    
120     Otherwise, if all requests could be handled, it returns C<0>. If for some
121     reason not all requests have been handled, i.e. some are still pending, it
122     returns C<-1>.
123    
124     =back
125    
126     For libev, you would typically use an C<ev_async> watcher: the
127     C<want_poll> callback would invoke C<ev_async_send> to wake up the event
128     loop. Inside the callback set for the watcher, one would call C<eio_poll
129     ()> (followed by C<ev_async_send> again if C<eio_poll> indicates that not
130     all requests have been handled yet). The race is taken care of because
131     libev resets/rearms the async watcher before calling your callback,
132     and therefore, before calling C<eio_poll>. This might result in (some)
133     spurious wake-ups, but is generally harmless.
134    
135     For most other event loops, you would typically use a pipe - the event
136 sf-exg 1.6 loop should be told to wait for read readiness on the read end. In
137 root 1.1 C<want_poll> you would write a single byte, in C<done_poll> you would try
138     to read that byte, and in the callback for the read end, you would call
139     C<eio_poll>. The race is avoided here because the event loop should invoke
140     your callback again and again until the byte has been read (as the pipe
141     read callback does not read it, only C<done_poll>).
142    
143     =head2 CONFIGURATION
144    
145     The functions in this section can sometimes be useful, but the default
146     configuration will do in most case, so you should skip this section on
147     first reading.
148    
149     =over 4
150    
151     =item eio_set_max_poll_time (eio_tstamp nseconds)
152    
153     This causes C<eio_poll ()> to return after it has detected that it was
154     running for C<nsecond> seconds or longer (this number can be fractional).
155    
156     This can be used to limit the amount of time spent handling eio requests,
157     for example, in interactive programs, you might want to limit this time to
158     C<0.01> seconds or so.
159    
160     Note that:
161    
162     a) libeio doesn't know how long your request callbacks take, so the time
163     spent in C<eio_poll> is up to one callback invocation longer then this
164     interval.
165    
166     b) this is implemented by calling C<gettimeofday> after each request,
167     which can be costly.
168    
169     c) at least one request will be handled.
170    
171     =item eio_set_max_poll_reqs (unsigned int nreqs)
172    
173     When C<nreqs> is non-zero, then C<eio_poll> will not handle more than
174     C<nreqs> requests per invocation. This is a less costly way to limit the
175     amount of work done by C<eio_poll> then setting a time limit.
176    
177     If you know your callbacks are generally fast, you could use this to
178     encourage interactiveness in your programs by setting it to C<10>, C<100>
179     or even C<1000>.
180    
181     =item eio_set_min_parallel (unsigned int nthreads)
182    
183     Make sure libeio can handle at least this many requests in parallel. It
184     might be able handle more.
185    
186     =item eio_set_max_parallel (unsigned int nthreads)
187    
188     Set the maximum number of threads that libeio will spawn.
189    
190     =item eio_set_max_idle (unsigned int nthreads)
191    
192     Libeio uses threads internally to handle most requests, and will start and stop threads on demand.
193    
194     This call can be used to limit the number of idle threads (threads without
195 sf-exg 1.6 work to do): libeio will keep some threads idle in preparation for more
196 root 1.1 requests, but never longer than C<nthreads> threads.
197    
198     In addition to this, libeio will also stop threads when they are idle for
199     a few seconds, regardless of this setting.
200    
201     =item unsigned int eio_nthreads ()
202    
203     Return the number of worker threads currently running.
204    
205     =item unsigned int eio_nreqs ()
206    
207     Return the number of requests currently handled by libeio. This is the
208     total number of requests that have been submitted to libeio, but not yet
209     destroyed.
210    
211     =item unsigned int eio_nready ()
212    
213     Returns the number of ready requests, i.e. requests that have been
214     submitted but have not yet entered the execution phase.
215    
216     =item unsigned int eio_npending ()
217    
218     Returns the number of pending requests, i.e. requests that have been
219     executed and have results, but have not been finished yet by a call to
220     C<eio_poll>).
221    
222     =back
223    
224    
225 root 1.7 =head1 HIGH LEVEL REQUEST API
226    
227     Libeio has both a high-level API, which consists of calling a request
228     function with a callback to be called on completion, and a low-level API
229     where you fill out request structures and submit them.
230    
231     This section describes the high-level API.
232    
233     =head2 REQUEST SUBMISSION AND RESULT PROCESSING
234    
235     You submit a request by calling the relevant C<eio_TYPE> function with the
236     required parameters, a callback of type C<int (*eio_cb)(eio_req *req)>
237     (called C<eio_cb> below) and a freely usable C<void *data> argument.
238    
239     The return value will either be 0
240    
241     The callback will be called with an C<eio_req *> which contains the
242     results of the request. The members you can access inside that structure
243     vary from request to request, except for:
244    
245     =over 4
246    
247     =item C<ssize_t result>
248    
249     This contains the result value from the call (usually the same as the
250     syscall of the same name).
251    
252     =item C<int errorno>
253    
254     This contains the value of C<errno> after the call.
255    
256     =item C<void *data>
257    
258     The C<void *data> member simply stores the value of the C<data> argument.
259    
260     =back
261    
262     The return value of the callback is normally C<0>, which tells libeio to
263     continue normally. If a callback returns a nonzero value, libeio will
264     stop processing results (in C<eio_poll>) and will return the value to its
265     caller.
266    
267     Memory areas passed to libeio must stay valid as long as a request
268     executes, with the exception of paths, which are being copied
269     internally. Any memory libeio itself allocates will be freed after the
270     finish callback has been called. If you want to manage all memory passed
271     to libeio yourself you can use the low-level API.
272    
273     For example, to open a file, you could do this:
274    
275     static int
276     file_open_done (eio_req *req)
277     {
278     if (req->result < 0)
279     {
280     /* open() returned -1 */
281     errno = req->errorno;
282     perror ("open");
283     }
284     else
285     {
286     int fd = req->result;
287     /* now we have the new fd in fd */
288     }
289    
290     return 0;
291     }
292    
293     /* the first three arguments are passed to open(2) */
294     /* the remaining are priority, callback and data */
295     if (!eio_open ("/etc/passwd", O_RDONLY, 0, 0, file_open_done, 0))
296     abort (); /* something ent wrong, we will all die!!! */
297    
298     Note that you additionally need to call C<eio_poll> when the C<want_cb>
299     indicates that requests are ready to be processed.
300    
301     =head2 AVAILABLE REQUESTS
302    
303     The following request functions are available. I<All> of them return the
304     C<eio_req *> on success and C<0> on failure, and I<all> of them have the
305     same three trailing arguments: C<pri>, C<cb> and C<data>. The C<cb> is
306     mandatory, but in most cases, you pass in C<0> as C<pri> and C<0> or some
307     custom data value as C<data>.
308    
309     =head3 POSIX API WRAPPERS
310    
311     These requests simply wrap the POSIX call of the same name, with the same
312     arguments:
313    
314     =over 4
315    
316     =item eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
317    
318     =item eio_utime (const char *path, eio_tstamp atime, eio_tstamp mtime, int pri, eio_cb cb, void *data)
319    
320     =item eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
321    
322     =item eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
323    
324     =item eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
325    
326     =item eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
327    
328     =item eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
329    
330     =item eio_unlink (const char *path, int pri, eio_cb cb, void *data)
331    
332     =item eio_readlink (const char *path, int pri, eio_cb cb, void *data) /* result=ptr2 allocated dynamically */
333    
334     =item eio_stat (const char *path, int pri, eio_cb cb, void *data) /* stat buffer=ptr2 allocated dynamically */
335    
336     =item eio_lstat (const char *path, int pri, eio_cb cb, void *data) /* stat buffer=ptr2 allocated dynamically */
337    
338     =item eio_statvfs (const char *path, int pri, eio_cb cb, void *data) /* stat buffer=ptr2 allocated dynamically */
339    
340     =item eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
341    
342     =item eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
343    
344     =item eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
345    
346     =item eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
347    
348     =item eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
349    
350     =item eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
351    
352     =item eio_mlockall (int flags, int pri, eio_cb cb, void *data)
353    
354     =item eio_close (int fd, int pri, eio_cb cb, void *data)
355    
356     =item eio_sync (int pri, eio_cb cb, void *data)
357    
358     =item eio_fsync (int fd, int pri, eio_cb cb, void *data)
359    
360     =item eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
361    
362     =item eio_futime (int fd, eio_tstamp atime, eio_tstamp mtime, int pri, eio_cb cb, void *data)
363    
364     =item eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
365    
366     =item eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
367    
368     =item eio_fchown (int fd, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
369    
370     =item eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
371    
372     These have the same semantics as the syscall of the same name, their
373     return value is available as C<< req->result >> later.
374    
375     =item eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
376    
377     =item eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
378    
379     These two requests are called C<read> and C<write>, but actually wrap
380     C<pread> and C<pwrite>. On systems that lack these calls (such as cygwin),
381     libeio uses lseek/read_or_write/lseek and a mutex to serialise the
382     requests, so all these requests run serially and do not disturb each
383     other. However, they still disturb the file offset while they run, so it's
384     not safe to call these functions concurrently with non-libeio functions on
385     the same fd on these systems.
386    
387     Not surprisingly, pread and pwrite are not thread-safe on Darwin (OS/X),
388     so it is advised not to submit multiple requests on the same fd on this
389     horrible pile of garbage.
390    
391     =item eio_fstat (int fd, int pri, eio_cb cb, void *data)
392    
393     Stats a file - if C<< req->result >> indicates success, then you can
394     access the C<struct stat>-like structure via C<< req->ptr2 >>:
395    
396     EIO_STRUCT_STAT *statdata = (EIO_STRUCT_STAT *)req->ptr2;
397    
398     =item eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) /* stat buffer=ptr2 allocated dynamically */
399    
400     Stats a filesystem - if C<< req->result >> indicates success, then you can
401     access the C<struct statvfs>-like structure via C<< req->ptr2 >>:
402    
403     EIO_STRUCT_STATVFS *statdata = (EIO_STRUCT_STATVFS *)req->ptr2;
404    
405     =back
406    
407     =head3 READING DIRECTORIES
408    
409     Reading directories sounds simple, but can be rather demanding, especially
410     if you want to do stuff such as traversing a diretcory hierarchy or
411     processing all files in a directory. Libeio can assist thess complex tasks
412     with it's C<eio_readdir> call.
413    
414     =over 4
415    
416     =item eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
417    
418     This is a very complex call. It basically reads through a whole directory
419     (via the C<opendir>, C<readdir> and C<closedir> calls) and returns either
420     the names or an array of C<struct eio_dirent>, depending on the C<flags>
421     argument.
422    
423     The C<< req->result >> indicates either the number of files found, or
424     C<-1> on error. On success, zero-terminated names can be found as C<< req->ptr2 >>,
425     and C<struct eio_dirents>, if requested by C<flags>, can be found via C<<
426     req->ptr1 >>.
427    
428     Here is an example that prints all the names:
429    
430     int i;
431     char *names = (char *)req->ptr2;
432    
433     for (i = 0; i < req->result; ++i)
434     {
435     printf ("name #%d: %s\n", i, names);
436    
437     /* move to next name */
438     names += strlen (names) + 1;
439     }
440    
441     Pseudo-entries such as F<.> and F<..> are never returned by C<eio_readdir>.
442    
443     C<flags> can be any combination of:
444    
445     =over 4
446    
447     =item EIO_READDIR_DENTS
448    
449     If this flag is specified, then, in addition to the names in C<ptr2>,
450     also an array of C<struct eio_dirent> is returned, in C<ptr1>. A C<struct
451     eio_dirent> looks like this:
452    
453     struct eio_dirent
454     {
455     int nameofs; /* offset of null-terminated name string in (char *)req->ptr2 */
456     unsigned short namelen; /* size of filename without trailing 0 */
457     unsigned char type; /* one of EIO_DT_* */
458     signed char score; /* internal use */
459     ino_t inode; /* the inode number, if available, otherwise unspecified */
460     };
461    
462     The only members you normally would access are C<nameofs>, which is the
463     byte-offset from C<ptr2> to the start of the name, C<namelen> and C<type>.
464    
465     C<type> can be one of:
466    
467     C<EIO_DT_UNKNOWN> - if the type is not known (very common) and you have to C<stat>
468     the name yourself if you need to know,
469     one of the "standard" POSIX file types (C<EIO_DT_REG>, C<EIO_DT_DIR>, C<EIO_DT_LNK>,
470     C<EIO_DT_FIFO>, C<EIO_DT_SOCK>, C<EIO_DT_CHR>, C<EIO_DT_BLK>)
471     or some OS-specific type (currently
472     C<EIO_DT_MPC> - multiplexed char device (v7+coherent),
473     C<EIO_DT_NAM> - xenix special named file,
474     C<EIO_DT_MPB> - multiplexed block device (v7+coherent),
475     C<EIO_DT_NWK> - HP-UX network special,
476     C<EIO_DT_CMP> - VxFS compressed,
477     C<EIO_DT_DOOR> - solaris door, or
478     C<EIO_DT_WHT>).
479    
480     This example prints all names and their type:
481    
482     int i;
483     struct eio_dirent *ents = (struct eio_dirent *)req->ptr1;
484     char *names = (char *)req->ptr2;
485    
486     for (i = 0; i < req->result; ++i)
487     {
488     struct eio_dirent *ent = ents + i;
489     char *name = names + ent->nameofs;
490    
491     printf ("name #%d: %s (type %d)\n", i, name, ent->type);
492     }
493    
494     =item EIO_READDIR_DIRS_FIRST
495    
496     When this flag is specified, then the names will be returned in an order
497     where likely directories come first, in optimal C<stat> order. This is
498     useful when you need to quickly find directories, or you want to find all
499     directories while avoiding to stat() each entry.
500    
501     If the system returns type information in readdir, then this is used
502     to find directories directly. Otherwise, likely directories are names
503     beginning with ".", or otherwise names with no dots, of which names with
504     short names are tried first.
505    
506     =item EIO_READDIR_STAT_ORDER
507    
508     When this flag is specified, then the names will be returned in an order
509     suitable for stat()'ing each one. That is, when you plan to stat()
510     all files in the given directory, then the returned order will likely
511     be fastest.
512    
513     If both this flag and C<EIO_READDIR_DIRS_FIRST> are specified, then
514     the likely dirs come first, resulting in a less optimal stat order.
515    
516     =item EIO_READDIR_FOUND_UNKNOWN
517    
518     This flag should not be specified when calling C<eio_readdir>. Instead,
519     it is being set by C<eio_readdir> (you can access the C<flags> via C<<
520     req->int1 >>, when any of the C<type>'s found were C<EIO_DT_UNKNOWN>. The
521     absense of this flag therefore indicates that all C<type>'s are known,
522     which can be used to speed up some algorithms.
523    
524     A typical use case would be to identify all subdirectories within a
525     directory - you would ask C<eio_readdir> for C<EIO_READDIR_DIRS_FIRST>. If
526     then this flag is I<NOT> set, then all the entries at the beginning of the
527     returned array of type C<EIO_DT_DIR> are the directories. Otherwise, you
528     should start C<stat()>'ing the entries starting at the beginning of the
529     array, stopping as soon as you found all directories (the count can be
530     deduced by the link count of the directory).
531    
532     =back
533    
534     =back
535    
536     =head3 OS-SPECIFIC CALL WRAPPERS
537    
538     These wrap OS-specific calls (usually Linux ones), and might or might not
539     be emulated on other operating systems. Calls that are not emulated will
540     return C<-1> and set C<errno> to C<ENOSYS>.
541    
542     =over 4
543    
544     =item eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
545    
546     Wraps the C<sendfile> syscall. The arguments follow the Linux version, but
547     libeio supports and will use similar calls on FreeBSD, HP/UX, Solaris and
548     Darwin.
549    
550     If the OS doesn't support some sendfile-like call, or the call fails,
551     indicating support for the given file descriptor type (for example,
552     Linux's sendfile might not support file to file copies), then libeio will
553     emulate the call in userspace, so there are almost no limitations on its
554     use.
555    
556     =item eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
557    
558     Calls C<readahead(2)>. If the syscall is missing, then the call is
559     emulated by simply reading the data (currently in 64kiB chunks).
560    
561     =item eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
562    
563     Calls C<sync_file_range>. If the syscall is missing, then this is the same
564     as calling C<fdatasync>.
565    
566     =back
567    
568     =head3 LIBEIO-SPECIFIC REQUESTS
569    
570     These requests are specific to libeio and do not correspond to any OS call.
571    
572     =over 4
573    
574     =item eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
575    
576     =item eio_custom (void (*)(eio_req *) execute, int pri, eio_cb cb, void *data)
577    
578     Executes a custom request, i.e., a user-specified callback.
579    
580     The callback gets the C<eio_req *> as parameter and is expected to read
581     and modify any request-specific members. Specifically, it should set C<<
582     req->result >> to the result value, just like other requests.
583    
584     Here is an example that simply calls C<open>, like C<eio_open>, but it
585     uses the C<data> member as filename and uses a hardcoded C<O_RDONLY>. If
586     you want to pass more/other parameters, you either need to pass some
587     struct or so via C<data> or provide your own wrapper using the low-level
588     API.
589    
590     static int
591     my_open_done (eio_req *req)
592     {
593     int fd = req->result;
594    
595     return 0;
596     }
597    
598     static void
599     my_open (eio_req *req)
600     {
601     req->result = open (req->data, O_RDONLY);
602     }
603    
604     eio_custom (my_open, 0, my_open_done, "/etc/passwd");
605    
606     =item eio_busy (eio_tstamp delay, int pri, eio_cb cb, void *data)
607    
608     This is a a request that takes C<delay> seconds to execute, but otherwise
609     does nothing - it simply puts one of the worker threads to sleep for this
610     long.
611    
612     This request can be used to artificially increase load, e.g. for debugging
613     or benchmarking reasons.
614    
615     =item eio_nop (int pri, eio_cb cb, void *data)
616    
617     This request does nothing, except go through the whole request cycle. This
618     can be used to measure latency or in some cases to simplify code, but is
619     not really of much use.
620    
621     =back
622    
623     =head3 GROUPING AND LIMITING REQUESTS
624 root 1.1
625     #TODO
626    
627 root 1.7 /*****************************************************************************/
628     /* groups */
629 root 1.1
630 root 1.7 eio_req *eio_grp (eio_cb cb, void *data);
631     void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit);
632     void eio_grp_limit (eio_req *grp, int limit);
633     void eio_grp_add (eio_req *grp, eio_req *req);
634     void eio_grp_cancel (eio_req *grp); /* cancels all sub requests but not the group */
635 root 1.1
636    
637     =back
638    
639    
640     =head1 LOW LEVEL REQUEST API
641    
642     #TODO
643    
644 root 1.7
645     =head1 ANATOMY AND LIFETIME OF AN EIO REQUEST
646    
647     A request is represented by a structure of type C<eio_req>. To initialise
648     it, clear it to all zero bytes:
649    
650     eio_req req;
651    
652     memset (&req, 0, sizeof (req));
653    
654     A more common way to initialise a new C<eio_req> is to use C<calloc>:
655    
656     eio_req *req = calloc (1, sizeof (*req));
657    
658     In either case, libeio neither allocates, initialises or frees the
659     C<eio_req> structure for you - it merely uses it.
660    
661     zero
662    
663     #TODO
664    
665 root 1.1 =head1 EMBEDDING
666    
667     Libeio can be embedded directly into programs. This functionality is not
668     documented and not (yet) officially supported.
669    
670 root 1.3 Note that, when including C<libeio.m4>, you are responsible for defining
671     the compilation environment (C<_LARGEFILE_SOURCE>, C<_GNU_SOURCE> etc.).
672    
673 root 1.2 If you need to know how, check the C<IO::AIO> perl module, which does
674 root 1.1 exactly that.
675    
676    
677 root 1.4 =head1 COMPILETIME CONFIGURATION
678    
679     These symbols, if used, must be defined when compiling F<eio.c>.
680    
681     =over 4
682    
683     =item EIO_STACKSIZE
684    
685     This symbol governs the stack size for each eio thread. Libeio itself
686     was written to use very little stackspace, but when using C<EIO_CUSTOM>
687     requests, you might want to increase this.
688    
689     If this symbol is undefined (the default) then libeio will use its default
690     stack size (C<sizeof (long) * 4096> currently). If it is defined, but
691     C<0>, then the default operating system stack size will be used. In all
692     other cases, the value must be an expression that evaluates to the desired
693     stack size.
694    
695     =back
696    
697    
698 root 1.1 =head1 PORTABILITY REQUIREMENTS
699    
700     In addition to a working ISO-C implementation, libeio relies on a few
701     additional extensions:
702    
703     =over 4
704    
705     =item POSIX threads
706    
707     To be portable, this module uses threads, specifically, the POSIX threads
708     library must be available (and working, which partially excludes many xBSD
709     systems, where C<fork ()> is buggy).
710    
711     =item POSIX-compatible filesystem API
712    
713     This is actually a harder portability requirement: The libeio API is quite
714     demanding regarding POSIX API calls (symlinks, user/group management
715     etc.).
716    
717     =item C<double> must hold a time value in seconds with enough accuracy
718    
719     The type C<double> is used to represent timestamps. It is required to
720     have at least 51 bits of mantissa (and 9 bits of exponent), which is good
721     enough for at least into the year 4000. This requirement is fulfilled by
722     implementations implementing IEEE 754 (basically all existing ones).
723    
724     =back
725    
726     If you know of other additional requirements drop me a note.
727    
728    
729     =head1 AUTHOR
730    
731     Marc Lehmann <libeio@schmorp.de>.
732