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 <sys/param.h>
41 #include <vm/vm_kern.h>
44 #include <ddb/db_break.h>
45 #include <ddb/db_access.h>
46 #include <ddb/db_sym.h>
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;
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);
61 static db_breakpoint_t
64 register db_breakpoint_t bkpt;
66 if ((bkpt = db_free_breakpoints) != 0) {
67 db_free_breakpoints = bkpt->link;
70 if (db_next_free_breakpoint == &db_break_table[NBREAKPOINTS]) {
71 db_printf("All breakpoints used.\n");
74 bkpt = db_next_free_breakpoint;
75 db_next_free_breakpoint++;
81 db_breakpoint_free(bkpt)
82 register db_breakpoint_t bkpt;
84 bkpt->link = db_free_breakpoints;
85 db_free_breakpoints = bkpt;
89 db_set_breakpoint(map, addr, count)
94 register db_breakpoint_t bkpt;
96 if (db_find_breakpoint(map, addr)) {
97 db_printf("Already set.\n");
101 bkpt = db_breakpoint_alloc();
103 db_printf("Too many breakpoints.\n");
108 bkpt->address = addr;
110 bkpt->init_count = count;
113 bkpt->link = db_breakpoint_list;
114 db_breakpoint_list = bkpt;
118 db_delete_breakpoint(map, addr)
122 register db_breakpoint_t bkpt;
123 register db_breakpoint_t *prev;
125 for (prev = &db_breakpoint_list;
127 prev = &bkpt->link) {
128 if (db_map_equal(bkpt->map, map) &&
129 (bkpt->address == addr)) {
135 db_printf("Not set.\n");
139 db_breakpoint_free(bkpt);
142 static db_breakpoint_t
143 db_find_breakpoint(map, addr)
147 register db_breakpoint_t bkpt;
149 for (bkpt = db_breakpoint_list;
153 if (db_map_equal(bkpt->map, map) &&
154 (bkpt->address == addr))
161 db_find_breakpoint_here(addr)
164 return db_find_breakpoint(db_map_addr(addr), addr);
167 static boolean_t db_breakpoints_inserted = TRUE;
170 #define BKPT_WRITE(addr, storage) \
172 *storage = db_get_value(addr, BKPT_SIZE, FALSE); \
173 db_put_value(addr, BKPT_SIZE, BKPT_SET(*storage)); \
178 #define BKPT_CLEAR(addr, storage) \
179 db_put_value(addr, BKPT_SIZE, *storage)
185 register db_breakpoint_t bkpt;
187 if (!db_breakpoints_inserted) {
189 for (bkpt = db_breakpoint_list;
192 if (db_map_current(bkpt->map)) {
193 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
195 db_breakpoints_inserted = TRUE;
200 db_clear_breakpoints()
202 register db_breakpoint_t bkpt;
204 if (db_breakpoints_inserted) {
206 for (bkpt = db_breakpoint_list;
209 if (db_map_current(bkpt->map)) {
210 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
212 db_breakpoints_inserted = FALSE;
216 #ifdef SOFTWARE_SSTEP
218 * Set a temporary breakpoint.
219 * The instruction is changed immediately,
220 * so the breakpoint does not have to be on the breakpoint list.
223 db_set_temp_breakpoint(addr)
226 register db_breakpoint_t bkpt;
228 bkpt = db_breakpoint_alloc();
230 db_printf("Too many breakpoints.\n");
235 bkpt->address = addr;
236 bkpt->flags = BKPT_TEMP;
237 bkpt->init_count = 1;
240 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
245 db_delete_temp_breakpoint(bkpt)
246 db_breakpoint_t bkpt;
248 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
249 db_breakpoint_free(bkpt);
251 #endif /* SOFTWARE_SSTEP */
257 db_list_breakpoints()
259 register db_breakpoint_t bkpt;
261 if (db_breakpoint_list == 0) {
262 db_printf("No breakpoints set\n");
266 db_printf(" Map Count Address\n");
267 for (bkpt = db_breakpoint_list;
270 db_printf("%s%8p %5d ",
271 db_map_current(bkpt->map) ? "*" : " ",
272 (void *)bkpt->map, bkpt->init_count);
273 db_printsym(bkpt->address, DB_STGY_PROC);
278 /* Delete breakpoint */
281 db_delete_cmd(addr, have_addr, count, modif)
287 db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
290 /* Set breakpoint with skip count */
293 db_breakpoint_cmd(addr, have_addr, count, modif)
302 db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
305 /* list breakpoints */
307 db_listbreak_cmd(dummy1, dummy2, dummy3, dummy4)
313 db_list_breakpoints();
317 * We want ddb to be usable before most of the kernel has been
318 * initialized. In particular, current_thread() or kernel_map
319 * (or both) may be null.
323 db_map_equal(map1, map2)
326 return ((map1 == map2) ||
327 ((map1 == NULL) && (map2 == kernel_map)) ||
328 ((map1 == kernel_map) && (map2 == NULL)));
338 return ((map == NULL) ||
339 (map == kernel_map) ||
340 (((thread = current_thread()) != NULL) &&
341 (map == thread->task->map)));
355 * We want to return kernel_map for all
356 * non-user addresses, even when debugging
357 * kernel tasks with their own maps.
360 if ((VM_MIN_ADDRESS <= addr) &&
361 (addr < VM_MAX_ADDRESS) &&
362 ((thread = current_thread()) != NULL))
363 return thread->task->map;