NetBSD/sys/ddb/db_break.c

318 lines
6.2 KiB
C
Raw Normal View History

/* $NetBSD: db_break.c,v 1.14 2000/06/26 14:21:09 mrg Exp $ */
1993-03-21 12:45:37 +03:00
/*
* Mach Operating System
* Copyright (c) 1991,1990 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
1993-03-21 12:45:37 +03:00
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie the
* rights to redistribute these changes.
*
* Author: David B. Golub, Carnegie Mellon University
* Date: 7/90
*/
1993-12-18 07:46:25 +03:00
1993-03-21 12:45:37 +03:00
/*
* Breakpoints.
*/
1993-12-18 07:46:25 +03:00
#include <sys/param.h>
#include <sys/proc.h>
1993-03-21 12:45:37 +03:00
#include <machine/db_machdep.h> /* type definitions */
#include <ddb/db_lex.h>
#include <ddb/db_access.h>
#include <ddb/db_sym.h>
#include <ddb/db_break.h>
1996-02-05 04:56:47 +03:00
#include <ddb/db_output.h>
1993-03-21 12:45:37 +03:00
#define NBREAKPOINTS 100
struct db_breakpoint db_break_table[NBREAKPOINTS];
db_breakpoint_t db_next_free_breakpoint = &db_break_table[0];
db_breakpoint_t db_free_breakpoints = 0;
db_breakpoint_t db_breakpoint_list = 0;
db_breakpoint_t
db_breakpoint_alloc()
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
if ((bkpt = db_free_breakpoints) != 0) {
db_free_breakpoints = bkpt->link;
return (bkpt);
}
if (db_next_free_breakpoint == &db_break_table[NBREAKPOINTS]) {
db_printf("All breakpoints used.\n");
return (0);
}
bkpt = db_next_free_breakpoint;
db_next_free_breakpoint++;
return (bkpt);
}
void
db_breakpoint_free(bkpt)
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
{
bkpt->link = db_free_breakpoints;
db_free_breakpoints = bkpt;
}
void
db_set_breakpoint(map, addr, count)
vm_map_t map;
db_addr_t addr;
int count;
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
if (db_find_breakpoint(map, addr)) {
db_printf("Already set.\n");
return;
}
bkpt = db_breakpoint_alloc();
if (bkpt == 0) {
db_printf("Too many breakpoints.\n");
return;
}
bkpt->map = map;
bkpt->address = addr;
bkpt->flags = 0;
bkpt->init_count = count;
bkpt->count = count;
bkpt->link = db_breakpoint_list;
db_breakpoint_list = bkpt;
}
void
db_delete_breakpoint(map, addr)
vm_map_t map;
db_addr_t addr;
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
db_breakpoint_t *prev;
1993-03-21 12:45:37 +03:00
for (prev = &db_breakpoint_list;
(bkpt = *prev) != 0;
prev = &bkpt->link) {
if (db_map_equal(bkpt->map, map) &&
(bkpt->address == addr)) {
*prev = bkpt->link;
break;
}
}
if (bkpt == 0) {
db_printf("Not set.\n");
return;
}
db_breakpoint_free(bkpt);
}
db_breakpoint_t
db_find_breakpoint(map, addr)
vm_map_t map;
db_addr_t addr;
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
for (bkpt = db_breakpoint_list;
bkpt != 0;
bkpt = bkpt->link)
{
if (db_map_equal(bkpt->map, map) &&
(bkpt->address == addr))
return (bkpt);
}
return (0);
}
db_breakpoint_t
db_find_breakpoint_here(addr)
db_addr_t addr;
{
return db_find_breakpoint(db_map_addr(addr), addr);
}
boolean_t db_breakpoints_inserted = TRUE;
void
db_set_breakpoints()
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
if (!db_breakpoints_inserted) {
for (bkpt = db_breakpoint_list;
bkpt != 0;
bkpt = bkpt->link)
if (db_map_current(bkpt->map)) {
bkpt->bkpt_inst = db_get_value(bkpt->address,
BKPT_SIZE,
FALSE);
db_put_value(bkpt->address,
BKPT_SIZE,
BKPT_SET(bkpt->bkpt_inst));
}
db_breakpoints_inserted = TRUE;
}
}
void
db_clear_breakpoints()
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
if (db_breakpoints_inserted) {
for (bkpt = db_breakpoint_list;
bkpt != 0;
bkpt = bkpt->link)
if (db_map_current(bkpt->map)) {
db_put_value(bkpt->address, BKPT_SIZE, bkpt->bkpt_inst);
}
db_breakpoints_inserted = FALSE;
}
}
/*
* List breakpoints.
*/
void
db_list_breakpoints()
{
2000-03-30 15:31:26 +04:00
db_breakpoint_t bkpt;
1993-03-21 12:45:37 +03:00
if (db_breakpoint_list == 0) {
db_printf("No breakpoints set\n");
return;
}
db_printf(" Map Count Address\n");
for (bkpt = db_breakpoint_list;
bkpt != 0;
bkpt = bkpt->link)
{
1996-03-31 01:30:03 +03:00
db_printf("%s%p %5d ",
1993-03-21 12:45:37 +03:00
db_map_current(bkpt->map) ? "*" : " ",
bkpt->map, bkpt->init_count);
db_printsym(bkpt->address, DB_STGY_PROC, db_printf);
1993-03-21 12:45:37 +03:00
db_printf("\n");
}
}
/* Delete breakpoint */
/*ARGSUSED*/
void
db_delete_cmd(addr, have_addr, count, modif)
db_expr_t addr;
int have_addr;
db_expr_t count;
char * modif;
{
db_delete_breakpoint(db_map_addr(addr), (db_addr_t)addr);
}
/* Set breakpoint with skip count */
/*ARGSUSED*/
void
db_breakpoint_cmd(addr, have_addr, count, modif)
db_expr_t addr;
int have_addr;
db_expr_t count;
char * modif;
{
if (count == -1)
count = 1;
db_set_breakpoint(db_map_addr(addr), (db_addr_t)addr, count);
}
/* list breakpoints */
1996-02-05 04:56:47 +03:00
/*ARGSUSED*/
1993-03-21 12:45:37 +03:00
void
1996-02-05 04:56:47 +03:00
db_listbreak_cmd(addr, have_addr, count, modif)
db_expr_t addr;
int have_addr;
db_expr_t count;
char * modif;
1993-03-21 12:45:37 +03:00
{
db_list_breakpoints();
}
#include <uvm/uvm_extern.h>
1993-03-21 12:45:37 +03:00
/*
* We want ddb to be usable before most of the kernel has been
* initialized. In particular, current_thread() or kernel_map
* (or both) may be null.
*/
boolean_t
db_map_equal(map1, map2)
vm_map_t map1, map2;
{
return ((map1 == map2) ||
((map1 == NULL) && (map2 == kernel_map)) ||
((map1 == kernel_map) && (map2 == NULL)));
}
boolean_t
db_map_current(map)
vm_map_t map;
{
#if 0
thread_t thread;
return ((map == NULL) ||
(map == kernel_map) ||
(((thread = current_thread()) != NULL) &&
(map == thread->task->map)));
#else
return (1);
#endif
}
vm_map_t
db_map_addr(addr)
vaddr_t addr;
1993-03-21 12:45:37 +03:00
{
#if 0
thread_t thread;
/*
* We want to return kernel_map for all
* non-user addresses, even when debugging
* kernel tasks with their own maps.
*/
if ((VM_MIN_ADDRESS <= addr) &&
(addr < VM_MAX_ADDRESS) &&
((thread = current_thread()) != NULL))
return thread->task->map;
else
#endif
return kernel_map;
}