blob: 7feb446a559086a891e39c6160a6b674cd6ec9e9 [file] [log] [blame]
Tom Rini10e47792018-05-06 17:58:06 -04001// SPDX-License-Identifier: GPL-2.0+
wdenk20e0e232002-09-08 16:09:41 +00002/*
3 * (C) Copyright 2000-2002
4 * Wolfgang Denk, DENX Software Engineering, wd@denx.de.
wdenk20e0e232002-09-08 16:09:41 +00005 */
6
7#include <common.h>
Simon Glass28db7f52020-06-07 20:33:00 -06008#include <compiler.h>
Simon Glassa73bda42015-11-08 23:47:45 -07009#include <console.h>
Simon Glass1ab16922022-07-31 12:28:48 -060010#include <display_options.h>
Simon Glass1b5fe402015-04-29 07:56:43 -060011#include <div64.h>
Pali Rohárba87ddf2021-08-02 15:18:31 +020012#include <version_string.h>
Grant Likely02a00782007-02-20 09:05:00 +010013#include <linux/ctype.h>
14#include <asm/io.h>
wdenk20e0e232002-09-08 16:09:41 +000015
Simon Glasse8583f92017-06-16 12:51:42 -060016char *display_options_get_banner_priv(bool newlines, const char *build_tag,
17 char *buf, int size)
wdenk20e0e232002-09-08 16:09:41 +000018{
Simon Glasse8583f92017-06-16 12:51:42 -060019 int len;
20
21 len = snprintf(buf, size, "%s%s", newlines ? "\n\n" : "",
22 version_string);
23 if (build_tag && len < size)
24 len += snprintf(buf + len, size - len, ", Build: %s",
25 build_tag);
26 if (len > size - 3)
27 len = size - 3;
Heinrich Schuchardtb144ab12019-04-26 18:39:00 +020028 if (len < 0)
29 len = 0;
30 snprintf(buf + len, size - len, "\n\n");
Simon Glasse8583f92017-06-16 12:51:42 -060031
32 return buf;
33}
34
35#ifndef BUILD_TAG
36#define BUILD_TAG NULL
wdenk20e0e232002-09-08 16:09:41 +000037#endif
Simon Glasse8583f92017-06-16 12:51:42 -060038
39char *display_options_get_banner(bool newlines, char *buf, int size)
40{
41 return display_options_get_banner_priv(newlines, BUILD_TAG, buf, size);
42}
43
44int display_options(void)
45{
46 char buf[DISPLAY_OPTIONS_BANNER_LENGTH];
47
48 display_options_get_banner(true, buf, sizeof(buf));
49 printf("%s", buf);
50
wdenk20e0e232002-09-08 16:09:41 +000051 return 0;
52}
53
Simon Glass1b5fe402015-04-29 07:56:43 -060054void print_freq(uint64_t freq, const char *s)
55{
Heiko Schocher62cb1562015-06-29 09:10:46 +020056 unsigned long m = 0;
Simon Glass1b5fe402015-04-29 07:56:43 -060057 uint32_t f;
Heinrich Schuchardtae1c9572020-10-08 22:23:23 +020058 static const char names[] = {'G', 'M', 'k'};
Simon Glass1b5fe402015-04-29 07:56:43 -060059 unsigned long d = 1e9;
60 char c = 0;
61 unsigned int i;
62
63 for (i = 0; i < ARRAY_SIZE(names); i++, d /= 1000) {
64 if (freq >= d) {
65 c = names[i];
66 break;
67 }
68 }
69
70 if (!c) {
Masahiro Yamadac7570a32018-08-06 20:47:40 +090071 printf("%llu Hz%s", freq, s);
Simon Glass1b5fe402015-04-29 07:56:43 -060072 return;
73 }
74
75 f = do_div(freq, d);
Simon Glass1b5fe402015-04-29 07:56:43 -060076
77 /* If there's a remainder, show the first few digits */
78 if (f) {
79 m = f;
80 while (m > 1000)
81 m /= 10;
82 while (m && !(m % 10))
83 m /= 10;
84 if (m >= 100)
85 m = (m / 10) + (m % 100 >= 50);
86 }
87
Suriyan Ramasami28ef5c52015-08-18 09:25:33 -070088 printf("%lu", (unsigned long) freq);
Simon Glass1b5fe402015-04-29 07:56:43 -060089 if (m)
90 printf(".%ld", m);
91 printf(" %cHz%s", c, s);
92}
93
Simon Glass08ea3732014-10-15 04:38:35 -060094void print_size(uint64_t size, const char *s)
wdenk20e0e232002-09-08 16:09:41 +000095{
Timur Tabi508a4e72010-04-13 13:16:02 -050096 unsigned long m = 0, n;
Simon Glass08ea3732014-10-15 04:38:35 -060097 uint64_t f;
Timur Tabi53258da2010-04-13 13:16:03 -050098 static const char names[] = {'E', 'P', 'T', 'G', 'M', 'K'};
Nick Thompsondd7e6c12010-05-11 11:29:52 +010099 unsigned long d = 10 * ARRAY_SIZE(names);
Timur Tabi53258da2010-04-13 13:16:03 -0500100 char c = 0;
101 unsigned int i;
wdenk20e0e232002-09-08 16:09:41 +0000102
Nick Thompsondd7e6c12010-05-11 11:29:52 +0100103 for (i = 0; i < ARRAY_SIZE(names); i++, d -= 10) {
104 if (size >> d) {
Timur Tabi53258da2010-04-13 13:16:03 -0500105 c = names[i];
106 break;
Becky Brucee9954d42008-07-09 11:09:41 -0500107 }
wdenk20e0e232002-09-08 16:09:41 +0000108 }
109
Timur Tabi53258da2010-04-13 13:16:03 -0500110 if (!c) {
Matwey V. Kornilovfae88752021-08-06 00:22:58 +0300111 /*
112 * SPL tiny-printf is not capable for printing uint64_t.
113 * We have just checked that the size is small enought to fit
114 * unsigned int safely.
115 */
116 printf("%u Bytes%s", (unsigned int)size, s);
Timur Tabi53258da2010-04-13 13:16:03 -0500117 return;
118 }
119
Nick Thompsondd7e6c12010-05-11 11:29:52 +0100120 n = size >> d;
121 f = size & ((1ULL << d) - 1);
wdenk20e0e232002-09-08 16:09:41 +0000122
Becky Brucee9954d42008-07-09 11:09:41 -0500123 /* If there's a remainder, deal with it */
Nick Thompsondd7e6c12010-05-11 11:29:52 +0100124 if (f) {
125 m = (10ULL * f + (1ULL << (d - 1))) >> d;
wdenk20e0e232002-09-08 16:09:41 +0000126
Becky Brucee9954d42008-07-09 11:09:41 -0500127 if (m >= 10) {
128 m -= 10;
129 n += 1;
130 }
wdenkf287a242003-07-01 21:06:45 +0000131 }
132
Timur Tabi53258da2010-04-13 13:16:03 -0500133 printf ("%lu", n);
wdenk20e0e232002-09-08 16:09:41 +0000134 if (m) {
135 printf (".%ld", m);
136 }
Timur Tabi53258da2010-04-13 13:16:03 -0500137 printf (" %ciB%s", c, s);
wdenk20e0e232002-09-08 16:09:41 +0000138}
Grant Likely02a00782007-02-20 09:05:00 +0100139
Simon Glass02b8f1a2021-05-08 07:00:05 -0600140#define MAX_LINE_LENGTH_BYTES 64
141#define DEFAULT_LINE_LENGTH_BYTES 16
142
143int hexdump_line(ulong addr, const void *data, uint width, uint count,
144 uint linelen, char *out, int size)
Grant Likely02a00782007-02-20 09:05:00 +0100145{
Reinhard Meyerd9f13d02010-09-08 12:25:40 +0200146 /* linebuf as a union causes proper alignment */
147 union linebuf {
York Sun6c480012014-02-26 17:03:19 -0800148 uint64_t uq[MAX_LINE_LENGTH_BYTES/sizeof(uint64_t) + 1];
Reinhard Meyerd9f13d02010-09-08 12:25:40 +0200149 uint32_t ui[MAX_LINE_LENGTH_BYTES/sizeof(uint32_t) + 1];
150 uint16_t us[MAX_LINE_LENGTH_BYTES/sizeof(uint16_t) + 1];
151 uint8_t uc[MAX_LINE_LENGTH_BYTES/sizeof(uint8_t) + 1];
152 } lb;
Simon Glass02b8f1a2021-05-08 07:00:05 -0600153 uint thislinelen;
Grant Likely02a00782007-02-20 09:05:00 +0100154 int i;
Simon Glass2056b9e2020-06-02 19:26:47 -0600155 ulong x;
Grant Likely02a00782007-02-20 09:05:00 +0100156
Simon Glass02b8f1a2021-05-08 07:00:05 -0600157 if (linelen * width > MAX_LINE_LENGTH_BYTES)
Grant Likely02a00782007-02-20 09:05:00 +0100158 linelen = MAX_LINE_LENGTH_BYTES / width;
159 if (linelen < 1)
160 linelen = DEFAULT_LINE_LENGTH_BYTES / width;
161
Simon Glass02b8f1a2021-05-08 07:00:05 -0600162 /*
163 * Check the size here so that we don't need to use snprintf(). This
164 * helps to reduce code size
165 */
166 if (size < HEXDUMP_MAX_BUF_LENGTH(linelen * width))
167 return -ENOSPC;
168
169 thislinelen = linelen;
170 out += sprintf(out, "%08lx:", addr);
171
172 /* check for overflow condition */
173 if (count < thislinelen)
174 thislinelen = count;
175
176 /* Copy from memory into linebuf and print hex values */
177 for (i = 0; i < thislinelen; i++) {
178 if (width == 4)
179 x = lb.ui[i] = *(volatile uint32_t *)data;
180 else if (MEM_SUPPORT_64BIT_DATA && width == 8)
181 x = lb.uq[i] = *(volatile ulong *)data;
182 else if (width == 2)
183 x = lb.us[i] = *(volatile uint16_t *)data;
184 else
185 x = lb.uc[i] = *(volatile uint8_t *)data;
186 if (CONFIG_IS_ENABLED(USE_TINY_PRINTF))
187 out += sprintf(out, " %x", (uint)x);
188 else
189 out += sprintf(out, " %0*lx", width * 2, x);
190 data += width;
191 }
192
193 /* fill line with whitespace for nice ASCII print */
194 for (i = 0; i < (linelen - thislinelen) * (width * 2 + 1); i++)
195 *out++ = ' ';
Grant Likely02a00782007-02-20 09:05:00 +0100196
Simon Glass02b8f1a2021-05-08 07:00:05 -0600197 /* Print data in ASCII characters */
198 for (i = 0; i < thislinelen * width; i++) {
199 if (!isprint(lb.uc[i]) || lb.uc[i] >= 0x80)
200 lb.uc[i] = '.';
201 }
202 lb.uc[i] = '\0';
203 out += sprintf(out, " %s", lb.uc);
Grant Likely02a00782007-02-20 09:05:00 +0100204
Simon Glass02b8f1a2021-05-08 07:00:05 -0600205 return thislinelen;
206}
Grant Likely02a00782007-02-20 09:05:00 +0100207
Simon Glass02b8f1a2021-05-08 07:00:05 -0600208int print_buffer(ulong addr, const void *data, uint width, uint count,
209 uint linelen)
210{
211 if (linelen*width > MAX_LINE_LENGTH_BYTES)
212 linelen = MAX_LINE_LENGTH_BYTES / width;
213 if (linelen < 1)
214 linelen = DEFAULT_LINE_LENGTH_BYTES / width;
215
216 while (count) {
217 uint thislinelen;
218 char buf[HEXDUMP_MAX_BUF_LENGTH(width * linelen)];
Andreas Bießmannb4ce02a2013-02-07 04:58:19 +0000219
Simon Glass02b8f1a2021-05-08 07:00:05 -0600220 thislinelen = hexdump_line(addr, data, width, count, linelen,
221 buf, sizeof(buf));
222 assert(thislinelen >= 0);
223 puts(buf);
224 putc('\n');
Grant Likely02a00782007-02-20 09:05:00 +0100225
226 /* update references */
Simon Glass02b8f1a2021-05-08 07:00:05 -0600227 data += thislinelen * width;
Andreas Bießmannb4ce02a2013-02-07 04:58:19 +0000228 addr += thislinelen * width;
229 count -= thislinelen;
Grant Likely02a00782007-02-20 09:05:00 +0100230
Simon Glass02b8f1a2021-05-08 07:00:05 -0600231 if (!IS_ENABLED(CONFIG_SPL_BUILD) && ctrlc())
232 return -EINTR;
Grant Likely02a00782007-02-20 09:05:00 +0100233 }
234
235 return 0;
236}