1/*
2 * Copyright (c) 2000-2005 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
14 *
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
17 *
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
25 *
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
27 */
28/*
29 * @OSF_COPYRIGHT@
30 */
31/*
32 * Mach Operating System
33 * Copyright (c) 1991,1990 Carnegie Mellon University
34 * All Rights Reserved.
35 *
36 * Permission to use, copy, modify and distribute this software and its
37 * documentation is hereby granted, provided that both the copyright
38 * notice and this permission notice appear in all copies of the
39 * software, derivative works or modified versions, and any portions
40 * thereof, and that both notices appear in supporting documentation.
41 *
42 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
43 * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
44 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
45 *
46 * Carnegie Mellon requests users of this software to return to
47 *
48 *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
49 *  School of Computer Science
50 *  Carnegie Mellon University
51 *  Pittsburgh PA 15213-3890
52 *
53 * any improvements or extensions that they make and grant Carnegie Mellon
54 * the rights to redistribute these changes.
55 */
56/*
57 */
58/*
59 *	Author: David B. Golub,  Carnegie Mellon University
60 *	Date:	7/90
61 */
62
63#include <mach/boolean.h>
64#include <kern/task.h>
65#include <kern/thread.h>
66
67#include <machine/db_machdep.h>
68
69#include <ddb/db_lex.h>
70#include <ddb/db_access.h>
71#include <ddb/db_command.h>
72#include <ddb/db_sym.h>
73#include <ddb/db_task_thread.h>
74#include <ddb/db_expr.h>
75#include <ddb/db_write_cmd.h>
76#include <ddb/db_output.h>			/* For db_printf() */
77
78/*
79 * Write to file.
80 */
81void
82db_write_cmd(db_expr_t address, __unused boolean_t have_addr,
83	     __unused db_expr_t count, char *modif)
84{
85	register db_addr_t	addr;
86	register db_expr_t	old_value;
87	db_expr_t	new_value;
88	register int	size;
89	boolean_t	wrote_one = FALSE;
90	boolean_t	t_opt, u_opt;
91	thread_t	thr_act;
92	task_t		task;
93
94	addr = (db_addr_t) address;
95
96	size = db_size_option(modif, &u_opt, &t_opt);
97
98	if (t_opt)
99	  {
100	    if (!db_get_next_act(&thr_act, 0))
101	      return;
102	    task = thr_act->task;
103	  }
104	else
105	  task = db_current_space();
106
107	/* if user space is not explicitly specified,
108	   look in the kernel */
109	if (!u_opt)
110	  task = TASK_NULL;
111
112	if (!DB_VALID_ADDRESS(addr, u_opt)) {
113	  db_printf("Bad address 0x%llx\n", (unsigned long long)addr);
114	  return;
115	}
116
117	while (db_expression(&new_value)) {
118	    old_value = db_get_task_value(addr, size, FALSE, task);
119	    db_task_printsym(addr, DB_STGY_ANY, task);
120	    db_printf("\t\t%#8lln\t=\t%#8lln\n", (unsigned long long)old_value, (unsigned long long)new_value);
121	    db_put_task_value(addr, size, new_value, task);
122	    addr += size;
123
124	    wrote_one = TRUE;
125	}
126
127	if (!wrote_one)
128	    db_error("Nothing written.\n");
129
130	db_next = addr;
131	db_prev = addr - size;
132}
133