|
|
1.1 root 1: /*
2: * QEMU USB emulation, libhw bits.
3: *
4: * Permission is hereby granted, free of charge, to any person obtaining a copy
5: * of this software and associated documentation files (the "Software"), to deal
6: * in the Software without restriction, including without limitation the rights
7: * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8: * copies of the Software, and to permit persons to whom the Software is
9: * furnished to do so, subject to the following conditions:
10: *
11: * The above copyright notice and this permission notice shall be included in
12: * all copies or substantial portions of the Software.
13: *
14: * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15: * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17: * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19: * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
20: * THE SOFTWARE.
21: */
22: #include "qemu-common.h"
23: #include "cpu-common.h"
24: #include "hw/usb.h"
25: #include "dma.h"
26:
27: int usb_packet_map(USBPacket *p, QEMUSGList *sgl)
28: {
29: int is_write = (p->pid == USB_TOKEN_IN);
30: target_phys_addr_t len;
31: void *mem;
32: int i;
33:
34: for (i = 0; i < sgl->nsg; i++) {
35: len = sgl->sg[i].len;
36: mem = cpu_physical_memory_map(sgl->sg[i].base, &len,
37: is_write);
38: if (!mem) {
39: goto err;
40: }
41: qemu_iovec_add(&p->iov, mem, len);
42: if (len != sgl->sg[i].len) {
43: goto err;
44: }
45: }
46: return 0;
47:
48: err:
49: usb_packet_unmap(p);
50: return -1;
51: }
52:
53: void usb_packet_unmap(USBPacket *p)
54: {
55: int is_write = (p->pid == USB_TOKEN_IN);
56: int i;
57:
58: for (i = 0; i < p->iov.niov; i++) {
59: cpu_physical_memory_unmap(p->iov.iov[i].iov_base,
60: p->iov.iov[i].iov_len, is_write,
61: p->iov.iov[i].iov_len);
62: }
63: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.