db_break.c revision 1.6 1 1.6 christos /* $NetBSD: db_break.c,v 1.6 1996/02/05 01:56:50 christos Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.1 cgd * Mach Operating System
5 1.1 cgd * Copyright (c) 1991,1990 Carnegie Mellon University
6 1.1 cgd * All Rights Reserved.
7 1.1 cgd *
8 1.1 cgd * Permission to use, copy, modify and distribute this software and its
9 1.1 cgd * documentation is hereby granted, provided that both the copyright
10 1.1 cgd * notice and this permission notice appear in all copies of the
11 1.1 cgd * software, derivative works or modified versions, and any portions
12 1.1 cgd * thereof, and that both notices appear in supporting documentation.
13 1.1 cgd *
14 1.1 cgd * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
15 1.1 cgd * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
16 1.1 cgd * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
17 1.1 cgd *
18 1.1 cgd * Carnegie Mellon requests users of this software to return to
19 1.1 cgd *
20 1.1 cgd * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
21 1.1 cgd * School of Computer Science
22 1.1 cgd * Carnegie Mellon University
23 1.1 cgd * Pittsburgh PA 15213-3890
24 1.1 cgd *
25 1.1 cgd * any improvements or extensions that they make and grant Carnegie the
26 1.1 cgd * rights to redistribute these changes.
27 1.2 cgd *
28 1.1 cgd * Author: David B. Golub, Carnegie Mellon University
29 1.1 cgd * Date: 7/90
30 1.1 cgd */
31 1.3 mycroft
32 1.1 cgd /*
33 1.1 cgd * Breakpoints.
34 1.1 cgd */
35 1.3 mycroft #include <sys/param.h>
36 1.3 mycroft #include <sys/proc.h>
37 1.3 mycroft
38 1.1 cgd #include <machine/db_machdep.h> /* type definitions */
39 1.1 cgd
40 1.1 cgd #include <ddb/db_lex.h>
41 1.1 cgd #include <ddb/db_access.h>
42 1.1 cgd #include <ddb/db_sym.h>
43 1.1 cgd #include <ddb/db_break.h>
44 1.6 christos #include <ddb/db_output.h>
45 1.1 cgd
46 1.1 cgd #define NBREAKPOINTS 100
47 1.1 cgd struct db_breakpoint db_break_table[NBREAKPOINTS];
48 1.1 cgd db_breakpoint_t db_next_free_breakpoint = &db_break_table[0];
49 1.1 cgd db_breakpoint_t db_free_breakpoints = 0;
50 1.1 cgd db_breakpoint_t db_breakpoint_list = 0;
51 1.1 cgd
52 1.1 cgd db_breakpoint_t
53 1.1 cgd db_breakpoint_alloc()
54 1.1 cgd {
55 1.1 cgd register db_breakpoint_t bkpt;
56 1.1 cgd
57 1.1 cgd if ((bkpt = db_free_breakpoints) != 0) {
58 1.1 cgd db_free_breakpoints = bkpt->link;
59 1.1 cgd return (bkpt);
60 1.1 cgd }
61 1.1 cgd if (db_next_free_breakpoint == &db_break_table[NBREAKPOINTS]) {
62 1.1 cgd db_printf("All breakpoints used.\n");
63 1.1 cgd return (0);
64 1.1 cgd }
65 1.1 cgd bkpt = db_next_free_breakpoint;
66 1.1 cgd db_next_free_breakpoint++;
67 1.1 cgd
68 1.1 cgd return (bkpt);
69 1.1 cgd }
70 1.1 cgd
71 1.1 cgd void
72 1.1 cgd db_breakpoint_free(bkpt)
73 1.1 cgd register db_breakpoint_t bkpt;
74 1.1 cgd {
75 1.1 cgd bkpt->link = db_free_breakpoints;
76 1.1 cgd db_free_breakpoints = bkpt;
77 1.1 cgd }
78 1.1 cgd
79 1.1 cgd void
80 1.1 cgd db_set_breakpoint(map, addr, count)
81 1.1 cgd vm_map_t map;
82 1.1 cgd db_addr_t addr;
83 1.1 cgd int count;
84 1.1 cgd {
85 1.1 cgd register db_breakpoint_t bkpt;
86 1.1 cgd
87 1.1 cgd if (db_find_breakpoint(map, addr)) {
88 1.1 cgd db_printf("Already set.\n");
89 1.1 cgd return;
90 1.1 cgd }
91 1.1 cgd
92 1.1 cgd bkpt = db_breakpoint_alloc();
93 1.1 cgd if (bkpt == 0) {
94 1.1 cgd db_printf("Too many breakpoints.\n");
95 1.1 cgd return;
96 1.1 cgd }
97 1.1 cgd
98 1.1 cgd bkpt->map = map;
99 1.1 cgd bkpt->address = addr;
100 1.1 cgd bkpt->flags = 0;
101 1.1 cgd bkpt->init_count = count;
102 1.1 cgd bkpt->count = count;
103 1.1 cgd
104 1.1 cgd bkpt->link = db_breakpoint_list;
105 1.1 cgd db_breakpoint_list = bkpt;
106 1.1 cgd }
107 1.1 cgd
108 1.1 cgd void
109 1.1 cgd db_delete_breakpoint(map, addr)
110 1.1 cgd vm_map_t map;
111 1.1 cgd db_addr_t addr;
112 1.1 cgd {
113 1.1 cgd register db_breakpoint_t bkpt;
114 1.1 cgd register db_breakpoint_t *prev;
115 1.1 cgd
116 1.1 cgd for (prev = &db_breakpoint_list;
117 1.1 cgd (bkpt = *prev) != 0;
118 1.1 cgd prev = &bkpt->link) {
119 1.1 cgd if (db_map_equal(bkpt->map, map) &&
120 1.1 cgd (bkpt->address == addr)) {
121 1.1 cgd *prev = bkpt->link;
122 1.1 cgd break;
123 1.1 cgd }
124 1.1 cgd }
125 1.1 cgd if (bkpt == 0) {
126 1.1 cgd db_printf("Not set.\n");
127 1.1 cgd return;
128 1.1 cgd }
129 1.1 cgd
130 1.1 cgd db_breakpoint_free(bkpt);
131 1.1 cgd }
132 1.1 cgd
133 1.1 cgd db_breakpoint_t
134 1.1 cgd db_find_breakpoint(map, addr)
135 1.1 cgd vm_map_t map;
136 1.1 cgd db_addr_t addr;
137 1.1 cgd {
138 1.1 cgd register db_breakpoint_t bkpt;
139 1.1 cgd
140 1.1 cgd for (bkpt = db_breakpoint_list;
141 1.1 cgd bkpt != 0;
142 1.1 cgd bkpt = bkpt->link)
143 1.1 cgd {
144 1.1 cgd if (db_map_equal(bkpt->map, map) &&
145 1.1 cgd (bkpt->address == addr))
146 1.1 cgd return (bkpt);
147 1.1 cgd }
148 1.1 cgd return (0);
149 1.1 cgd }
150 1.1 cgd
151 1.1 cgd db_breakpoint_t
152 1.1 cgd db_find_breakpoint_here(addr)
153 1.1 cgd db_addr_t addr;
154 1.1 cgd {
155 1.1 cgd return db_find_breakpoint(db_map_addr(addr), addr);
156 1.1 cgd }
157 1.1 cgd
158 1.1 cgd boolean_t db_breakpoints_inserted = TRUE;
159 1.1 cgd
160 1.1 cgd void
161 1.1 cgd db_set_breakpoints()
162 1.1 cgd {
163 1.1 cgd register db_breakpoint_t bkpt;
164 1.1 cgd
165 1.1 cgd if (!db_breakpoints_inserted) {
166 1.1 cgd
167 1.1 cgd for (bkpt = db_breakpoint_list;
168 1.1 cgd bkpt != 0;
169 1.1 cgd bkpt = bkpt->link)
170 1.1 cgd if (db_map_current(bkpt->map)) {
171 1.1 cgd bkpt->bkpt_inst = db_get_value(bkpt->address,
172 1.1 cgd BKPT_SIZE,
173 1.1 cgd FALSE);
174 1.1 cgd db_put_value(bkpt->address,
175 1.1 cgd BKPT_SIZE,
176 1.1 cgd BKPT_SET(bkpt->bkpt_inst));
177 1.1 cgd }
178 1.1 cgd db_breakpoints_inserted = TRUE;
179 1.1 cgd }
180 1.1 cgd }
181 1.1 cgd
182 1.1 cgd void
183 1.1 cgd db_clear_breakpoints()
184 1.1 cgd {
185 1.1 cgd register db_breakpoint_t bkpt;
186 1.1 cgd
187 1.1 cgd if (db_breakpoints_inserted) {
188 1.1 cgd
189 1.1 cgd for (bkpt = db_breakpoint_list;
190 1.1 cgd bkpt != 0;
191 1.1 cgd bkpt = bkpt->link)
192 1.1 cgd if (db_map_current(bkpt->map)) {
193 1.1 cgd db_put_value(bkpt->address, BKPT_SIZE, bkpt->bkpt_inst);
194 1.1 cgd }
195 1.1 cgd db_breakpoints_inserted = FALSE;
196 1.1 cgd }
197 1.1 cgd }
198 1.1 cgd
199 1.1 cgd /*
200 1.1 cgd * Set a temporary breakpoint.
201 1.1 cgd * The instruction is changed immediately,
202 1.1 cgd * so the breakpoint does not have to be on the breakpoint list.
203 1.1 cgd */
204 1.1 cgd db_breakpoint_t
205 1.1 cgd db_set_temp_breakpoint(addr)
206 1.1 cgd db_addr_t addr;
207 1.1 cgd {
208 1.1 cgd register db_breakpoint_t bkpt;
209 1.1 cgd
210 1.1 cgd bkpt = db_breakpoint_alloc();
211 1.1 cgd if (bkpt == 0) {
212 1.1 cgd db_printf("Too many breakpoints.\n");
213 1.1 cgd return 0;
214 1.1 cgd }
215 1.1 cgd
216 1.1 cgd bkpt->map = NULL;
217 1.1 cgd bkpt->address = addr;
218 1.1 cgd bkpt->flags = BKPT_TEMP;
219 1.1 cgd bkpt->init_count = 1;
220 1.1 cgd bkpt->count = 1;
221 1.1 cgd
222 1.1 cgd bkpt->bkpt_inst = db_get_value(bkpt->address, BKPT_SIZE, FALSE);
223 1.1 cgd db_put_value(bkpt->address, BKPT_SIZE, BKPT_SET(bkpt->bkpt_inst));
224 1.1 cgd return bkpt;
225 1.1 cgd }
226 1.1 cgd
227 1.1 cgd void
228 1.1 cgd db_delete_temp_breakpoint(bkpt)
229 1.1 cgd db_breakpoint_t bkpt;
230 1.1 cgd {
231 1.1 cgd db_put_value(bkpt->address, BKPT_SIZE, bkpt->bkpt_inst);
232 1.1 cgd db_breakpoint_free(bkpt);
233 1.1 cgd }
234 1.1 cgd
235 1.1 cgd /*
236 1.1 cgd * List breakpoints.
237 1.1 cgd */
238 1.1 cgd void
239 1.1 cgd db_list_breakpoints()
240 1.1 cgd {
241 1.1 cgd register db_breakpoint_t bkpt;
242 1.1 cgd
243 1.1 cgd if (db_breakpoint_list == 0) {
244 1.1 cgd db_printf("No breakpoints set\n");
245 1.1 cgd return;
246 1.1 cgd }
247 1.1 cgd
248 1.1 cgd db_printf(" Map Count Address\n");
249 1.1 cgd for (bkpt = db_breakpoint_list;
250 1.1 cgd bkpt != 0;
251 1.1 cgd bkpt = bkpt->link)
252 1.1 cgd {
253 1.1 cgd db_printf("%s%8x %5d ",
254 1.1 cgd db_map_current(bkpt->map) ? "*" : " ",
255 1.1 cgd bkpt->map, bkpt->init_count);
256 1.1 cgd db_printsym(bkpt->address, DB_STGY_PROC);
257 1.1 cgd db_printf("\n");
258 1.1 cgd }
259 1.1 cgd }
260 1.1 cgd
261 1.1 cgd /* Delete breakpoint */
262 1.1 cgd /*ARGSUSED*/
263 1.1 cgd void
264 1.1 cgd db_delete_cmd(addr, have_addr, count, modif)
265 1.1 cgd db_expr_t addr;
266 1.1 cgd int have_addr;
267 1.1 cgd db_expr_t count;
268 1.1 cgd char * modif;
269 1.1 cgd {
270 1.1 cgd db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
271 1.1 cgd }
272 1.1 cgd
273 1.1 cgd /* Set breakpoint with skip count */
274 1.1 cgd /*ARGSUSED*/
275 1.1 cgd void
276 1.1 cgd db_breakpoint_cmd(addr, have_addr, count, modif)
277 1.1 cgd db_expr_t addr;
278 1.1 cgd int have_addr;
279 1.1 cgd db_expr_t count;
280 1.1 cgd char * modif;
281 1.1 cgd {
282 1.1 cgd if (count == -1)
283 1.1 cgd count = 1;
284 1.1 cgd
285 1.1 cgd db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
286 1.1 cgd }
287 1.1 cgd
288 1.1 cgd /* list breakpoints */
289 1.6 christos /*ARGSUSED*/
290 1.1 cgd void
291 1.6 christos db_listbreak_cmd(addr, have_addr, count, modif)
292 1.6 christos db_expr_t addr;
293 1.6 christos int have_addr;
294 1.6 christos db_expr_t count;
295 1.6 christos char * modif;
296 1.1 cgd {
297 1.1 cgd db_list_breakpoints();
298 1.1 cgd }
299 1.1 cgd
300 1.1 cgd #include <vm/vm_kern.h>
301 1.1 cgd
302 1.1 cgd /*
303 1.1 cgd * We want ddb to be usable before most of the kernel has been
304 1.1 cgd * initialized. In particular, current_thread() or kernel_map
305 1.1 cgd * (or both) may be null.
306 1.1 cgd */
307 1.1 cgd
308 1.1 cgd boolean_t
309 1.1 cgd db_map_equal(map1, map2)
310 1.1 cgd vm_map_t map1, map2;
311 1.1 cgd {
312 1.1 cgd return ((map1 == map2) ||
313 1.1 cgd ((map1 == NULL) && (map2 == kernel_map)) ||
314 1.1 cgd ((map1 == kernel_map) && (map2 == NULL)));
315 1.1 cgd }
316 1.1 cgd
317 1.1 cgd boolean_t
318 1.1 cgd db_map_current(map)
319 1.1 cgd vm_map_t map;
320 1.1 cgd {
321 1.1 cgd #if 0
322 1.1 cgd thread_t thread;
323 1.1 cgd
324 1.1 cgd return ((map == NULL) ||
325 1.1 cgd (map == kernel_map) ||
326 1.1 cgd (((thread = current_thread()) != NULL) &&
327 1.1 cgd (map == thread->task->map)));
328 1.1 cgd #else
329 1.1 cgd return (1);
330 1.1 cgd #endif
331 1.1 cgd }
332 1.1 cgd
333 1.1 cgd vm_map_t
334 1.1 cgd db_map_addr(addr)
335 1.1 cgd vm_offset_t addr;
336 1.1 cgd {
337 1.1 cgd #if 0
338 1.1 cgd thread_t thread;
339 1.1 cgd
340 1.1 cgd /*
341 1.1 cgd * We want to return kernel_map for all
342 1.1 cgd * non-user addresses, even when debugging
343 1.1 cgd * kernel tasks with their own maps.
344 1.1 cgd */
345 1.1 cgd
346 1.1 cgd if ((VM_MIN_ADDRESS <= addr) &&
347 1.1 cgd (addr < VM_MAX_ADDRESS) &&
348 1.1 cgd ((thread = current_thread()) != NULL))
349 1.1 cgd return thread->task->map;
350 1.1 cgd else
351 1.1 cgd #endif
352 1.1 cgd return kernel_map;
353 1.1 cgd }
354