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
62 db_breakpoint_alloc(void)
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(db_breakpoint_t bkpt)
83 bkpt->link = db_free_breakpoints;
84 db_free_breakpoints = bkpt;
88 db_set_breakpoint(vm_map_t map, db_addr_t addr, int count)
90 register db_breakpoint_t bkpt;
92 if (db_find_breakpoint(map, addr)) {
93 db_printf("Already set.\n");
97 bkpt = db_breakpoint_alloc();
99 db_printf("Too many breakpoints.\n");
104 bkpt->address = addr;
106 bkpt->init_count = count;
109 bkpt->link = db_breakpoint_list;
110 db_breakpoint_list = bkpt;
114 db_delete_breakpoint(vm_map_t map, db_addr_t addr)
116 register db_breakpoint_t bkpt;
117 register db_breakpoint_t *prev;
119 for (prev = &db_breakpoint_list;
121 prev = &bkpt->link) {
122 if (db_map_equal(bkpt->map, map) &&
123 (bkpt->address == addr)) {
129 db_printf("Not set.\n");
133 db_breakpoint_free(bkpt);
136 static db_breakpoint_t
137 db_find_breakpoint(vm_map_t map, db_addr_t addr)
139 register db_breakpoint_t bkpt;
141 for (bkpt = db_breakpoint_list;
145 if (db_map_equal(bkpt->map, map) &&
146 (bkpt->address == addr))
153 db_find_breakpoint_here(db_addr_t addr)
155 return db_find_breakpoint(db_map_addr(addr), addr);
158 static boolean_t db_breakpoints_inserted = TRUE;
161 #define BKPT_WRITE(addr, storage) \
163 *storage = db_get_value(addr, BKPT_SIZE, FALSE); \
164 db_put_value(addr, BKPT_SIZE, BKPT_SET(*storage)); \
169 #define BKPT_CLEAR(addr, storage) \
170 db_put_value(addr, BKPT_SIZE, *storage)
174 db_set_breakpoints(void)
176 register db_breakpoint_t bkpt;
178 if (!db_breakpoints_inserted) {
180 for (bkpt = db_breakpoint_list;
183 if (db_map_current(bkpt->map)) {
184 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
186 db_breakpoints_inserted = TRUE;
191 db_clear_breakpoints(void)
193 register db_breakpoint_t bkpt;
195 if (db_breakpoints_inserted) {
197 for (bkpt = db_breakpoint_list;
200 if (db_map_current(bkpt->map)) {
201 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
203 db_breakpoints_inserted = FALSE;
207 #ifdef SOFTWARE_SSTEP
209 * Set a temporary breakpoint.
210 * The instruction is changed immediately,
211 * so the breakpoint does not have to be on the breakpoint list.
214 db_set_temp_breakpoint(db_addr_t addr)
216 register db_breakpoint_t bkpt;
218 bkpt = db_breakpoint_alloc();
220 db_printf("Too many breakpoints.\n");
225 bkpt->address = addr;
226 bkpt->flags = BKPT_TEMP;
227 bkpt->init_count = 1;
230 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
235 db_delete_temp_breakpoint(db_breakpoint_t bkpt)
237 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
238 db_breakpoint_free(bkpt);
240 #endif /* SOFTWARE_SSTEP */
246 db_list_breakpoints(void)
248 register db_breakpoint_t bkpt;
250 if (db_breakpoint_list == 0) {
251 db_printf("No breakpoints set\n");
255 db_printf(" Map Count Address\n");
256 for (bkpt = db_breakpoint_list;
259 db_printf("%s%8p %5d ",
260 db_map_current(bkpt->map) ? "*" : " ",
261 (void *)bkpt->map, bkpt->init_count);
262 db_printsym(bkpt->address, DB_STGY_PROC);
267 /* Delete breakpoint */
270 db_delete_cmd(db_expr_t addr, boolean_t have_addr, db_expr_t count, char *modif)
272 db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
275 /* Set breakpoint with skip count */
278 db_breakpoint_cmd(db_expr_t addr, boolean_t have_addr, db_expr_t count,
284 db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
287 /* list breakpoints */
289 db_listbreak_cmd(db_expr_t dummy1, boolean_t dummy2, db_expr_t dummy3,
292 db_list_breakpoints();
296 * We want ddb to be usable before most of the kernel has been
297 * initialized. In particular, current_thread() or kernel_map
298 * (or both) may be null.
302 db_map_equal(vm_map_t map1, vm_map_t map2)
304 return ((map1 == map2) ||
305 ((map1 == NULL) && (map2 == kernel_map)) ||
306 ((map1 == kernel_map) && (map2 == NULL)));
310 db_map_current(vm_map_t map)
315 return ((map == NULL) ||
316 (map == kernel_map) ||
317 (((thread = current_thread()) != NULL) &&
318 (map == thread->task->map)));
325 db_map_addr(vm_offset_t addr)
331 * We want to return kernel_map for all
332 * non-user addresses, even when debugging
333 * kernel tasks with their own maps.
336 if ((VM_MIN_ADDRESS <= addr) &&
337 (addr < VM_MAX_ADDRESS) &&
338 ((thread = current_thread()) != NULL))
339 return thread->task->map;