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
|
// SPDX-License-Identifier: GPL-2.0
// Copyright (C) 2020 Martin Whitaker.
//
// Derived from an extract of memtest86+ lib.c:
//
// lib.c - MemTest-86 Version 3.4
//
// Released under version 2 of the Gnu Public License.
// By Chris Brady
#include <stdbool.h>
#include <stdint.h>
#include "config.h"
#include "ctype.h"
#include "keyboard.h"
#include "print.h"
#include "serial.h"
#include "unistd.h"
#include "read.h"
//------------------------------------------------------------------------------
// Public Functions
//------------------------------------------------------------------------------
uintptr_t read_value(int row, int col, int field_width, int shift)
{
char buffer[1 + field_width];
for (int i = 0; i < field_width; i++ ) {
buffer[i] = ' ';
}
buffer[field_width] = '\0';
int n = 0;
int base = 10;
bool done = false;
bool tty_update = enable_tty;
bool got_suffix = false;
while (!done) {
char c = get_key();
if (tty_update) {
tty_send_region(row, col, row, col+10);
}
tty_update = enable_tty;
switch (c) {
case '\n':
if (n > 0) {
done = true;
}
break;
case '\b':
if (n > 0) {
got_suffix = false;
buffer[--n] = ' ';
}
break;
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
if (n < field_width && base >= 10 && !got_suffix) {
buffer[n] = c;
}
break;
case 'a':
case 'b':
case 'c':
case 'd':
case 'e':
case 'f':
if (n < field_width && base >= 16 && !got_suffix) {
buffer[n] = c;
}
break;
case 'k':
case 'p':
case 'm':
case 'g':
case 't':
if (n > 0 && n < field_width && buffer[n-1] != 'x') {
got_suffix = true;
buffer[n] = toupper(c);
}
break;
case 'x':
/* Only allow 'x' after an initial 0 */
if (n == 1 && n < field_width && buffer[0] == '0') {
buffer[n] = 'x';
}
break;
default:
usleep(1000);
tty_update = false;
break;
}
if (n < field_width && buffer[n] != ' ') {
n++;
}
prints(row, col, buffer);
if (buffer[0] == '0' && buffer[1] == 'x') {
base = 16;
} else {
base = 10;
}
}
if (got_suffix) {
switch (buffer[n-1]) {
case 'T': /* tera */ shift += 40; n--; break;
case 'G': /* gig */ shift += 30; n--; break;
case 'M': /* meg */ shift += 20; n--; break;
case 'P': /* page */ shift += 12; n--; break;
case 'K': /* kilo */ shift += 10; n--; break;
}
}
uintptr_t value = 0;
for (int i = (base == 16) ? 2 : 0; i < n; i++) {
value *= base;
if (buffer[i] >= 'a') {
value += buffer[i] - 'a';
} else {
value += buffer[i] - '0';
}
}
return shift < 0 ? value >> shift : value << shift;
}
|
