Lines Matching defs:to
35 /* #2 used to be MON_IOCX_URB, removed before it got into Linus tree */
53 * But it's all right. Just use a simple way to make sure the chunk is never
66 * application to pick data once in two ticks. This way, another application,
67 * which presumably drives the bus, gets to hog CPU, yet we collect our data.
75 * XXX What about multi-megabyte URBs which take minutes to transfer?
87 u64 id; /* URB ID - from submission to callback */
115 * This has to take 16 bytes to make sure that the end of buffer
139 u32 nfetch; /* Number of events to fetch (out: fetched) */
140 u32 nflush; /* Number of events to flush */
259 char __user *to, int length)
278 if (copy_to_user(to, buf, step_len))
281 to += step_len;
309 * buffers to wrap. This is needed by applications which pass references
315 * When a buffer would wrap, we place a filler packet to mark the space.
329 * skipping to the end of the buffer. If we do, place
353 * Return a few (kilo-)bytes to the head of the buffer.
367 * This has to be called under both b_lock and fetch_lock, because
424 /* Copy up to the first non-addressable segment */
442 * be used to determine the length of the whole contiguous buffer.
729 * Extract an event from buffer and copy it to user space.
851 * Check if whole packet was read, and if so, jump to the next one.
1009 * buffer is allocated before releasing the old one to be sure
1059 if (getb.alloc > 0x10000000) /* Want to cast to u32 */
1207 * mapped, to use the proper memory allocation function.
1222 * Map ring pages to user space.