1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
|
/*
* Mach Operating System
* Copyright (c) 1994,1993,1992,1991 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*/
/*
* User LDT management.
* Each thread in a task may have its own LDT.
*/
#include <string.h>
#include <kern/kalloc.h>
#include <kern/thread.h>
#include <vm/vm_kern.h>
#include <i386/seg.h>
#include <i386/thread.h>
#include <i386/user_ldt.h>
#include "ldt.h"
#include "vm_param.h"
char acc_type[8][3] = {
/* code stack data */
{ 0, 0, 1 }, /* data */
{ 0, 1, 1 }, /* data, writable */
{ 0, 0, 1 }, /* data, expand-down */
{ 0, 1, 1 }, /* data, writable, expand-down */
{ 1, 0, 0 }, /* code */
{ 1, 0, 1 }, /* code, readable */
{ 1, 0, 0 }, /* code, conforming */
{ 1, 0, 1 }, /* code, readable, conforming */
};
boolean_t selector_check(thread, sel, type)
thread_t thread;
int sel;
int type; /* code, stack, data */
{
struct user_ldt *ldt;
int access;
ldt = thread->pcb->ims.ldt;
if (ldt == 0) {
switch (type) {
case S_CODE:
return sel == USER_CS;
case S_STACK:
return sel == USER_DS;
case S_DATA:
return sel == 0 ||
sel == USER_CS ||
sel == USER_DS;
}
}
if (type != S_DATA && sel == 0)
return FALSE;
if ((sel & (SEL_LDT|SEL_PL)) != (SEL_LDT|SEL_PL_U)
|| sel > ldt->desc.limit_low)
return FALSE;
access = ldt->ldt[sel_idx(sel)].access;
if ((access & (ACC_P|ACC_PL|ACC_TYPE_USER))
!= (ACC_P|ACC_PL_U|ACC_TYPE_USER))
return FALSE;
/* present, pl == pl.user, not system */
return acc_type[(access & 0xe)>>1][type];
}
/*
* Add the descriptors to the LDT, starting with
* the descriptor for 'first_selector'.
*/
kern_return_t
i386_set_ldt(thread, first_selector, desc_list, count, desc_list_inline)
thread_t thread;
int first_selector;
struct real_descriptor *desc_list;
unsigned int count;
boolean_t desc_list_inline;
{
user_ldt_t new_ldt, old_ldt, temp;
struct real_descriptor *dp;
int i;
int min_selector = 0;
pcb_t pcb;
vm_size_t ldt_size_needed;
int first_desc = sel_idx(first_selector);
vm_map_copy_t old_copy_object;
if (thread == THREAD_NULL)
return KERN_INVALID_ARGUMENT;
if (thread == current_thread())
min_selector = LDTSZ;
if (first_desc < min_selector || first_desc > 8191)
return KERN_INVALID_ARGUMENT;
if (first_desc + count >= 8192)
return KERN_INVALID_ARGUMENT;
/*
* If desc_list is not inline, it is in copyin form.
* We must copy it out to the kernel map, and wire
* it down (we touch it while the PCB is locked).
*
* We make a copy of the copyin object, and clear
* out the old one, so that returning KERN_INVALID_ARGUMENT
* will not try to deallocate the data twice.
*/
if (!desc_list_inline) {
kern_return_t kr;
vm_offset_t dst_addr;
old_copy_object = (vm_map_copy_t) desc_list;
kr = vm_map_copyout(ipc_kernel_map, &dst_addr,
vm_map_copy_copy(old_copy_object));
if (kr != KERN_SUCCESS)
return kr;
(void) vm_map_pageable(ipc_kernel_map,
dst_addr,
dst_addr + count * sizeof(struct real_descriptor),
VM_PROT_READ|VM_PROT_WRITE);
desc_list = (struct real_descriptor *)dst_addr;
}
for (i = 0, dp = desc_list;
i < count;
i++, dp++)
{
switch (dp->access & ~ACC_A) {
case 0:
case ACC_P:
/* valid empty descriptor */
break;
case ACC_P | ACC_CALL_GATE:
/* Mach kernel call */
*dp = *(struct real_descriptor *)
&ldt[sel_idx(USER_SCALL)];
break;
case ACC_P | ACC_PL_U | ACC_DATA:
case ACC_P | ACC_PL_U | ACC_DATA_W:
case ACC_P | ACC_PL_U | ACC_DATA_E:
case ACC_P | ACC_PL_U | ACC_DATA_EW:
case ACC_P | ACC_PL_U | ACC_CODE:
case ACC_P | ACC_PL_U | ACC_CODE_R:
case ACC_P | ACC_PL_U | ACC_CODE_C:
case ACC_P | ACC_PL_U | ACC_CODE_CR:
case ACC_P | ACC_PL_U | ACC_CALL_GATE_16:
case ACC_P | ACC_PL_U | ACC_CALL_GATE:
break;
default:
return KERN_INVALID_ARGUMENT;
}
}
ldt_size_needed = sizeof(struct real_descriptor)
* (first_desc + count);
pcb = thread->pcb;
new_ldt = 0;
Retry:
simple_lock(&pcb->lock);
old_ldt = pcb->ims.ldt;
if (old_ldt == 0 ||
old_ldt->desc.limit_low + 1 < ldt_size_needed)
{
/*
* No old LDT, or not big enough
*/
if (new_ldt == 0) {
simple_unlock(&pcb->lock);
new_ldt = (user_ldt_t)
kalloc(ldt_size_needed
+ sizeof(struct real_descriptor));
/*
* Build a descriptor that describes the
* LDT itself
*/
{
vm_offset_t ldt_base;
ldt_base = kvtolin(&new_ldt->ldt[0]);
new_ldt->desc.limit_low = ldt_size_needed - 1;
new_ldt->desc.limit_high = 0;
new_ldt->desc.base_low = ldt_base & 0xffff;
new_ldt->desc.base_med = (ldt_base >> 16) & 0xff;
new_ldt->desc.base_high = ldt_base >> 24;
new_ldt->desc.access = ACC_P | ACC_LDT;
new_ldt->desc.granularity = 0;
}
goto Retry;
}
/*
* Have new LDT. If there was a an old ldt, copy descriptors
* from old to new. Otherwise copy the default ldt.
*/
if (old_ldt) {
memcpy(&new_ldt->ldt[0],
&old_ldt->ldt[0],
old_ldt->desc.limit_low + 1);
}
else {
struct real_descriptor template = {0, 0, 0, ACC_P, 0, 0 ,0};
for (dp = &new_ldt->ldt[0], i = 0; i < first_desc; i++, dp++) {
if (i < LDTSZ)
*dp = *(struct real_descriptor *) &ldt[i];
else
*dp = template;
}
}
temp = old_ldt;
old_ldt = new_ldt; /* use new LDT from now on */
new_ldt = temp; /* discard old LDT */
pcb->ims.ldt = old_ldt; /* set LDT for thread */
/*
* If we are modifying the LDT for the current thread,
* make sure it is properly set.
*/
if (thread == current_thread())
switch_ktss(pcb);
}
/*
* Install new descriptors.
*/
memcpy(&old_ldt->ldt[first_desc],
desc_list,
count * sizeof(struct real_descriptor));
simple_unlock(&pcb->lock);
if (new_ldt)
kfree((vm_offset_t)new_ldt,
new_ldt->desc.limit_low + 1
+ sizeof(struct real_descriptor));
/*
* Free the descriptor list, if it was
* out-of-line. Also discard the original
* copy object for it.
*/
if (!desc_list_inline) {
(void) kmem_free(ipc_kernel_map,
(vm_offset_t) desc_list,
count * sizeof(struct real_descriptor));
vm_map_copy_discard(old_copy_object);
}
return KERN_SUCCESS;
}
kern_return_t
i386_get_ldt(thread, first_selector, selector_count, desc_list, count)
thread_t thread;
int first_selector;
int selector_count; /* number wanted */
struct real_descriptor **desc_list; /* in/out */
unsigned int *count; /* in/out */
{
struct user_ldt *user_ldt;
pcb_t pcb = thread->pcb;
int first_desc = sel_idx(first_selector);
unsigned int ldt_count;
vm_size_t ldt_size;
vm_size_t size, size_needed;
vm_offset_t addr;
if (thread == THREAD_NULL)
return KERN_INVALID_ARGUMENT;
if (first_desc < 0 || first_desc > 8191)
return KERN_INVALID_ARGUMENT;
if (first_desc + selector_count >= 8192)
return KERN_INVALID_ARGUMENT;
addr = 0;
size = 0;
for (;;) {
simple_lock(&pcb->lock);
user_ldt = pcb->ims.ldt;
if (user_ldt == 0) {
simple_unlock(&pcb->lock);
if (addr)
kmem_free(ipc_kernel_map, addr, size);
*count = 0;
return KERN_SUCCESS;
}
/*
* Find how many descriptors we should return.
*/
ldt_count = (user_ldt->desc.limit_low + 1) /
sizeof (struct real_descriptor);
ldt_count -= first_desc;
if (ldt_count > selector_count)
ldt_count = selector_count;
ldt_size = ldt_count * sizeof(struct real_descriptor);
/*
* Do we have the memory we need?
*/
if (ldt_count <= *count)
break; /* fits in-line */
size_needed = round_page(ldt_size);
if (size_needed <= size)
break;
/*
* Unlock the pcb and allocate more memory
*/
simple_unlock(&pcb->lock);
if (size != 0)
kmem_free(ipc_kernel_map, addr, size);
size = size_needed;
if (kmem_alloc(ipc_kernel_map, &addr, size)
!= KERN_SUCCESS)
return KERN_RESOURCE_SHORTAGE;
}
/*
* copy out the descriptors
*/
memcpy(*desc_list,
&user_ldt->ldt[first_desc],
ldt_size);
*count = ldt_count;
simple_unlock(&pcb->lock);
if (addr) {
vm_size_t size_used, size_left;
vm_map_copy_t memory;
/*
* Free any unused memory beyond the end of the last page used
*/
size_used = round_page(ldt_size);
if (size_used != size)
kmem_free(ipc_kernel_map,
addr + size_used, size - size_used);
/*
* Zero the remainder of the page being returned.
*/
size_left = size_used - ldt_size;
if (size_left > 0)
memset((char *)addr + ldt_size, 0, size_left);
/*
* Make memory into copyin form - this unwires it.
*/
(void) vm_map_copyin(ipc_kernel_map, addr, size_used,
TRUE, &memory);
*desc_list = (struct real_descriptor *)memory;
}
return KERN_SUCCESS;
}
void
user_ldt_free(user_ldt)
user_ldt_t user_ldt;
{
kfree((vm_offset_t)user_ldt,
user_ldt->desc.limit_low + 1
+ sizeof(struct real_descriptor));
}
|