1 /*-
2 * SPDX-License-Identifier: MIT-CMU
3 *
4 * Mach Operating System
5 * Copyright (c) 1991,1990 Carnegie Mellon University
6 * All Rights Reserved.
7 *
8 * Permission to use, copy, modify and distribute this software and its
9 * documentation is hereby granted, provided that both the copyright
10 * notice and this permission notice appear in all copies of the
11 * software, derivative works or modified versions, and any portions
12 * thereof, and that both notices appear in supporting documentation.
13 *
14 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
15 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
16 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
17 *
18 * Carnegie Mellon requests users of this software to return to
19 *
20 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
21 * School of Computer Science
22 * Carnegie Mellon University
23 * Pittsburgh PA 15213-3890
24 *
25 * any improvements or extensions that they make and grant Carnegie the
26 * rights to redistribute these changes.
27 *
28 */
29 /*
30 * Author: David B. Golub, Carnegie Mellon University
31 * Date: 7/90
32 */
33 /*
34 * Breakpoints.
35 */
36
37 #include <sys/cdefs.h>
38 #include <sys/param.h>
39
40 #include <vm/vm.h>
41 #include <vm/vm_kern.h>
42
43 #include <ddb/ddb.h>
44 #include <ddb/db_break.h>
45 #include <ddb/db_access.h>
46 #include <ddb/db_sym.h>
47
48 #define NBREAKPOINTS 100
49 static struct db_breakpoint db_break_table[NBREAKPOINTS];
50 static db_breakpoint_t db_next_free_breakpoint = &db_break_table[0];
51 static db_breakpoint_t db_free_breakpoints = 0;
52 static db_breakpoint_t db_breakpoint_list = 0;
53
54 static db_breakpoint_t db_breakpoint_alloc(void);
55 static void db_breakpoint_free(db_breakpoint_t bkpt);
56 static void db_delete_breakpoint(vm_map_t map, db_addr_t addr);
57 static db_breakpoint_t db_find_breakpoint(vm_map_t map, db_addr_t addr);
58 static void db_list_breakpoints(void);
59 static void db_set_breakpoint(vm_map_t map, db_addr_t addr, int count);
60
61 static db_breakpoint_t
db_breakpoint_alloc(void)62 db_breakpoint_alloc(void)
63 {
64 register db_breakpoint_t bkpt;
65
66 if ((bkpt = db_free_breakpoints) != 0) {
67 db_free_breakpoints = bkpt->link;
68 return (bkpt);
69 }
70 if (db_next_free_breakpoint == &db_break_table[NBREAKPOINTS]) {
71 db_printf("All breakpoints used.\n");
72 return (0);
73 }
74 bkpt = db_next_free_breakpoint;
75 db_next_free_breakpoint++;
76
77 return (bkpt);
78 }
79
80 static void
db_breakpoint_free(db_breakpoint_t bkpt)81 db_breakpoint_free(db_breakpoint_t bkpt)
82 {
83 bkpt->link = db_free_breakpoints;
84 db_free_breakpoints = bkpt;
85 }
86
87 static void
db_set_breakpoint(vm_map_t map,db_addr_t addr,int count)88 db_set_breakpoint(vm_map_t map, db_addr_t addr, int count)
89 {
90 register db_breakpoint_t bkpt;
91
92 if (db_find_breakpoint(map, addr)) {
93 db_printf("Already set.\n");
94 return;
95 }
96
97 bkpt = db_breakpoint_alloc();
98 if (bkpt == 0) {
99 db_printf("Too many breakpoints.\n");
100 return;
101 }
102
103 bkpt->map = map;
104 bkpt->address = addr;
105 bkpt->flags = 0;
106 bkpt->init_count = count;
107 bkpt->count = count;
108
109 bkpt->link = db_breakpoint_list;
110 db_breakpoint_list = bkpt;
111 }
112
113 static void
db_delete_breakpoint(vm_map_t map,db_addr_t addr)114 db_delete_breakpoint(vm_map_t map, db_addr_t addr)
115 {
116 register db_breakpoint_t bkpt;
117 register db_breakpoint_t *prev;
118
119 for (prev = &db_breakpoint_list;
120 (bkpt = *prev) != 0;
121 prev = &bkpt->link) {
122 if (db_map_equal(bkpt->map, map) &&
123 (bkpt->address == addr)) {
124 *prev = bkpt->link;
125 break;
126 }
127 }
128 if (bkpt == 0) {
129 db_printf("Not set.\n");
130 return;
131 }
132
133 db_breakpoint_free(bkpt);
134 }
135
136 static db_breakpoint_t
db_find_breakpoint(vm_map_t map,db_addr_t addr)137 db_find_breakpoint(vm_map_t map, db_addr_t addr)
138 {
139 register db_breakpoint_t bkpt;
140
141 for (bkpt = db_breakpoint_list;
142 bkpt != 0;
143 bkpt = bkpt->link)
144 {
145 if (db_map_equal(bkpt->map, map) &&
146 (bkpt->address == addr))
147 return (bkpt);
148 }
149 return (0);
150 }
151
152 db_breakpoint_t
db_find_breakpoint_here(db_addr_t addr)153 db_find_breakpoint_here(db_addr_t addr)
154 {
155 return db_find_breakpoint(db_map_addr(addr), addr);
156 }
157
158 static bool db_breakpoints_inserted = true;
159
160 #ifndef BKPT_WRITE
161 #define BKPT_WRITE(addr, storage) \
162 do { \
163 *storage = db_get_value(addr, BKPT_SIZE, false); \
164 db_put_value(addr, BKPT_SIZE, BKPT_SET(*storage)); \
165 } while (0)
166 #endif
167
168 #ifndef BKPT_CLEAR
169 #define BKPT_CLEAR(addr, storage) \
170 db_put_value(addr, BKPT_SIZE, *storage)
171 #endif
172
173 void
db_set_breakpoints(void)174 db_set_breakpoints(void)
175 {
176 register db_breakpoint_t bkpt;
177
178 if (!db_breakpoints_inserted) {
179 for (bkpt = db_breakpoint_list;
180 bkpt != 0;
181 bkpt = bkpt->link)
182 if (db_map_current(bkpt->map)) {
183 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
184 }
185 db_breakpoints_inserted = true;
186 }
187 }
188
189 void
db_clear_breakpoints(void)190 db_clear_breakpoints(void)
191 {
192 register db_breakpoint_t bkpt;
193
194 if (db_breakpoints_inserted) {
195 for (bkpt = db_breakpoint_list;
196 bkpt != 0;
197 bkpt = bkpt->link)
198 if (db_map_current(bkpt->map)) {
199 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
200 }
201 db_breakpoints_inserted = false;
202 }
203 }
204
205 #ifdef SOFTWARE_SSTEP
206 /*
207 * Set a temporary breakpoint.
208 * The instruction is changed immediately,
209 * so the breakpoint does not have to be on the breakpoint list.
210 */
211 db_breakpoint_t
db_set_temp_breakpoint(db_addr_t addr)212 db_set_temp_breakpoint(db_addr_t addr)
213 {
214 register db_breakpoint_t bkpt;
215
216 bkpt = db_breakpoint_alloc();
217 if (bkpt == 0) {
218 db_printf("Too many breakpoints.\n");
219 return 0;
220 }
221
222 bkpt->map = NULL;
223 bkpt->address = addr;
224 bkpt->flags = BKPT_TEMP;
225 bkpt->init_count = 1;
226 bkpt->count = 1;
227
228 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
229 return bkpt;
230 }
231
232 void
db_delete_temp_breakpoint(db_breakpoint_t bkpt)233 db_delete_temp_breakpoint(db_breakpoint_t bkpt)
234 {
235 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
236 db_breakpoint_free(bkpt);
237 }
238 #endif /* SOFTWARE_SSTEP */
239
240 /*
241 * List breakpoints.
242 */
243 static void
db_list_breakpoints(void)244 db_list_breakpoints(void)
245 {
246 register db_breakpoint_t bkpt;
247
248 if (db_breakpoint_list == 0) {
249 db_printf("No breakpoints set\n");
250 return;
251 }
252
253 db_printf(" Map Count Address\n");
254 for (bkpt = db_breakpoint_list;
255 bkpt != 0;
256 bkpt = bkpt->link) {
257 db_printf("%s%8p %5d ",
258 db_map_current(bkpt->map) ? "*" : " ",
259 (void *)bkpt->map, bkpt->init_count);
260 db_printsym(bkpt->address, DB_STGY_PROC);
261 db_printf("\n");
262 }
263 }
264
265 /* Delete breakpoint */
266 /*ARGSUSED*/
267 void
db_delete_cmd(db_expr_t addr,bool have_addr,db_expr_t count,char * modif)268 db_delete_cmd(db_expr_t addr, bool have_addr, db_expr_t count, char *modif)
269 {
270 db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
271 }
272
273 /* Set breakpoint with skip count */
274 /*ARGSUSED*/
275 void
db_breakpoint_cmd(db_expr_t addr,bool have_addr,db_expr_t count,char * modif)276 db_breakpoint_cmd(db_expr_t addr, bool have_addr, db_expr_t count, char *modif)
277 {
278 if (count == -1)
279 count = 1;
280
281 db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
282 }
283
284 /* list breakpoints */
285 void
db_listbreak_cmd(db_expr_t dummy1,bool dummy2,db_expr_t dummy3,char * dummy4)286 db_listbreak_cmd(db_expr_t dummy1, bool dummy2, db_expr_t dummy3, char *dummy4)
287 {
288 db_list_breakpoints();
289 }
290
291 /*
292 * We want ddb to be usable before most of the kernel has been
293 * initialized. In particular, current_thread() or kernel_map
294 * (or both) may be null.
295 */
296
297 bool
db_map_equal(vm_map_t map1,vm_map_t map2)298 db_map_equal(vm_map_t map1, vm_map_t map2)
299 {
300 return ((map1 == map2) ||
301 ((map1 == NULL) && (map2 == kernel_map)) ||
302 ((map1 == kernel_map) && (map2 == NULL)));
303 }
304
305 bool
db_map_current(vm_map_t map)306 db_map_current(vm_map_t map)
307 {
308 #if 0
309 thread_t thread;
310
311 return ((map == NULL) ||
312 (map == kernel_map) ||
313 (((thread = current_thread()) != NULL) &&
314 (map == thread->task->map)));
315 #else
316 return (true);
317 #endif
318 }
319
320 vm_map_t
db_map_addr(vm_offset_t addr)321 db_map_addr(vm_offset_t addr)
322 {
323 #if 0
324 thread_t thread;
325
326 /*
327 * We want to return kernel_map for all
328 * non-user addresses, even when debugging
329 * kernel tasks with their own maps.
330 */
331
332 if ((VM_MIN_ADDRESS <= addr) &&
333 (addr < VM_MAX_ADDRESS) &&
334 ((thread = current_thread()) != NULL))
335 return thread->task->map;
336 else
337 #endif
338 return kernel_map;
339 }
340