[prev in list] [next in list] [prev in thread] [next in thread] 

List:       libusb-devel
Subject:    Re: [Libusb-devel] libusb darwin patches
From:       Hoi-Ho Chan <hoiho.chan () gmail ! com>
Date:       2010-07-26 4:32:25
Message-ID: AANLkTimGsyXs0a7NafXSs_P89QtxNVqUSON3inf41Je3 () mail ! gmail ! com
[Download RAW message or body]

[Attachment #2 (multipart/alternative)]


Hi

On Sat, Jul 24, 2010 at 1:02 PM, Daniel Drake <dan@reactivated.net> wrote:

>  >   - Handle underrun errors as warnings
>
> What is an underrun in this context?
> Is it, for example, when the user requests a transfer of 512 bytes and a
> smaller number of bytes is returned?
>
>
    Yes. It means data was returned less than the specified max packet size.

Thanks
Hoi-Ho

[Attachment #5 (text/html)]

Hi<br><br><div class="gmail_quote">On Sat, Jul 24, 2010 at 1:02 PM, Daniel Drake \
<span dir="ltr">&lt;<a \
href="mailto:dan@reactivated.net">dan@reactivated.net</a>&gt;</span> \
wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px \
#ccc solid;padding-left:1ex;"> <div class="im"> &gt;   - Handle underrun errors as \
warnings<br> <br>
</div>What is an underrun in this context?<br>
Is it, for example, when the user requests a transfer of 512 bytes and a<br>
smaller number of bytes is returned?<br>
<br></blockquote><div><br></div><div>    Yes. It means data was returned less than \
the specified max packet size.</div><div><br></div><div>Thanks</div><div>Hoi-Ho \
</div></div>



------------------------------------------------------------------------------
The Palm PDK Hot Apps Program offers developers who use the
Plug-In Development Kit to bring their C/C++ apps to Palm for a share 
of $1 Million in cash or HP Products. Visit us here for more details:
http://ad.doubleclick.net/clk;226879339;13503038;l?
http://clk.atdmt.com/CRS/go/247765532/direct/01/

_______________________________________________
Libusb-devel mailing list
Libusb-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/libusb-devel


[prev in list] [next in list] [prev in thread] [next in thread]