2 * Mach Operating System
3 * Copyright (c) 1991,1990 Carnegie Mellon University
6 * Permission to use, copy, modify and distribute this software and its
7 * documentation is hereby granted, provided that both the copyright
8 * notice and this permission notice appear in all copies of the
9 * software, derivative works or modified versions, and any portions
10 * thereof, and that both notices appear in supporting documentation.
12 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
13 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
14 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
16 * Carnegie Mellon requests users of this software to return to
18 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
19 * School of Computer Science
20 * Carnegie Mellon University
21 * Pittsburgh PA 15213-3890
23 * any improvements or extensions that they make and grant Carnegie the
24 * rights to redistribute these changes.
28 * Author: David B. Golub, Carnegie Mellon University
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
38 #include "opt_comconsole.h"
40 #include <sys/param.h>
43 #include <vm/vm_kern.h>
46 #include <ddb/db_break.h>
47 #include <ddb/db_access.h>
48 #include <ddb/db_sym.h>
50 #define NBREAKPOINTS 100
51 static struct db_breakpoint db_break_table[NBREAKPOINTS];
52 static db_breakpoint_t db_next_free_breakpoint = &db_break_table[0];
53 static db_breakpoint_t db_free_breakpoints = 0;
54 static db_breakpoint_t db_breakpoint_list = 0;
56 static db_breakpoint_t db_breakpoint_alloc(void);
57 static void db_breakpoint_free(db_breakpoint_t bkpt);
58 static void db_delete_breakpoint(vm_map_t map, db_addr_t addr);
59 static db_breakpoint_t db_find_breakpoint(vm_map_t map, db_addr_t addr);
60 static void db_list_breakpoints(void);
61 static void db_set_breakpoint(vm_map_t map, db_addr_t addr, int count);
63 static db_breakpoint_t
66 register db_breakpoint_t bkpt;
68 if ((bkpt = db_free_breakpoints) != 0) {
69 db_free_breakpoints = bkpt->link;
72 if (db_next_free_breakpoint == &db_break_table[NBREAKPOINTS]) {
73 db_printf("All breakpoints used.\n");
76 bkpt = db_next_free_breakpoint;
77 db_next_free_breakpoint++;
83 db_breakpoint_free(bkpt)
84 register db_breakpoint_t bkpt;
86 bkpt->link = db_free_breakpoints;
87 db_free_breakpoints = bkpt;
91 db_set_breakpoint(map, addr, count)
96 register db_breakpoint_t bkpt;
98 if (db_find_breakpoint(map, addr)) {
99 db_printf("Already set.\n");
103 bkpt = db_breakpoint_alloc();
105 db_printf("Too many breakpoints.\n");
110 bkpt->address = addr;
112 bkpt->init_count = count;
115 bkpt->link = db_breakpoint_list;
116 db_breakpoint_list = bkpt;
120 db_delete_breakpoint(map, addr)
124 register db_breakpoint_t bkpt;
125 register db_breakpoint_t *prev;
127 for (prev = &db_breakpoint_list;
129 prev = &bkpt->link) {
130 if (db_map_equal(bkpt->map, map) &&
131 (bkpt->address == addr)) {
137 db_printf("Not set.\n");
141 db_breakpoint_free(bkpt);
144 static db_breakpoint_t
145 db_find_breakpoint(map, addr)
149 register db_breakpoint_t bkpt;
151 for (bkpt = db_breakpoint_list;
155 if (db_map_equal(bkpt->map, map) &&
156 (bkpt->address == addr))
163 db_find_breakpoint_here(addr)
166 return db_find_breakpoint(db_map_addr(addr), addr);
169 static boolean_t db_breakpoints_inserted = TRUE;
172 #define BKPT_WRITE(addr, storage) \
174 *storage = db_get_value(addr, BKPT_SIZE, FALSE); \
175 db_put_value(addr, BKPT_SIZE, BKPT_SET(*storage)); \
180 #define BKPT_CLEAR(addr, storage) \
181 db_put_value(addr, BKPT_SIZE, *storage)
187 register db_breakpoint_t bkpt;
189 if (!db_breakpoints_inserted) {
191 for (bkpt = db_breakpoint_list;
194 if (db_map_current(bkpt->map)) {
195 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
197 db_breakpoints_inserted = TRUE;
202 db_clear_breakpoints()
204 register db_breakpoint_t bkpt;
206 if (db_breakpoints_inserted) {
208 for (bkpt = db_breakpoint_list;
211 if (db_map_current(bkpt->map)) {
212 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
214 db_breakpoints_inserted = FALSE;
218 #ifdef SOFTWARE_SSTEP
220 * Set a temporary breakpoint.
221 * The instruction is changed immediately,
222 * so the breakpoint does not have to be on the breakpoint list.
225 db_set_temp_breakpoint(addr)
228 register db_breakpoint_t bkpt;
230 bkpt = db_breakpoint_alloc();
232 db_printf("Too many breakpoints.\n");
237 bkpt->address = addr;
238 bkpt->flags = BKPT_TEMP;
239 bkpt->init_count = 1;
242 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
247 db_delete_temp_breakpoint(bkpt)
248 db_breakpoint_t bkpt;
250 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
251 db_breakpoint_free(bkpt);
253 #endif /* SOFTWARE_SSTEP */
259 db_list_breakpoints()
261 register db_breakpoint_t bkpt;
263 if (db_breakpoint_list == 0) {
264 db_printf("No breakpoints set\n");
268 db_printf(" Map Count Address\n");
269 for (bkpt = db_breakpoint_list;
272 db_printf("%s%8p %5d ",
273 db_map_current(bkpt->map) ? "*" : " ",
274 (void *)bkpt->map, bkpt->init_count);
275 db_printsym(bkpt->address, DB_STGY_PROC);
280 /* Delete breakpoint */
283 db_delete_cmd(addr, have_addr, count, modif)
289 db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
292 /* Set breakpoint with skip count */
295 db_breakpoint_cmd(addr, have_addr, count, modif)
304 db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
307 /* list breakpoints */
309 db_listbreak_cmd(dummy1, dummy2, dummy3, dummy4)
315 db_list_breakpoints();
319 * We want ddb to be usable before most of the kernel has been
320 * initialized. In particular, current_thread() or kernel_map
321 * (or both) may be null.
325 db_map_equal(map1, map2)
328 return ((map1 == map2) ||
329 ((map1 == NULL) && (map2 == kernel_map)) ||
330 ((map1 == kernel_map) && (map2 == NULL)));
340 return ((map == NULL) ||
341 (map == kernel_map) ||
342 (((thread = current_thread()) != NULL) &&
343 (map == thread->task->map)));
357 * We want to return kernel_map for all
358 * non-user addresses, even when debugging
359 * kernel tasks with their own maps.
362 if ((VM_MIN_ADDRESS <= addr) &&
363 (addr < VM_MAX_ADDRESS) &&
364 ((thread = current_thread()) != NULL))
365 return thread->task->map;