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.
30 * Author: David B. Golub, Carnegie Mellon University
36 #include <sys/param.h>
39 #include <vm/vm_kern.h>
42 #include <ddb/db_break.h>
43 #include <ddb/db_access.h>
44 #include <ddb/db_sym.h>
46 #define NBREAKPOINTS 100
47 static struct db_breakpoint db_break_table[NBREAKPOINTS];
48 static db_breakpoint_t db_next_free_breakpoint = &db_break_table[0];
49 static db_breakpoint_t db_free_breakpoints = 0;
50 static db_breakpoint_t db_breakpoint_list = 0;
52 static db_breakpoint_t db_breakpoint_alloc(void);
53 static void db_breakpoint_free(db_breakpoint_t bkpt);
54 static void db_delete_breakpoint(vm_map_t map, db_addr_t addr);
55 static db_breakpoint_t db_find_breakpoint(vm_map_t map, db_addr_t addr);
56 static void db_list_breakpoints(void);
57 static void db_set_breakpoint(vm_map_t map, db_addr_t addr, int count);
59 static db_breakpoint_t
62 register db_breakpoint_t bkpt;
64 if ((bkpt = db_free_breakpoints) != 0) {
65 db_free_breakpoints = bkpt->link;
68 if (db_next_free_breakpoint == &db_break_table[NBREAKPOINTS]) {
69 db_printf("All breakpoints used.\n");
72 bkpt = db_next_free_breakpoint;
73 db_next_free_breakpoint++;
79 db_breakpoint_free(bkpt)
80 register db_breakpoint_t bkpt;
82 bkpt->link = db_free_breakpoints;
83 db_free_breakpoints = bkpt;
87 db_set_breakpoint(map, addr, count)
92 register db_breakpoint_t bkpt;
94 if (db_find_breakpoint(map, addr)) {
95 db_printf("Already set.\n");
99 bkpt = db_breakpoint_alloc();
101 db_printf("Too many breakpoints.\n");
106 bkpt->address = addr;
108 bkpt->init_count = count;
111 bkpt->link = db_breakpoint_list;
112 db_breakpoint_list = bkpt;
116 db_delete_breakpoint(map, addr)
120 register db_breakpoint_t bkpt;
121 register db_breakpoint_t *prev;
123 for (prev = &db_breakpoint_list;
125 prev = &bkpt->link) {
126 if (db_map_equal(bkpt->map, map) &&
127 (bkpt->address == addr)) {
133 db_printf("Not set.\n");
137 db_breakpoint_free(bkpt);
140 static db_breakpoint_t
141 db_find_breakpoint(map, addr)
145 register db_breakpoint_t bkpt;
147 for (bkpt = db_breakpoint_list;
151 if (db_map_equal(bkpt->map, map) &&
152 (bkpt->address == addr))
159 db_find_breakpoint_here(addr)
162 return db_find_breakpoint(db_map_addr(addr), addr);
165 static boolean_t db_breakpoints_inserted = TRUE;
168 #define BKPT_WRITE(addr, storage) \
170 *storage = db_get_value(addr, BKPT_SIZE, FALSE); \
171 db_put_value(addr, BKPT_SIZE, BKPT_SET(*storage)); \
176 #define BKPT_CLEAR(addr, storage) \
177 db_put_value(addr, BKPT_SIZE, *storage)
183 register db_breakpoint_t bkpt;
185 if (!db_breakpoints_inserted) {
187 for (bkpt = db_breakpoint_list;
190 if (db_map_current(bkpt->map)) {
191 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
193 db_breakpoints_inserted = TRUE;
198 db_clear_breakpoints()
200 register db_breakpoint_t bkpt;
202 if (db_breakpoints_inserted) {
204 for (bkpt = db_breakpoint_list;
207 if (db_map_current(bkpt->map)) {
208 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
210 db_breakpoints_inserted = FALSE;
214 #ifdef SOFTWARE_SSTEP
216 * Set a temporary breakpoint.
217 * The instruction is changed immediately,
218 * so the breakpoint does not have to be on the breakpoint list.
221 db_set_temp_breakpoint(addr)
224 register db_breakpoint_t bkpt;
226 bkpt = db_breakpoint_alloc();
228 db_printf("Too many breakpoints.\n");
233 bkpt->address = addr;
234 bkpt->flags = BKPT_TEMP;
235 bkpt->init_count = 1;
238 BKPT_WRITE(bkpt->address, &bkpt->bkpt_inst);
243 db_delete_temp_breakpoint(bkpt)
244 db_breakpoint_t bkpt;
246 BKPT_CLEAR(bkpt->address, &bkpt->bkpt_inst);
247 db_breakpoint_free(bkpt);
249 #endif /* SOFTWARE_SSTEP */
255 db_list_breakpoints()
257 register db_breakpoint_t bkpt;
259 if (db_breakpoint_list == 0) {
260 db_printf("No breakpoints set\n");
264 db_printf(" Map Count Address\n");
265 for (bkpt = db_breakpoint_list;
268 db_printf("%s%8p %5d ",
269 db_map_current(bkpt->map) ? "*" : " ",
270 (void *)bkpt->map, bkpt->init_count);
271 db_printsym(bkpt->address, DB_STGY_PROC);
276 /* Delete breakpoint */
279 db_delete_cmd(addr, have_addr, count, modif)
285 db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
288 /* Set breakpoint with skip count */
291 db_breakpoint_cmd(addr, have_addr, count, modif)
300 db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
303 /* list breakpoints */
305 db_listbreak_cmd(dummy1, dummy2, dummy3, dummy4)
311 db_list_breakpoints();
315 * We want ddb to be usable before most of the kernel has been
316 * initialized. In particular, current_thread() or kernel_map
317 * (or both) may be null.
321 db_map_equal(map1, map2)
324 return ((map1 == map2) ||
325 ((map1 == NULL) && (map2 == kernel_map)) ||
326 ((map1 == kernel_map) && (map2 == NULL)));
336 return ((map == NULL) ||
337 (map == kernel_map) ||
338 (((thread = current_thread()) != NULL) &&
339 (map == thread->task->map)));
353 * We want to return kernel_map for all
354 * non-user addresses, even when debugging
355 * kernel tasks with their own maps.
358 if ((VM_MIN_ADDRESS <= addr) &&
359 (addr < VM_MAX_ADDRESS) &&
360 ((thread = current_thread()) != NULL))
361 return thread->task->map;