2020-03-10 18:58:36 +03:00
|
|
|
/* $NetBSD: db_variables.c,v 1.47 2020/03/10 15:58:37 christos Exp $ */
|
1994-06-29 10:29:24 +04:00
|
|
|
|
2002-02-15 10:33:48 +03:00
|
|
|
/*
|
1993-03-21 12:45:37 +03:00
|
|
|
* Mach Operating System
|
|
|
|
* Copyright (c) 1991,1990 Carnegie Mellon University
|
|
|
|
* All Rights Reserved.
|
2002-02-15 10:33:48 +03:00
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
* 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.
|
2002-02-15 10:33:48 +03:00
|
|
|
*
|
1999-04-13 00:38:17 +04:00
|
|
|
* 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.
|
2002-02-15 10:33:48 +03:00
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
* Carnegie Mellon requests users of this software to return to
|
2002-02-15 10:33:48 +03:00
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
|
|
|
|
* School of Computer Science
|
|
|
|
* Carnegie Mellon University
|
|
|
|
* Pittsburgh PA 15213-3890
|
2002-02-15 10:33:48 +03:00
|
|
|
*
|
1993-03-21 12:45:37 +03:00
|
|
|
* any improvements or extensions that they make and grant Carnegie the
|
|
|
|
* rights to redistribute these changes.
|
|
|
|
*/
|
|
|
|
|
2001-11-13 01:54:03 +03:00
|
|
|
#include <sys/cdefs.h>
|
2020-03-10 18:58:36 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: db_variables.c,v 1.47 2020/03/10 15:58:37 christos Exp $");
|
2001-11-13 01:54:03 +03:00
|
|
|
|
2009-03-08 01:02:16 +03:00
|
|
|
#ifdef _KERNEL_OPT
|
2002-11-04 09:24:38 +03:00
|
|
|
#include "opt_ddbparam.h"
|
2009-03-08 01:02:16 +03:00
|
|
|
#endif
|
1998-07-05 02:18:13 +04:00
|
|
|
|
1993-12-18 07:46:25 +03:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/proc.h>
|
2000-06-27 21:55:38 +04:00
|
|
|
#include <uvm/uvm_extern.h>
|
1997-01-09 08:37:02 +03:00
|
|
|
#include <sys/sysctl.h>
|
1993-12-18 07:46:25 +03:00
|
|
|
|
2009-03-08 01:02:16 +03:00
|
|
|
#include <ddb/ddb.h>
|
1998-07-05 02:18:13 +04:00
|
|
|
#include <ddb/ddbvar.h>
|
|
|
|
|
1997-01-09 08:37:02 +03:00
|
|
|
/*
|
|
|
|
* If this is non-zero, the DDB will be entered when the system
|
|
|
|
* panics. Initialize it so that it's patchable.
|
|
|
|
*/
|
|
|
|
#ifndef DDB_ONPANIC
|
2009-03-12 02:22:57 +03:00
|
|
|
#define DDB_ONPANIC 1
|
1997-01-09 08:37:02 +03:00
|
|
|
#endif
|
|
|
|
int db_onpanic = DDB_ONPANIC;
|
|
|
|
|
1998-10-30 00:22:32 +03:00
|
|
|
/*
|
|
|
|
* Can DDB can be entered from the console?
|
|
|
|
*/
|
|
|
|
#ifndef DDB_FROMCONSOLE
|
|
|
|
#define DDB_FROMCONSOLE 1
|
|
|
|
#endif
|
|
|
|
int db_fromconsole = DDB_FROMCONSOLE;
|
|
|
|
|
2004-09-30 03:54:11 +04:00
|
|
|
/*
|
|
|
|
* Output DDB output to the message buffer?
|
|
|
|
*/
|
|
|
|
#ifndef DDB_TEE_MSGBUF
|
|
|
|
#define DDB_TEE_MSGBUF 0
|
|
|
|
#endif
|
|
|
|
int db_tee_msgbuf = DDB_TEE_MSGBUF;
|
|
|
|
|
2017-12-28 20:51:19 +03:00
|
|
|
#ifndef DDB_PANICSTACKFRAMES
|
|
|
|
#define DDB_PANICSTACKFRAMES 65535
|
|
|
|
#endif
|
|
|
|
int db_panicstackframes = DDB_PANICSTACKFRAMES;
|
|
|
|
|
2018-02-17 03:41:09 +03:00
|
|
|
#ifndef DDB_DUMPSTACK
|
|
|
|
#define DDB_DUMPSTACK 1
|
|
|
|
#endif
|
|
|
|
int db_dumpstack = DDB_DUMPSTACK;
|
2004-09-30 03:54:11 +04:00
|
|
|
|
2002-02-15 10:33:48 +03:00
|
|
|
static int db_rw_internal_variable(const struct db_variable *, db_expr_t *,
|
|
|
|
int);
|
|
|
|
static int db_find_variable(const struct db_variable **);
|
1997-02-04 03:33:32 +03:00
|
|
|
|
|
|
|
/* XXX must all be ints for sysctl. */
|
2001-01-17 22:50:03 +03:00
|
|
|
const struct db_variable db_vars[] = {
|
2017-12-28 20:51:19 +03:00
|
|
|
{
|
|
|
|
.name = "fromconsole",
|
|
|
|
.valuep = &db_fromconsole,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "maxoff",
|
|
|
|
.valuep = &db_maxoff,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "maxwidth",
|
|
|
|
.valuep = &db_max_width,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "lines",
|
|
|
|
.valuep = &db_max_line,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "onpanic",
|
|
|
|
.valuep = &db_onpanic,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "panicstackframes",
|
|
|
|
.valuep = &db_panicstackframes,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
2018-02-17 03:41:09 +03:00
|
|
|
{
|
|
|
|
.name = "dumpstack",
|
|
|
|
.valuep = &db_dumpstack,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
2017-12-28 20:51:19 +03:00
|
|
|
{
|
|
|
|
.name = "radix",
|
|
|
|
.valuep = &db_radix,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "tabstops",
|
|
|
|
.valuep = &db_tab_stop_width,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
.name = "tee_msgbuf",
|
|
|
|
.valuep = &db_tee_msgbuf,
|
|
|
|
.fcn = db_rw_internal_variable,
|
|
|
|
.modif = NULL,
|
|
|
|
},
|
1993-03-21 12:45:37 +03:00
|
|
|
};
|
2017-12-28 20:51:19 +03:00
|
|
|
const struct db_variable * const db_evars = db_vars + __arraycount(db_vars);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1997-02-04 03:33:32 +03:00
|
|
|
/*
|
|
|
|
* ddb command line access to the DDB variables defined above.
|
|
|
|
*/
|
|
|
|
static int
|
2002-02-15 10:33:48 +03:00
|
|
|
db_rw_internal_variable(const struct db_variable *vp, db_expr_t *valp, int rw)
|
1997-02-04 03:33:32 +03:00
|
|
|
{
|
|
|
|
|
2002-02-15 10:33:48 +03:00
|
|
|
if (rw == DB_VAR_GET)
|
1997-02-04 03:33:32 +03:00
|
|
|
*valp = *(int *)vp->valuep;
|
2002-02-15 10:33:48 +03:00
|
|
|
else
|
1997-02-04 03:33:32 +03:00
|
|
|
*(int *)vp->valuep = *valp;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1997-01-09 08:37:02 +03:00
|
|
|
/*
|
|
|
|
* sysctl(3) access to the DDB variables defined above.
|
|
|
|
*/
|
2009-03-08 01:02:16 +03:00
|
|
|
#ifdef _KERNEL
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
SYSCTL_SETUP(sysctl_ddb_setup, "sysctl ddb subtree setup")
|
1997-01-09 08:37:02 +03:00
|
|
|
{
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "radix",
|
|
|
|
SYSCTL_DESCR("Input and output radix"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_radix, 0,
|
|
|
|
CTL_DDB, DDBCTL_RADIX, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "maxoff",
|
|
|
|
SYSCTL_DESCR("Maximum symbol offset"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_maxoff, 0,
|
|
|
|
CTL_DDB, DDBCTL_MAXOFF, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "maxwidth",
|
|
|
|
SYSCTL_DESCR("Maximum output line width"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_max_width, 0,
|
|
|
|
CTL_DDB, DDBCTL_MAXWIDTH, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "lines",
|
|
|
|
SYSCTL_DESCR("Number of display lines"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_max_line, 0,
|
|
|
|
CTL_DDB, DDBCTL_LINES, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "tabstops",
|
|
|
|
SYSCTL_DESCR("Output tab width"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_tab_stop_width, 0,
|
|
|
|
CTL_DDB, DDBCTL_TABSTOPS, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "onpanic",
|
|
|
|
SYSCTL_DESCR("Whether to enter ddb on a kernel panic"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_onpanic, 0,
|
|
|
|
CTL_DDB, DDBCTL_ONPANIC, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:31:48 +04:00
|
|
|
CTLTYPE_INT, "fromconsole",
|
|
|
|
SYSCTL_DESCR("Whether ddb can be entered from the "
|
|
|
|
"console"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &db_fromconsole, 0,
|
|
|
|
CTL_DDB, DDBCTL_FROMCONSOLE, CTL_EOL);
|
2004-09-30 03:54:11 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "tee_msgbuf",
|
|
|
|
SYSCTL_DESCR("Whether to tee ddb output to the msgbuf"),
|
|
|
|
NULL, 0, &db_tee_msgbuf, 0,
|
|
|
|
CTL_DDB, CTL_CREATE, CTL_EOL);
|
2005-11-27 16:05:28 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_STRING, "commandonenter",
|
|
|
|
SYSCTL_DESCR("Command to be executed on each ddb enter"),
|
2012-06-03 01:36:41 +04:00
|
|
|
NULL, 0, db_cmd_on_enter, DB_LINE_MAXLEN,
|
2005-11-27 16:05:28 +03:00
|
|
|
CTL_DDB, CTL_CREATE, CTL_EOL);
|
2017-12-28 20:51:19 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "panicstackframes",
|
|
|
|
SYSCTL_DESCR("Number of stack frames to print on panic"),
|
|
|
|
NULL, 0, &db_panicstackframes, 0,
|
|
|
|
CTL_DDB, CTL_CREATE, CTL_EOL);
|
2018-02-17 03:41:09 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "dumpstack",
|
|
|
|
SYSCTL_DESCR("On panic print stack trace"),
|
|
|
|
NULL, 0, &db_dumpstack, 0,
|
|
|
|
CTL_DDB, CTL_CREATE, CTL_EOL);
|
1997-01-09 08:37:02 +03:00
|
|
|
}
|
2009-03-08 01:02:16 +03:00
|
|
|
#endif /* _KERNEL */
|
1997-01-09 08:37:02 +03:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
int
|
2002-02-15 10:33:48 +03:00
|
|
|
db_find_variable(const struct db_variable **varp)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
|
|
|
int t;
|
2001-01-17 22:50:03 +03:00
|
|
|
const struct db_variable *vp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
t = db_read_token();
|
|
|
|
if (t == tIDENT) {
|
2002-02-15 10:33:48 +03:00
|
|
|
for (vp = db_vars; vp < db_evars; vp++) {
|
|
|
|
if (!strcmp(db_tok_string, vp->name)) {
|
|
|
|
*varp = vp;
|
|
|
|
return (1);
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2020-03-10 18:58:36 +03:00
|
|
|
#ifdef _KERNEL
|
2002-02-15 10:33:48 +03:00
|
|
|
for (vp = db_regs; vp < db_eregs; vp++) {
|
|
|
|
if (!strcmp(db_tok_string, vp->name)) {
|
|
|
|
*varp = vp;
|
|
|
|
return (1);
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2020-03-10 18:58:36 +03:00
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
db_error("Unknown variable\n");
|
1994-10-09 11:56:23 +03:00
|
|
|
/*NOTREACHED*/
|
1996-02-05 04:56:47 +03:00
|
|
|
return 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2002-02-15 10:33:48 +03:00
|
|
|
db_get_variable(db_expr_t *valuep)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2001-01-17 22:50:03 +03:00
|
|
|
const struct db_variable *vp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
if (!db_find_variable(&vp))
|
2002-02-15 10:33:48 +03:00
|
|
|
return (0);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
db_read_variable(vp, valuep);
|
|
|
|
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2002-02-15 10:33:48 +03:00
|
|
|
db_set_variable(db_expr_t value)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2001-01-17 22:50:03 +03:00
|
|
|
const struct db_variable *vp;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
if (!db_find_variable(&vp))
|
2002-02-15 10:33:48 +03:00
|
|
|
return (0);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
db_write_variable(vp, &value);
|
|
|
|
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1996-02-05 04:56:47 +03:00
|
|
|
void
|
2002-02-15 10:33:48 +03:00
|
|
|
db_read_variable(const struct db_variable *vp, db_expr_t *valuep)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2002-02-15 10:33:48 +03:00
|
|
|
int (*func)(const struct db_variable *, db_expr_t *, int) = vp->fcn;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
if (func == FCN_NULL)
|
2017-12-28 20:51:19 +03:00
|
|
|
*valuep = *(db_expr_t *)vp->valuep;
|
1993-03-21 12:45:37 +03:00
|
|
|
else
|
2002-02-15 10:33:48 +03:00
|
|
|
(*func)(vp, valuep, DB_VAR_GET);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
1996-02-05 04:56:47 +03:00
|
|
|
void
|
2002-02-15 10:33:48 +03:00
|
|
|
db_write_variable(const struct db_variable *vp, db_expr_t *valuep)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2002-02-15 10:33:48 +03:00
|
|
|
int (*func)(const struct db_variable *, db_expr_t *, int) = vp->fcn;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
if (func == FCN_NULL)
|
2017-12-28 20:51:19 +03:00
|
|
|
*(db_expr_t *)vp->valuep = *valuep;
|
1993-03-21 12:45:37 +03:00
|
|
|
else
|
2002-02-15 10:33:48 +03:00
|
|
|
(*func)(vp, valuep, DB_VAR_SET);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
1996-02-05 04:56:47 +03:00
|
|
|
/*ARGSUSED*/
|
1993-03-21 12:45:37 +03:00
|
|
|
void
|
2007-02-22 07:38:02 +03:00
|
|
|
db_set_cmd(db_expr_t addr, bool have_addr,
|
2006-11-16 04:32:37 +03:00
|
|
|
db_expr_t count, const char *modif)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
|
|
|
db_expr_t value;
|
2000-07-05 20:29:25 +04:00
|
|
|
db_expr_t old_value;
|
2006-05-14 09:30:31 +04:00
|
|
|
const struct db_variable *vp = NULL; /* XXX: GCC */
|
1993-03-21 12:45:37 +03:00
|
|
|
int t;
|
|
|
|
|
|
|
|
t = db_read_token();
|
|
|
|
if (t != tDOLLAR) {
|
2002-02-15 10:33:48 +03:00
|
|
|
db_error("Unknown variable\n");
|
|
|
|
/*NOTREACHED*/
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
if (!db_find_variable(&vp)) {
|
2002-02-15 10:33:48 +03:00
|
|
|
db_error("Unknown variable\n");
|
|
|
|
/*NOTREACHED*/
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
t = db_read_token();
|
|
|
|
if (t != tEQ)
|
2002-02-15 10:33:48 +03:00
|
|
|
db_unread_token(t);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
if (!db_expression(&value)) {
|
2002-02-15 10:33:48 +03:00
|
|
|
db_error("No value\n");
|
|
|
|
/*NOTREACHED*/
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
if (db_read_token() != tEOL) {
|
2002-02-15 10:33:48 +03:00
|
|
|
db_error("?\n");
|
|
|
|
/*NOTREACHED*/
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
2000-07-05 20:29:25 +04:00
|
|
|
db_read_variable(vp, &old_value);
|
|
|
|
db_printf("$%s\t\t%s = ", vp->name, db_num_to_str(old_value));
|
|
|
|
db_printf("%s\n", db_num_to_str(value));
|
1993-03-21 12:45:37 +03:00
|
|
|
db_write_variable(vp, &value);
|
|
|
|
}
|