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