1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
|
/*********************************************************************
dvstate.c
State debugger view.
****************************************************************************
Copyright Aaron Giles
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name 'MAME' nor the names of its contributors may be
used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY AARON GILES ''AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL AARON GILES BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
***************************************************************************/
#include "emu.h"
#include "debugvw.h"
#include "dvstate.h"
//**************************************************************************
// DEBUG VIEW STATE SOURCE
//**************************************************************************
//-------------------------------------------------
// debug_view_state_source - constructor
//-------------------------------------------------
debug_view_state_source::debug_view_state_source(const char *name, device_t &device)
: debug_view_source(name, &device),
m_device(device),
m_stateintf(dynamic_cast<device_state_interface *>(&device)),
m_execintf(dynamic_cast<device_execute_interface *>(&device))
{
}
//**************************************************************************
// DEBUG VIEW STATE
//**************************************************************************
//-------------------------------------------------
// debug_view_state - constructor
//-------------------------------------------------
debug_view_state::debug_view_state(running_machine &machine, debug_view_osd_update_func osdupdate, void *osdprivate)
: debug_view(machine, DVT_STATE, osdupdate, osdprivate),
m_divider(0),
m_last_update(0),
m_state_list(NULL)
{
// fail if no available sources
enumerate_sources();
if (m_source_list.count() == 0)
throw std::bad_alloc();
}
//-------------------------------------------------
// ~debug_view_state - destructor
//-------------------------------------------------
debug_view_state::~debug_view_state()
{
reset();
}
//-------------------------------------------------
// enumerate_sources - enumerate all possible
// sources for a registers view
//-------------------------------------------------
void debug_view_state::enumerate_sources()
{
// start with an empty list
m_source_list.reset();
// iterate over devices that have state interfaces
device_state_interface *state = NULL;
astring name;
for (bool gotone = m_machine.m_devicelist.first(state); gotone; gotone = state->next(state))
{
name.printf("%s '%s'", state->device().name(), state->device().tag());
m_source_list.append(*auto_alloc(m_machine, debug_view_state_source(name, state->device())));
}
// reset the source to a known good entry
set_source(*m_source_list.head());
}
//-------------------------------------------------
// reset - delete all of our state items
//-------------------------------------------------
void debug_view_state::reset()
{
// free all items in the state list
while (m_state_list != NULL)
{
state_item *oldhead = m_state_list;
m_state_list = oldhead->m_next;
auto_free(m_machine, oldhead);
}
}
//-------------------------------------------------
// recompute - recompute all info for the
// registers view
//-------------------------------------------------
void debug_view_state::recompute()
{
const debug_view_state_source &source = downcast<const debug_view_state_source &>(*m_source);
// start with a blank list
reset();
// add a cycles entry: cycles:99999999
state_item **tailptr = &m_state_list;
*tailptr = auto_alloc(m_machine, state_item(REG_CYCLES, "cycles", 8));
tailptr = &(*tailptr)->m_next;
// add a beam entry: beamx:1234
*tailptr = auto_alloc(m_machine, state_item(REG_BEAMX, "beamx", 4));
tailptr = &(*tailptr)->m_next;
// add a beam entry: beamy:5678
*tailptr = auto_alloc(m_machine, state_item(REG_BEAMY, "beamy", 4));
tailptr = &(*tailptr)->m_next;
// add a beam entry: frame:123456
*tailptr = auto_alloc(m_machine, state_item(REG_FRAME, "frame", 6));
tailptr = &(*tailptr)->m_next;
// add a flags entry: flags:xxxxxxxx
*tailptr = auto_alloc(m_machine, state_item(STATE_GENFLAGS, "flags", source.m_stateintf->state_string_max_length(STATE_GENFLAGS)));
tailptr = &(*tailptr)->m_next;
// add a divider entry
*tailptr = auto_alloc(m_machine, state_item(REG_DIVIDER, "", 0));
tailptr = &(*tailptr)->m_next;
// add all registers into it
for (const device_state_entry *entry = source.m_stateintf->state_first(); entry != NULL; entry = entry->next())
if (entry->visible())
{
*tailptr = auto_alloc(m_machine, state_item(entry->index(), entry->symbol(), source.m_stateintf->state_string_max_length(entry->index())));
tailptr = &(*tailptr)->m_next;
}
// count the entries and determine the maximum tag and value sizes
int count = 0;
int maxtaglen = 0;
int maxvallen = 0;
for (state_item *item = m_state_list; item != NULL; item = item->m_next)
{
count++;
maxtaglen = MAX(maxtaglen, item->m_symbol.len());
maxvallen = MAX(maxvallen, item->m_vallen);
}
// set the current divider and total cols
m_divider = 1 + maxtaglen + 1;
m_total.x = 1 + maxtaglen + 2 + maxvallen + 1;
m_total.y = count;
m_topleft.x = 0;
m_topleft.y = 0;
// no longer need to recompute
m_recompute = false;
}
//-------------------------------------------------
// view_notify - handle notification of updates
// to cursor changes
//-------------------------------------------------
void debug_view_state::view_notify(debug_view_notification type)
{
if (type == VIEW_NOTIFY_SOURCE_CHANGED)
m_recompute = true;
}
//-------------------------------------------------
// view_update - update the contents of the
// register view
//-------------------------------------------------
void debug_view_state::view_update()
{
// if our assumptions changed, revisit them
if (m_recompute)
recompute();
// get cycle count if we have an execute interface
const debug_view_state_source &source = downcast<const debug_view_state_source &>(*m_source);
UINT64 total_cycles = 0;
if (source.m_execintf != NULL)
total_cycles = source.m_execintf->total_cycles();
// find the first entry
state_item *curitem = m_state_list;
for (int index = 0; curitem != NULL && index < m_topleft.y; index++)
curitem = curitem->m_next;
// loop over visible rows
screen_device *screen = m_machine.primary_screen;
debug_view_char *dest = m_viewdata;
for (UINT32 row = 0; row < m_visible.y; row++)
{
UINT32 col = 0;
// if this visible row is valid, add it to the buffer
if (curitem != NULL)
{
UINT32 effcol = m_topleft.x;
UINT8 attrib = DCA_NORMAL;
UINT32 len = 0;
astring valstr;
// get the effective string
if (curitem->m_index >= REG_FRAME && curitem->m_index <= REG_DIVIDER)
{
curitem->m_lastval = curitem->m_currval;
switch (curitem->m_index)
{
case REG_DIVIDER:
curitem->m_vallen = 0;
curitem->m_symbol.reset();
for (int i = 0; i < m_total.x; i++)
curitem->m_symbol.cat("-");
break;
case REG_CYCLES:
if (source.m_execintf != NULL)
{
curitem->m_currval = source.m_execintf->cycles_remaining();
valstr.printf("%-8d", (UINT32)curitem->m_currval);
}
break;
case REG_BEAMX:
if (screen != NULL)
{
curitem->m_currval = screen->hpos();
valstr.printf("%4d", (UINT32)curitem->m_currval);
}
break;
case REG_BEAMY:
if (screen != NULL)
{
curitem->m_currval = screen->vpos();
valstr.printf("%4d", (UINT32)curitem->m_currval);
}
break;
case REG_FRAME:
if (screen != NULL)
{
curitem->m_currval = screen->frame_number();
valstr.printf("%6d", (UINT32)curitem->m_currval);
}
break;
}
}
else
{
if (m_last_update != total_cycles)
curitem->m_lastval = curitem->m_currval;
curitem->m_currval = source.m_stateintf->state(curitem->m_index);
source.m_stateintf->state_string(curitem->m_index, valstr);
}
// see if we changed
if (curitem->m_lastval != curitem->m_currval)
attrib = DCA_CHANGED;
// build up a string
char temp[256];
if (curitem->m_symbol.len() < m_divider - 1)
{
memset(&temp[len], ' ', m_divider - 1 - curitem->m_symbol.len());
len += m_divider - 1 - curitem->m_symbol.len();
}
memcpy(&temp[len], curitem->m_symbol.cstr(), curitem->m_symbol.len());
len += curitem->m_symbol.len();
temp[len++] = ' ';
temp[len++] = ' ';
memcpy(&temp[len], valstr.cstr(), curitem->m_vallen);
len += curitem->m_vallen;
temp[len++] = ' ';
temp[len] = 0;
// copy data
while (col < m_visible.x && effcol < len)
{
dest->byte = temp[effcol++];
dest->attrib = attrib | ((effcol <= m_divider) ? DCA_ANCILLARY : DCA_NORMAL);
dest++;
col++;
}
// advance to the next item
curitem = curitem->m_next;
}
// fill the rest with blanks
while (col < m_visible.x)
{
dest->byte = ' ';
dest->attrib = DCA_NORMAL;
dest++;
col++;
}
}
// remember the last update
m_last_update = total_cycles;
}
//-------------------------------------------------
// state_item - constructor
//-------------------------------------------------
debug_view_state::state_item::state_item(int index, const char *name, UINT8 valuechars)
: m_next(NULL),
m_lastval(0),
m_currval(0),
m_index(index),
m_vallen(valuechars),
m_symbol(name)
{
}
|