ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.pod
(Generate patch)

Comparing libeio/eio.pod (file contents):
Revision 1.7 by root, Sun Jun 5 22:44:30 2011 UTC vs.
Revision 1.16 by root, Tue Jul 5 17:05:54 2011 UTC

124=back 124=back
125 125
126For libev, you would typically use an C<ev_async> watcher: the 126For libev, you would typically use an C<ev_async> watcher: the
127C<want_poll> callback would invoke C<ev_async_send> to wake up the event 127C<want_poll> callback would invoke C<ev_async_send> to wake up the event
128loop. Inside the callback set for the watcher, one would call C<eio_poll 128loop. 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 129()>.
130all requests have been handled yet). The race is taken care of because 130
131libev resets/rearms the async watcher before calling your callback, 131If C<eio_poll ()> is configured to not handle all results in one go
132and therefore, before calling C<eio_poll>. This might result in (some) 132(i.e. it returns C<-1>) then you should start an idle watcher that calls
133spurious wake-ups, but is generally harmless. 133C<eio_poll> until it returns something C<!= -1>.
134
135A full-featured conenctor between libeio and libev would look as follows
136(if C<eio_poll> is handling all requests, it can of course be simplified a
137lot by removing the idle watcher logic):
138
139 static struct ev_loop *loop;
140 static ev_idle repeat_watcher;
141 static ev_async ready_watcher;
142
143 /* idle watcher callback, only used when eio_poll */
144 /* didn't handle all results in one call */
145 static void
146 repeat (EV_P_ ev_idle *w, int revents)
147 {
148 if (eio_poll () != -1)
149 ev_idle_stop (EV_A_ w);
150 }
151
152 /* eio has some results, process them */
153 static void
154 ready (EV_P_ ev_async *w, int revents)
155 {
156 if (eio_poll () == -1)
157 ev_idle_start (EV_A_ &repeat_watcher);
158 }
159
160 /* wake up the event loop */
161 static void
162 want_poll (void)
163 {
164 ev_async_send (loop, &ready_watcher)
165 }
166
167 void
168 my_init_eio ()
169 {
170 loop = EV_DEFAULT;
171
172 ev_idle_init (&repeat_watcher, repeat);
173 ev_async_init (&ready_watcher, ready);
174 ev_async_start (loop &watcher);
175
176 eio_init (want_poll, 0);
177 }
134 178
135For most other event loops, you would typically use a pipe - the event 179For most other event loops, you would typically use a pipe - the event
136loop should be told to wait for read readiness on the read end. In 180loop should be told to wait for read readiness on the read end. In
137C<want_poll> you would write a single byte, in C<done_poll> you would try 181C<want_poll> you would write a single byte, in C<done_poll> you would try
138to read that byte, and in the callback for the read end, you would call 182to read that byte, and in the callback for the read end, you would call
139C<eio_poll>. The race is avoided here because the event loop should invoke
140your callback again and again until the byte has been read (as the pipe
141read callback does not read it, only C<done_poll>).
142
143=head2 CONFIGURATION
144
145The functions in this section can sometimes be useful, but the default
146configuration will do in most case, so you should skip this section on
147first reading.
148
149=over 4
150
151=item eio_set_max_poll_time (eio_tstamp nseconds)
152
153This causes C<eio_poll ()> to return after it has detected that it was
154running for C<nsecond> seconds or longer (this number can be fractional).
155
156This can be used to limit the amount of time spent handling eio requests,
157for example, in interactive programs, you might want to limit this time to
158C<0.01> seconds or so.
159
160Note that:
161
162a) libeio doesn't know how long your request callbacks take, so the time
163spent in C<eio_poll> is up to one callback invocation longer then this
164interval.
165
166b) this is implemented by calling C<gettimeofday> after each request,
167which can be costly.
168
169c) at least one request will be handled.
170
171=item eio_set_max_poll_reqs (unsigned int nreqs)
172
173When C<nreqs> is non-zero, then C<eio_poll> will not handle more than
174C<nreqs> requests per invocation. This is a less costly way to limit the
175amount of work done by C<eio_poll> then setting a time limit.
176
177If you know your callbacks are generally fast, you could use this to
178encourage interactiveness in your programs by setting it to C<10>, C<100>
179or even C<1000>.
180
181=item eio_set_min_parallel (unsigned int nthreads)
182
183Make sure libeio can handle at least this many requests in parallel. It
184might be able handle more.
185
186=item eio_set_max_parallel (unsigned int nthreads)
187
188Set the maximum number of threads that libeio will spawn.
189
190=item eio_set_max_idle (unsigned int nthreads)
191
192Libeio uses threads internally to handle most requests, and will start and stop threads on demand.
193
194This call can be used to limit the number of idle threads (threads without
195work to do): libeio will keep some threads idle in preparation for more
196requests, but never longer than C<nthreads> threads.
197
198In addition to this, libeio will also stop threads when they are idle for
199a few seconds, regardless of this setting.
200
201=item unsigned int eio_nthreads ()
202
203Return the number of worker threads currently running.
204
205=item unsigned int eio_nreqs ()
206
207Return the number of requests currently handled by libeio. This is the
208total number of requests that have been submitted to libeio, but not yet
209destroyed.
210
211=item unsigned int eio_nready ()
212
213Returns the number of ready requests, i.e. requests that have been
214submitted but have not yet entered the execution phase.
215
216=item unsigned int eio_npending ()
217
218Returns the number of pending requests, i.e. requests that have been
219executed and have results, but have not been finished yet by a call to
220C<eio_poll>). 183C<eio_poll>.
221 184
222=back 185You don't have to take special care in the case C<eio_poll> doesn't handle
186all requests, as the done callback will not be invoked, so the event loop
187will still signal readyness for the pipe until I<all> results have been
188processed.
223 189
224 190
225=head1 HIGH LEVEL REQUEST API 191=head1 HIGH LEVEL REQUEST API
226 192
227Libeio has both a high-level API, which consists of calling a request 193Libeio has both a high-level API, which consists of calling a request
234 200
235You submit a request by calling the relevant C<eio_TYPE> function with the 201You submit a request by calling the relevant C<eio_TYPE> function with the
236required parameters, a callback of type C<int (*eio_cb)(eio_req *req)> 202required 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. 203(called C<eio_cb> below) and a freely usable C<void *data> argument.
238 204
239The return value will either be 0 205The return value will either be 0, in case something went really wrong
206(which can basically only happen on very fatal errors, such as C<malloc>
207returning 0, which is rather unlikely), or a pointer to the newly-created
208and submitted C<eio_req *>.
240 209
241The callback will be called with an C<eio_req *> which contains the 210The callback will be called with an C<eio_req *> which contains the
242results of the request. The members you can access inside that structure 211results of the request. The members you can access inside that structure
243vary from request to request, except for: 212vary from request to request, except for:
244 213
307custom data value as C<data>. 276custom data value as C<data>.
308 277
309=head3 POSIX API WRAPPERS 278=head3 POSIX API WRAPPERS
310 279
311These requests simply wrap the POSIX call of the same name, with the same 280These requests simply wrap the POSIX call of the same name, with the same
312arguments: 281arguments. If a function is not implemented by the OS and cannot be emulated
282in some way, then all of these return C<-1> and set C<errorno> to C<ENOSYS>.
313 283
314=over 4 284=over 4
315 285
316=item eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data) 286=item eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
317 287
288=item eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
289
290=item eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
291
292=item eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
293
294=item eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
295
296=item eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
297
298=item eio_unlink (const char *path, int pri, eio_cb cb, void *data)
299
318=item eio_utime (const char *path, eio_tstamp atime, eio_tstamp mtime, int pri, eio_cb cb, void *data) 300=item eio_utime (const char *path, eio_tstamp atime, eio_tstamp mtime, int pri, eio_cb cb, void *data)
319 301
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) 302=item eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
341 303
342=item eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data) 304=item eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
343 305
344=item eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data) 306=item eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
345 307
346=item eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) 308=item eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
347 309
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) 310=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 311
354=item eio_close (int fd, int pri, eio_cb cb, void *data) 312=item eio_close (int fd, int pri, eio_cb cb, void *data)
355 313
356=item eio_sync (int pri, eio_cb cb, void *data) 314=item eio_sync (int pri, eio_cb cb, void *data)
357 315
386 344
387Not surprisingly, pread and pwrite are not thread-safe on Darwin (OS/X), 345Not surprisingly, pread and pwrite are not thread-safe on Darwin (OS/X),
388so it is advised not to submit multiple requests on the same fd on this 346so it is advised not to submit multiple requests on the same fd on this
389horrible pile of garbage. 347horrible pile of garbage.
390 348
349=item eio_mlockall (int flags, int pri, eio_cb cb, void *data)
350
351Like C<mlockall>, but the flag value constants are called
352C<EIO_MCL_CURRENT> and C<EIO_MCL_FUTURE>.
353
354=item eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
355
356Just like msync, except that the flag values are called C<EIO_MS_ASYNC>,
357C<EIO_MS_INVALIDATE> and C<EIO_MS_SYNC>.
358
359=item eio_readlink (const char *path, int pri, eio_cb cb, void *data)
360
361If successful, the path read by C<readlink(2)> can be accessed via C<<
362req->ptr2 >> and is I<NOT> null-terminated, with the length specified as
363C<< req->result >>.
364
365 if (req->result >= 0)
366 {
367 char *target = strndup ((char *)req->ptr2, req->result);
368
369 free (target);
370 }
371
372=item eio_realpath (const char *path, int pri, eio_cb cb, void *data)
373
374Similar to the realpath libc function, but unlike that one, result is
375C<-1> on failure and the length of the returned path in C<ptr2> (which is
376not 0-terminated) - this is similar to readlink.
377
378=item eio_stat (const char *path, int pri, eio_cb cb, void *data)
379
380=item eio_lstat (const char *path, int pri, eio_cb cb, void *data)
381
391=item eio_fstat (int fd, int pri, eio_cb cb, void *data) 382=item eio_fstat (int fd, int pri, eio_cb cb, void *data)
392 383
393Stats a file - if C<< req->result >> indicates success, then you can 384Stats a file - if C<< req->result >> indicates success, then you can
394access the C<struct stat>-like structure via C<< req->ptr2 >>: 385access the C<struct stat>-like structure via C<< req->ptr2 >>:
395 386
396 EIO_STRUCT_STAT *statdata = (EIO_STRUCT_STAT *)req->ptr2; 387 EIO_STRUCT_STAT *statdata = (EIO_STRUCT_STAT *)req->ptr2;
397 388
398=item eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) /* stat buffer=ptr2 allocated dynamically */ 389=item eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
390
391=item eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
399 392
400Stats a filesystem - if C<< req->result >> indicates success, then you can 393Stats a filesystem - if C<< req->result >> indicates success, then you can
401access the C<struct statvfs>-like structure via C<< req->ptr2 >>: 394access the C<struct statvfs>-like structure via C<< req->ptr2 >>:
402 395
403 EIO_STRUCT_STATVFS *statdata = (EIO_STRUCT_STATVFS *)req->ptr2; 396 EIO_STRUCT_STATVFS *statdata = (EIO_STRUCT_STATVFS *)req->ptr2;
419(via the C<opendir>, C<readdir> and C<closedir> calls) and returns either 412(via the C<opendir>, C<readdir> and C<closedir> calls) and returns either
420the names or an array of C<struct eio_dirent>, depending on the C<flags> 413the names or an array of C<struct eio_dirent>, depending on the C<flags>
421argument. 414argument.
422 415
423The C<< req->result >> indicates either the number of files found, or 416The C<< req->result >> indicates either the number of files found, or
424C<-1> on error. On success, zero-terminated names can be found as C<< req->ptr2 >>, 417C<-1> on error. On success, null-terminated names can be found as C<< req->ptr2 >>,
425and C<struct eio_dirents>, if requested by C<flags>, can be found via C<< 418and C<struct eio_dirents>, if requested by C<flags>, can be found via C<<
426req->ptr1 >>. 419req->ptr1 >>.
427 420
428Here is an example that prints all the names: 421Here is an example that prints all the names:
429 422
561=item eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) 554=item eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
562 555
563Calls C<sync_file_range>. If the syscall is missing, then this is the same 556Calls C<sync_file_range>. If the syscall is missing, then this is the same
564as calling C<fdatasync>. 557as calling C<fdatasync>.
565 558
559Flags can be any combination of C<EIO_SYNC_FILE_RANGE_WAIT_BEFORE>,
560C<EIO_SYNC_FILE_RANGE_WRITE> and C<EIO_SYNC_FILE_RANGE_WAIT_AFTER>.
561
566=back 562=back
567 563
568=head3 LIBEIO-SPECIFIC REQUESTS 564=head3 LIBEIO-SPECIFIC REQUESTS
569 565
570These requests are specific to libeio and do not correspond to any OS call. 566These requests are specific to libeio and do not correspond to any OS call.
571 567
572=over 4 568=over 4
573 569
574=item eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) 570=item eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
575 571
572Reads (C<flags == 0>) or modifies (C<flags == EIO_MT_MODIFY) the given
573memory area, page-wise, that is, it reads (or reads and writes back) the
574first octet of every page that spans the memory area.
575
576This can be used to page in some mmapped file, or dirty some pages. Note
577that dirtying is an unlocked read-write access, so races can ensue when
578the some other thread modifies the data stored in that memory area.
579
576=item eio_custom (void (*)(eio_req *) execute, int pri, eio_cb cb, void *data) 580=item eio_custom (void (*)(eio_req *) execute, int pri, eio_cb cb, void *data)
577 581
578Executes a custom request, i.e., a user-specified callback. 582Executes a custom request, i.e., a user-specified callback.
579 583
580The callback gets the C<eio_req *> as parameter and is expected to read 584The callback gets the C<eio_req *> as parameter and is expected to read
581and modify any request-specific members. Specifically, it should set C<< 585and modify any request-specific members. Specifically, it should set C<<
601 req->result = open (req->data, O_RDONLY); 605 req->result = open (req->data, O_RDONLY);
602 } 606 }
603 607
604 eio_custom (my_open, 0, my_open_done, "/etc/passwd"); 608 eio_custom (my_open, 0, my_open_done, "/etc/passwd");
605 609
606=item eio_busy (eio_tstamp delay, int pri, eio_cb cb, void *data) 610=item eio_busy (eio_tstamp delay, int pri, eio_cb cb, void *data)
607 611
608This is a a request that takes C<delay> seconds to execute, but otherwise 612This is a a request that takes C<delay> seconds to execute, but otherwise
609does nothing - it simply puts one of the worker threads to sleep for this 613does nothing - it simply puts one of the worker threads to sleep for this
610long. 614long.
611 615
612This request can be used to artificially increase load, e.g. for debugging 616This request can be used to artificially increase load, e.g. for debugging
613or benchmarking reasons. 617or benchmarking reasons.
614 618
615=item eio_nop (int pri, eio_cb cb, void *data) 619=item eio_nop (int pri, eio_cb cb, void *data)
616 620
617This request does nothing, except go through the whole request cycle. This 621This request does nothing, except go through the whole request cycle. This
618can be used to measure latency or in some cases to simplify code, but is 622can be used to measure latency or in some cases to simplify code, but is
619not really of much use. 623not really of much use.
620 624
621=back 625=back
622 626
623=head3 GROUPING AND LIMITING REQUESTS 627=head3 GROUPING AND LIMITING REQUESTS
628
629There is one more rather special request, C<eio_grp>. It is a very special
630aio request: Instead of doing something, it is a container for other eio
631requests.
632
633There are two primary use cases for this: a) bundle many requests into a
634single, composite, request with a definite callback and the ability to
635cancel the whole request with its subrequests and b) limiting the number
636of "active" requests.
637
638Further below you will find more dicussion of these topics - first follows
639the reference section detailing the request generator and other methods.
640
641=over 4
642
643=item eio_grp (eio_cb cb, void *data)
644
645Creates and submits a group request.
646
647=back
648
649
624 650
625#TODO 651#TODO
626 652
627/*****************************************************************************/ 653/*****************************************************************************/
628/* groups */ 654/* groups */
660 686
661zero 687zero
662 688
663#TODO 689#TODO
664 690
691=head2 CONFIGURATION
692
693The functions in this section can sometimes be useful, but the default
694configuration will do in most case, so you should skip this section on
695first reading.
696
697=over 4
698
699=item eio_set_max_poll_time (eio_tstamp nseconds)
700
701This causes C<eio_poll ()> to return after it has detected that it was
702running for C<nsecond> seconds or longer (this number can be fractional).
703
704This can be used to limit the amount of time spent handling eio requests,
705for example, in interactive programs, you might want to limit this time to
706C<0.01> seconds or so.
707
708Note that:
709
710a) libeio doesn't know how long your request callbacks take, so the time
711spent in C<eio_poll> is up to one callback invocation longer then this
712interval.
713
714b) this is implemented by calling C<gettimeofday> after each request,
715which can be costly.
716
717c) at least one request will be handled.
718
719=item eio_set_max_poll_reqs (unsigned int nreqs)
720
721When C<nreqs> is non-zero, then C<eio_poll> will not handle more than
722C<nreqs> requests per invocation. This is a less costly way to limit the
723amount of work done by C<eio_poll> then setting a time limit.
724
725If you know your callbacks are generally fast, you could use this to
726encourage interactiveness in your programs by setting it to C<10>, C<100>
727or even C<1000>.
728
729=item eio_set_min_parallel (unsigned int nthreads)
730
731Make sure libeio can handle at least this many requests in parallel. It
732might be able handle more.
733
734=item eio_set_max_parallel (unsigned int nthreads)
735
736Set the maximum number of threads that libeio will spawn.
737
738=item eio_set_max_idle (unsigned int nthreads)
739
740Libeio uses threads internally to handle most requests, and will start and stop threads on demand.
741
742This call can be used to limit the number of idle threads (threads without
743work to do): libeio will keep some threads idle in preparation for more
744requests, but never longer than C<nthreads> threads.
745
746In addition to this, libeio will also stop threads when they are idle for
747a few seconds, regardless of this setting.
748
749=item unsigned int eio_nthreads ()
750
751Return the number of worker threads currently running.
752
753=item unsigned int eio_nreqs ()
754
755Return the number of requests currently handled by libeio. This is the
756total number of requests that have been submitted to libeio, but not yet
757destroyed.
758
759=item unsigned int eio_nready ()
760
761Returns the number of ready requests, i.e. requests that have been
762submitted but have not yet entered the execution phase.
763
764=item unsigned int eio_npending ()
765
766Returns the number of pending requests, i.e. requests that have been
767executed and have results, but have not been finished yet by a call to
768C<eio_poll>).
769
770=back
771
665=head1 EMBEDDING 772=head1 EMBEDDING
666 773
667Libeio can be embedded directly into programs. This functionality is not 774Libeio can be embedded directly into programs. This functionality is not
668documented and not (yet) officially supported. 775documented and not (yet) officially supported.
669 776

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines