Remove old lguest bus and drivers.
[deliverable/linux.git] / drivers / lguest / hypercalls.c
CommitLineData
f938d2c8
RR
1/*P:500 Just as userspace programs request kernel operations through a system
2 * call, the Guest requests Host operations through a "hypercall". You might
3 * notice this nomenclature doesn't really follow any logic, but the name has
4 * been around for long enough that we're stuck with it. As you'd expect, this
5 * code is basically a one big switch statement. :*/
6
7/* Copyright (C) 2006 Rusty Russell IBM Corporation
d7e28ffe
RR
8
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
13
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22*/
23#include <linux/uaccess.h>
24#include <linux/syscalls.h>
25#include <linux/mm.h>
26#include <asm/page.h>
27#include <asm/pgtable.h>
d7e28ffe
RR
28#include "lg.h"
29
b410e7b1
JS
30/*H:120 This is the core hypercall routine: where the Guest gets what it wants.
31 * Or gets killed. Or, in the case of LHCALL_CRASH, both. */
32static void do_hcall(struct lguest *lg, struct hcall_args *args)
d7e28ffe 33{
b410e7b1 34 switch (args->arg0) {
d7e28ffe 35 case LHCALL_FLUSH_ASYNC:
bff672e6
RR
36 /* This call does nothing, except by breaking out of the Guest
37 * it makes us process all the asynchronous hypercalls. */
d7e28ffe
RR
38 break;
39 case LHCALL_LGUEST_INIT:
bff672e6
RR
40 /* You can't get here unless you're already initialized. Don't
41 * do that. */
d7e28ffe
RR
42 kill_guest(lg, "already have lguest_data");
43 break;
44 case LHCALL_CRASH: {
bff672e6
RR
45 /* Crash is such a trivial hypercall that we do it in four
46 * lines right here. */
d7e28ffe 47 char msg[128];
bff672e6
RR
48 /* If the lgread fails, it will call kill_guest() itself; the
49 * kill_guest() with the message will be ignored. */
b410e7b1 50 lgread(lg, msg, args->arg1, sizeof(msg));
d7e28ffe
RR
51 msg[sizeof(msg)-1] = '\0';
52 kill_guest(lg, "CRASH: %s", msg);
53 break;
54 }
55 case LHCALL_FLUSH_TLB:
bff672e6
RR
56 /* FLUSH_TLB comes in two flavors, depending on the
57 * argument: */
b410e7b1 58 if (args->arg1)
d7e28ffe
RR
59 guest_pagetable_clear_all(lg);
60 else
61 guest_pagetable_flush_user(lg);
62 break;
d7e28ffe 63 case LHCALL_BIND_DMA:
bff672e6
RR
64 /* BIND_DMA really wants four arguments, but it's the only call
65 * which does. So the Guest packs the number of buffers and
66 * the interrupt number into the final argument, and we decode
67 * it here. This can legitimately fail, since we currently
68 * place a limit on the number of DMA pools a Guest can have.
69 * So we return true or false from this call. */
b410e7b1
JS
70 args->arg0 = bind_dma(lg, args->arg1, args->arg2,
71 args->arg3 >> 8, args->arg3 & 0xFF);
d7e28ffe 72 break;
bff672e6
RR
73
74 /* All these calls simply pass the arguments through to the right
75 * routines. */
d7e28ffe 76 case LHCALL_SEND_DMA:
b410e7b1 77 send_dma(lg, args->arg1, args->arg2);
d7e28ffe
RR
78 break;
79 case LHCALL_NEW_PGTABLE:
b410e7b1 80 guest_new_pagetable(lg, args->arg1);
d7e28ffe
RR
81 break;
82 case LHCALL_SET_STACK:
b410e7b1 83 guest_set_stack(lg, args->arg1, args->arg2, args->arg3);
d7e28ffe
RR
84 break;
85 case LHCALL_SET_PTE:
df29f43e 86 guest_set_pte(lg, args->arg1, args->arg2, __pte(args->arg3));
d7e28ffe
RR
87 break;
88 case LHCALL_SET_PMD:
b410e7b1 89 guest_set_pmd(lg, args->arg1, args->arg2);
d7e28ffe
RR
90 break;
91 case LHCALL_SET_CLOCKEVENT:
b410e7b1 92 guest_set_clockevent(lg, args->arg1);
d7e28ffe
RR
93 break;
94 case LHCALL_TS:
bff672e6 95 /* This sets the TS flag, as we saw used in run_guest(). */
b410e7b1 96 lg->ts = args->arg1;
d7e28ffe
RR
97 break;
98 case LHCALL_HALT:
bff672e6 99 /* Similarly, this sets the halted flag for run_guest(). */
d7e28ffe
RR
100 lg->halted = 1;
101 break;
102 default:
b410e7b1
JS
103 if (lguest_arch_do_hcall(lg, args))
104 kill_guest(lg, "Bad hypercall %li\n", args->arg0);
d7e28ffe
RR
105 }
106}
b410e7b1 107/*:*/
d7e28ffe 108
b410e7b1
JS
109/*H:124 Asynchronous hypercalls are easy: we just look in the array in the
110 * Guest's "struct lguest_data" to see if any new ones are marked "ready".
bff672e6
RR
111 *
112 * We are careful to do these in order: obviously we respect the order the
113 * Guest put them in the ring, but we also promise the Guest that they will
114 * happen before any normal hypercall (which is why we check this before
115 * checking for a normal hcall). */
d7e28ffe
RR
116static void do_async_hcalls(struct lguest *lg)
117{
118 unsigned int i;
119 u8 st[LHCALL_RING_SIZE];
120
bff672e6 121 /* For simplicity, we copy the entire call status array in at once. */
d7e28ffe
RR
122 if (copy_from_user(&st, &lg->lguest_data->hcall_status, sizeof(st)))
123 return;
124
bff672e6 125 /* We process "struct lguest_data"s hcalls[] ring once. */
d7e28ffe 126 for (i = 0; i < ARRAY_SIZE(st); i++) {
b410e7b1 127 struct hcall_args args;
bff672e6
RR
128 /* We remember where we were up to from last time. This makes
129 * sure that the hypercalls are done in the order the Guest
130 * places them in the ring. */
d7e28ffe
RR
131 unsigned int n = lg->next_hcall;
132
bff672e6 133 /* 0xFF means there's no call here (yet). */
d7e28ffe
RR
134 if (st[n] == 0xFF)
135 break;
136
bff672e6
RR
137 /* OK, we have hypercall. Increment the "next_hcall" cursor,
138 * and wrap back to 0 if we reach the end. */
d7e28ffe
RR
139 if (++lg->next_hcall == LHCALL_RING_SIZE)
140 lg->next_hcall = 0;
141
b410e7b1
JS
142 /* Copy the hypercall arguments into a local copy of
143 * the hcall_args struct. */
144 if (copy_from_user(&args, &lg->lguest_data->hcalls[n],
145 sizeof(struct hcall_args))) {
d7e28ffe
RR
146 kill_guest(lg, "Fetching async hypercalls");
147 break;
148 }
149
bff672e6 150 /* Do the hypercall, same as a normal one. */
b410e7b1 151 do_hcall(lg, &args);
bff672e6
RR
152
153 /* Mark the hypercall done. */
d7e28ffe
RR
154 if (put_user(0xFF, &lg->lguest_data->hcall_status[n])) {
155 kill_guest(lg, "Writing result for async hypercall");
156 break;
157 }
158
bff672e6
RR
159 /* Stop doing hypercalls if we've just done a DMA to the
160 * Launcher: it needs to service this first. */
d7e28ffe
RR
161 if (lg->dma_is_pending)
162 break;
163 }
164}
165
bff672e6
RR
166/* Last of all, we look at what happens first of all. The very first time the
167 * Guest makes a hypercall, we end up here to set things up: */
d7e28ffe
RR
168static void initialize(struct lguest *lg)
169{
d7e28ffe 170
bff672e6
RR
171 /* You can't do anything until you're initialized. The Guest knows the
172 * rules, so we're unforgiving here. */
b410e7b1
JS
173 if (lg->hcall->arg0 != LHCALL_LGUEST_INIT) {
174 kill_guest(lg, "hypercall %li before INIT", lg->hcall->arg0);
d7e28ffe
RR
175 return;
176 }
177
b410e7b1 178 if (lguest_arch_init_hypercalls(lg))
d7e28ffe 179 kill_guest(lg, "bad guest page %p", lg->lguest_data);
3c6b5bfa 180
bff672e6
RR
181 /* The Guest tells us where we're not to deliver interrupts by putting
182 * the range of addresses into "struct lguest_data". */
d7e28ffe 183 if (get_user(lg->noirq_start, &lg->lguest_data->noirq_start)
47436aa4 184 || get_user(lg->noirq_end, &lg->lguest_data->noirq_end))
d7e28ffe
RR
185 kill_guest(lg, "bad guest page %p", lg->lguest_data);
186
6c8dca5d
RR
187 /* We write the current time into the Guest's data page once now. */
188 write_timestamp(lg);
189
47436aa4
RR
190 /* page_tables.c will also do some setup. */
191 page_table_guest_data_init(lg);
192
bff672e6
RR
193 /* This is the one case where the above accesses might have been the
194 * first write to a Guest page. This may have caused a copy-on-write
195 * fault, but the Guest might be referring to the old (read-only)
196 * page. */
d7e28ffe
RR
197 guest_pagetable_clear_all(lg);
198}
199
bff672e6
RR
200/*H:100
201 * Hypercalls
202 *
203 * Remember from the Guest, hypercalls come in two flavors: normal and
204 * asynchronous. This file handles both of types.
205 */
d7e28ffe
RR
206void do_hypercalls(struct lguest *lg)
207{
cc6d4fbc 208 /* Not initialized yet? This hypercall must do it. */
d7e28ffe 209 if (unlikely(!lg->lguest_data)) {
cc6d4fbc
RR
210 /* Set up the "struct lguest_data" */
211 initialize(lg);
212 /* Hcall is done. */
213 lg->hcall = NULL;
d7e28ffe
RR
214 return;
215 }
216
bff672e6
RR
217 /* The Guest has initialized.
218 *
219 * Look in the hypercall ring for the async hypercalls: */
d7e28ffe 220 do_async_hcalls(lg);
bff672e6
RR
221
222 /* If we stopped reading the hypercall ring because the Guest did a
cc6d4fbc
RR
223 * SEND_DMA to the Launcher, we want to return now. Otherwise we do
224 * the hypercall. */
225 if (!lg->dma_is_pending) {
226 do_hcall(lg, lg->hcall);
227 /* Tricky point: we reset the hcall pointer to mark the
228 * hypercall as "done". We use the hcall pointer rather than
229 * the trap number to indicate a hypercall is pending.
230 * Normally it doesn't matter: the Guest will run again and
231 * update the trap number before we come back here.
232 *
233 * However, if we are signalled or the Guest sends DMA to the
234 * Launcher, the run_guest() loop will exit without running the
235 * Guest. When it comes back it would try to re-run the
236 * hypercall. */
237 lg->hcall = NULL;
d7e28ffe
RR
238 }
239}
6c8dca5d
RR
240
241/* This routine supplies the Guest with time: it's used for wallclock time at
242 * initial boot and as a rough time source if the TSC isn't available. */
243void write_timestamp(struct lguest *lg)
244{
245 struct timespec now;
246 ktime_get_real_ts(&now);
891ff65f 247 if (copy_to_user(&lg->lguest_data->time, &now, sizeof(struct timespec)))
6c8dca5d
RR
248 kill_guest(lg, "Writing timestamp");
249}
This page took 0.079294 seconds and 5 git commands to generate.