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
|
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "blastem.h"
#include "menu.h"
#include "backend.h"
#include "util.h"
uint16_t menu_read_w(uint32_t address, void * context)
{
//This should return the status of the last request with 0
//meaning either the request is complete or no request is pending
//in the current implementation, the operations happen instantly
//in emulated time so we can always return 0
return 0;
}
int menu_dir_sort(const void *a, const void *b)
{
const dir_entry *da, *db;
da = a;
db = b;
if (da->is_dir != db->is_dir) {
return db->is_dir - da->is_dir;
}
return strcasecmp(((dir_entry *)a)->name, ((dir_entry *)b)->name);
}
void * menu_write_w(uint32_t address, void * context, uint16_t value)
{
m68k_context *m68k = context;
genesis_context *gen = m68k->system;
menu_context *menu = gen->extra;
if (!menu) {
gen->extra = menu = calloc(1, sizeof(menu_context));
menu->curpath = strdup(get_home_dir());
}
if (menu->state) {
uint32_t dst = menu->latch << 16 | value;
switch (address >> 2)
{
case 0: {
size_t num_entries;
dir_entry *entries = get_dir_list(menu->curpath, &num_entries);
if (entries) {
qsort(entries, num_entries, sizeof(dir_entry), menu_dir_sort);
}
uint8_t *dest;
for (size_t i = 0; i < num_entries; i++)
{
dest = get_native_pointer(dst, (void **)m68k->mem_pointers, &m68k->options->gen);
if (!dest) {
break;
}
*(dest++) = entries[i].is_dir;
*(dest++) = 1;
dst += 2;
uint8_t term = 0;
for (char *cpos = entries[i].name; *cpos; cpos++)
{
dest[1] = *cpos;
dest[0] = cpos[1];
if (cpos[1]) {
cpos++;
} else {
term = 1;
}
dst += 2;
if (!(dst & 0xFFFF)) {
//we may have walked off the end of a memory block, get a fresh native pointer
dest = get_native_pointer(dst, (void **)m68k->mem_pointers, &m68k->options->gen);
if (!dest) {
break;
}
} else {
dest += 2;
}
}
if (!term) {
*(dest++) = 0;
*dest = 0;
dst += 2;
}
}
//terminate list
dest = get_native_pointer(dst, (void **)m68k->mem_pointers, &m68k->options->gen);
if (dest) {
*dest = dest[1] = 0;
free_dir_list(entries, num_entries);
}
break;
}
case 1: {
char buf[4096];
char *cur;
char * dest = NULL;
for (cur = buf; cur < buf+sizeof(buf); cur+=2, dst+=2, dest+=2)
{
if (!dest || !(dst & 0xFFFF)) {
//we may have walked off the end of a memory block, get a fresh native pointer
dest = get_native_pointer(dst, (void **)m68k->mem_pointers, &m68k->options->gen);
if (!dest) {
break;
}
}
*cur = dest[1];
cur[1] = *dest;
if (!*dest || !dest[1]) {
break;
}
}
if (!strcmp(buf, "..")) {
size_t len = strlen(menu->curpath);
while (len > 1) {
--len;
if (menu->curpath[len] == '/') {
menu->curpath[len] = 0;
break;
}
}
} else {
char *pieces[] = {menu->curpath, "/", buf};
menu->curpath = alloc_concat_m(3, pieces);
free(pieces[0]);
}
break;
}
default:
fprintf(stderr, "WARNING: write to undefined menu port %X\n", address);
}
menu->state = 0;
} else {
menu->latch = value;
menu->state = 1;
}
return context;
}
|
