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
|
/*
* Mach Operating System
* Copyright (c) 1991,1990 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.
*/
/*
* Author: David B. Golub, Carnegie Mellon University
* Date: 7/90
*/
#if MACH_KDB
#include <mach/boolean.h>
#include <machine/db_machdep.h> /* type definitions */
#include <machine/db_interface.h> /* function definitions */
#include <machine/setjmp.h>
#include <kern/task.h>
#include <ddb/db_access.h>
/*
* Access unaligned data items on aligned (longword)
* boundaries.
*/
int db_access_level = DB_ACCESS_LEVEL;
/*
* This table is for sign-extending things.
* Therefore its entries are signed, and yes
* they are infact negative numbers.
* So don't you put no more Us in it. Or Ls either.
* Otherwise there is no point having it, n'est pas ?
*/
static int db_extend[sizeof(int)+1] = { /* table for sign-extending */
0,
0xFFFFFF80,
0xFFFF8000,
0xFF800000,
0x80000000
};
db_expr_t
db_get_task_value(
db_addr_t addr,
int size,
boolean_t is_signed,
task_t task)
{
char data[sizeof(db_expr_t)];
db_expr_t value;
int i;
if (!db_read_bytes(addr, size, data, task))
return 0;
value = 0;
#if BYTE_MSF
for (i = 0; i < size; i++)
#else /* BYTE_LSF */
for (i = size - 1; i >= 0; i--)
#endif
{
value = (value << 8) + (data[i] & 0xFF);
}
if (size <= sizeof(int)) {
if (is_signed && (value & db_extend[size]) != 0)
value |= db_extend[size];
}
return (value);
}
void
db_put_task_value(
db_addr_t addr,
int size,
db_expr_t value,
task_t task)
{
char data[sizeof(db_expr_t)];
int i;
#if BYTE_MSF
for (i = size - 1; i >= 0; i--)
#else /* BYTE_LSF */
for (i = 0; i < size; i++)
#endif
{
data[i] = value & 0xFF;
value >>= 8;
}
db_write_bytes(addr, size, data, task);
}
db_expr_t
db_get_value(
db_addr_t addr,
int size,
boolean_t is_signed)
{
return(db_get_task_value(addr, size, is_signed, TASK_NULL));
}
void
db_put_value(
db_addr_t addr,
int size,
db_expr_t value)
{
db_put_task_value(addr, size, value, TASK_NULL);
}
#endif /* MACH_KDB */
|
