]>
Commit | Line | Data |
---|---|---|
bc74112f GA |
1 | /* |
2 | * QEMU Boot Device Implement | |
3 | * | |
4 | * Copyright (c) 2014 HUAWEI TECHNOLOGIES CO.,LTD. | |
5 | * | |
6 | * Permission is hereby granted, free of charge, to any person obtaining a copy | |
7 | * of this software and associated documentation files (the "Software"), to deal | |
8 | * in the Software without restriction, including without limitation the rights | |
9 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
10 | * copies of the Software, and to permit persons to whom the Software is | |
11 | * furnished to do so, subject to the following conditions: | |
12 | * | |
13 | * The above copyright notice and this permission notice shall be included in | |
14 | * all copies or substantial portions of the Software. | |
15 | * | |
16 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
17 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
18 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL | |
19 | * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
20 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
21 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN | |
22 | * THE SOFTWARE. | |
23 | */ | |
24 | ||
25 | #include "sysemu/sysemu.h" | |
26 | ||
27 | typedef struct FWBootEntry FWBootEntry; | |
28 | ||
29 | struct FWBootEntry { | |
30 | QTAILQ_ENTRY(FWBootEntry) link; | |
31 | int32_t bootindex; | |
32 | DeviceState *dev; | |
33 | char *suffix; | |
34 | }; | |
35 | ||
36 | static QTAILQ_HEAD(, FWBootEntry) fw_boot_order = | |
37 | QTAILQ_HEAD_INITIALIZER(fw_boot_order); | |
38 | ||
39 | void add_boot_device_path(int32_t bootindex, DeviceState *dev, | |
40 | const char *suffix) | |
41 | { | |
42 | FWBootEntry *node, *i; | |
43 | ||
44 | if (bootindex < 0) { | |
45 | return; | |
46 | } | |
47 | ||
48 | assert(dev != NULL || suffix != NULL); | |
49 | ||
50 | node = g_malloc0(sizeof(FWBootEntry)); | |
51 | node->bootindex = bootindex; | |
52 | node->suffix = g_strdup(suffix); | |
53 | node->dev = dev; | |
54 | ||
55 | QTAILQ_FOREACH(i, &fw_boot_order, link) { | |
56 | if (i->bootindex == bootindex) { | |
57 | fprintf(stderr, "Two devices with same boot index %d\n", bootindex); | |
58 | exit(1); | |
59 | } else if (i->bootindex < bootindex) { | |
60 | continue; | |
61 | } | |
62 | QTAILQ_INSERT_BEFORE(i, node, link); | |
63 | return; | |
64 | } | |
65 | QTAILQ_INSERT_TAIL(&fw_boot_order, node, link); | |
66 | } | |
67 | ||
68 | DeviceState *get_boot_device(uint32_t position) | |
69 | { | |
70 | uint32_t counter = 0; | |
71 | FWBootEntry *i = NULL; | |
72 | DeviceState *res = NULL; | |
73 | ||
74 | if (!QTAILQ_EMPTY(&fw_boot_order)) { | |
75 | QTAILQ_FOREACH(i, &fw_boot_order, link) { | |
76 | if (counter == position) { | |
77 | res = i->dev; | |
78 | break; | |
79 | } | |
80 | counter++; | |
81 | } | |
82 | } | |
83 | return res; | |
84 | } | |
85 | ||
86 | /* | |
87 | * This function returns null terminated string that consist of new line | |
88 | * separated device paths. | |
89 | * | |
90 | * memory pointed by "size" is assigned total length of the array in bytes | |
91 | * | |
92 | */ | |
93 | char *get_boot_devices_list(size_t *size, bool ignore_suffixes) | |
94 | { | |
95 | FWBootEntry *i; | |
96 | size_t total = 0; | |
97 | char *list = NULL; | |
98 | ||
99 | QTAILQ_FOREACH(i, &fw_boot_order, link) { | |
100 | char *devpath = NULL, *bootpath; | |
101 | size_t len; | |
102 | ||
103 | if (i->dev) { | |
104 | devpath = qdev_get_fw_dev_path(i->dev); | |
105 | assert(devpath); | |
106 | } | |
107 | ||
108 | if (i->suffix && !ignore_suffixes && devpath) { | |
109 | size_t bootpathlen = strlen(devpath) + strlen(i->suffix) + 1; | |
110 | ||
111 | bootpath = g_malloc(bootpathlen); | |
112 | snprintf(bootpath, bootpathlen, "%s%s", devpath, i->suffix); | |
113 | g_free(devpath); | |
114 | } else if (devpath) { | |
115 | bootpath = devpath; | |
116 | } else if (!ignore_suffixes) { | |
117 | assert(i->suffix); | |
118 | bootpath = g_strdup(i->suffix); | |
119 | } else { | |
120 | bootpath = g_strdup(""); | |
121 | } | |
122 | ||
123 | if (total) { | |
124 | list[total-1] = '\n'; | |
125 | } | |
126 | len = strlen(bootpath) + 1; | |
127 | list = g_realloc(list, total + len); | |
128 | memcpy(&list[total], bootpath, len); | |
129 | total += len; | |
130 | g_free(bootpath); | |
131 | } | |
132 | ||
133 | *size = total; | |
134 | ||
135 | if (boot_strict && *size > 0) { | |
136 | list[total-1] = '\n'; | |
137 | list = g_realloc(list, total + 5); | |
138 | memcpy(&list[total], "HALT", 5); | |
139 | *size = total + 5; | |
140 | } | |
141 | return list; | |
142 | } |