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.
26 * $FreeBSD: src/sys/ddb/db_break.c,v 1.18 1999/08/28 00:41:05 peter Exp $
27 * $DragonFly: src/sys/ddb/db_break.c,v 1.4 2003/08/27 10:47:13 rob Exp $
31 * Author: David B. Golub, Carnegie Mellon University
37 #include <sys/param.h>
40 #include <vm/vm_kern.h>
43 #include <ddb/db_break.h>
44 #include <ddb/db_access.h>
45 #include <ddb/db_sym.h>
47 #define NBREAKPOINTS 100
48 static struct db_breakpoint db_break_table[NBREAKPOINTS];
49 static db_breakpoint_t db_next_free_breakpoint = &db_break_table[0];
50 static db_breakpoint_t db_free_breakpoints = 0;
51 static db_breakpoint_t db_breakpoint_list = 0;
53 static db_breakpoint_t db_breakpoint_alloc (void);
54 static void db_breakpoint_free (db_breakpoint_t bkpt);
55 static void db_delete_breakpoint (vm_map_t map, db_addr_t addr);
56 static db_breakpoint_t db_find_breakpoint (vm_map_t map, db_addr_t addr);
57 static void db_list_breakpoints (void);
58 static void db_set_breakpoint (vm_map_t map, db_addr_t addr,
61 static db_breakpoint_t
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)
84 bkpt->link = db_free_breakpoints;
85 db_free_breakpoints = bkpt;
89 db_set_breakpoint(map, addr, count)
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 db_breakpoint_t bkpt;
123 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 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;
172 db_breakpoint_t bkpt;
174 if (!db_breakpoints_inserted) {
176 for (bkpt = db_breakpoint_list;
179 if (db_map_current(bkpt->map)) {
180 bkpt->bkpt_inst = db_get_value(bkpt->address,
183 db_put_value(bkpt->address,
185 BKPT_SET(bkpt->bkpt_inst));
187 db_breakpoints_inserted = TRUE;
192 db_clear_breakpoints()
194 db_breakpoint_t bkpt;
196 if (db_breakpoints_inserted) {
198 for (bkpt = db_breakpoint_list;
201 if (db_map_current(bkpt->map)) {
202 db_put_value(bkpt->address, BKPT_SIZE, bkpt->bkpt_inst);
204 db_breakpoints_inserted = FALSE;
208 #ifdef SOFTWARE_SSTEP
210 * Set a temporary breakpoint.
211 * The instruction is changed immediately,
212 * so the breakpoint does not have to be on the breakpoint list.
215 db_set_temp_breakpoint(addr)
218 db_breakpoint_t bkpt;
220 bkpt = db_breakpoint_alloc();
222 db_printf("Too many breakpoints.\n");
227 bkpt->address = addr;
228 bkpt->flags = BKPT_TEMP;
229 bkpt->init_count = 1;
232 bkpt->bkpt_inst = db_get_value(bkpt->address, BKPT_SIZE, FALSE);
233 db_put_value(bkpt->address, BKPT_SIZE, BKPT_SET(bkpt->bkpt_inst));
238 db_delete_temp_breakpoint(bkpt)
239 db_breakpoint_t bkpt;
241 db_put_value(bkpt->address, BKPT_SIZE, bkpt->bkpt_inst);
242 db_breakpoint_free(bkpt);
244 #endif /* SOFTWARE_SSTEP */
250 db_list_breakpoints()
252 db_breakpoint_t bkpt;
254 if (db_breakpoint_list == 0) {
255 db_printf("No breakpoints set\n");
259 db_printf(" Map Count Address\n");
260 for (bkpt = db_breakpoint_list;
263 db_printf("%s%8p %5d ",
264 db_map_current(bkpt->map) ? "*" : " ",
265 (void *)bkpt->map, bkpt->init_count);
266 db_printsym(bkpt->address, DB_STGY_PROC);
271 /* Delete breakpoint */
274 db_delete_cmd(addr, have_addr, count, modif)
280 db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
283 /* Set breakpoint with skip count */
286 db_breakpoint_cmd(addr, have_addr, count, modif)
295 db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
298 /* list breakpoints */
300 db_listbreak_cmd(dummy1, dummy2, dummy3, dummy4)
306 db_list_breakpoints();
310 * We want ddb to be usable before most of the kernel has been
311 * initialized. In particular, current_thread() or kernel_map
312 * (or both) may be null.
316 db_map_equal(map1, map2)
319 return ((map1 == map2) ||
320 ((map1 == NULL) && (map2 == kernel_map)) ||
321 ((map1 == kernel_map) && (map2 == NULL)));
331 return ((map == NULL) ||
332 (map == kernel_map) ||
333 (((thread = current_thread()) != NULL) &&
334 (map == thread->task->map)));
348 * We want to return kernel_map for all
349 * non-user addresses, even when debugging
350 * kernel tasks with their own maps.
353 if ((VM_MIN_ADDRESS <= addr) &&
354 (addr < VM_MAX_ADDRESS) &&
355 ((thread = current_thread()) != NULL))
356 return thread->task->map;