blob: 57a271d05d3ef61c6a8d597d8fcece91b95af6f7 [file] [log] [blame]
Peter Stugedad1e302008-11-22 17:13:36 +00001/*
2 * This file is part of msrtool.
3 *
4 * Copyright (c) 2008 Peter Stuge <peter@stuge.se>
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
Peter Stugedad1e302008-11-22 17:13:36 +000014 */
15
16#include <stdio.h>
17#include <string.h>
18#include <stdlib.h>
19
20#include "msrtool.h"
21
22static void print_bitdef(FILE *f, const struct msrbits *mb, const char *tail) {
23 uint8_t endbit;
Peter Stugecc9db9d2008-11-22 18:29:44 +000024 if (!reserved && 0 == strcmp(mb->name, "RSVD"))
Peter Stugedad1e302008-11-22 17:13:36 +000025 return;
26 if (1 == mb->size)
27 fprintf(f, "# %5d", mb->start);
28 else {
29 endbit = mb->start - mb->size + 1;
30 fprintf(f, "# %*d:%d", endbit < 10 ? 3 : 2, mb->start, endbit);
31 }
Peter Stugecc9db9d2008-11-22 18:29:44 +000032 if (0 == strcmp(mb->name, "RSVD"))
Peter Stugedad1e302008-11-22 17:13:36 +000033 fprintf(f, " [%s]", mb->desc);
34 else
35 fprintf(f, " %s %s", mb->name, mb->desc);
36 fprintf(f, "%s", tail);
37}
38
39static void print_bitval(FILE *f, const struct msrbits *mb, const struct msr val) {
40 uint8_t i;
41 struct msr tmp, mask = MSR1(1);
42 const struct msrbitvalues *mbv = mb->bitval;
43 while (mbv->text && !msr_eq(mbv->value, val))
44 mbv++;
45 switch (mb->present) {
46 case PRESENT_BIN:
47 mask = msr_shl(mask, mb->size - 1);
48 for (i = 0; i < mb->size; i++) {
49 memcpy(&tmp, &val, sizeof(val));
50 msr_and(&tmp, mask);
51 fprintf(f, "%d", (tmp.hi || tmp.lo) ? 1 : 0);
52 mask = msr_shr(mask, 1);
53 }
Peter Stugedad1e302008-11-22 17:13:36 +000054 break;
55 case PRESENT_DEC:
56 fprintf(f, "%d", val.lo);
57 break;
58 case PRESENT_OCT:
59 fprintf(f, "0%o", val.lo);
60 break;
61 case PRESENT_HEX:
62 hexprint(f, val, mb->size);
63 break;
64 case PRESENT_HEXDEC:
65 hexprint(f, val, mb->size);
66 fprintf(f, " %d", val.lo);
67 break;
68 }
69 if (mbv->text)
70 fprintf(f, ": %s", mbv->text);
71 fprintf(f, "\n");
72}
73
74void hexprint(FILE *f, const struct msr val, const uint8_t bits) {
75 if (bits <= 4)
Peter Stugeb1180b42010-05-17 07:40:20 +000076 fprintf(f, "0x%01x", val.lo & 0xf);
Peter Stugedad1e302008-11-22 17:13:36 +000077 else if (bits <= 8)
Peter Stuge87964862010-05-17 07:29:47 +000078 fprintf(f, "0x%02x", val.lo & 0xff);
Peter Stugeb1180b42010-05-17 07:40:20 +000079 else if (bits <= 12)
80 fprintf(f, "0x%03x", val.lo & 0xfff);
Peter Stugedad1e302008-11-22 17:13:36 +000081 else if (bits <= 16)
Peter Stuge87964862010-05-17 07:29:47 +000082 fprintf(f, "0x%04x", val.lo & 0xffff);
Peter Stugeb1180b42010-05-17 07:40:20 +000083 else if (bits <= 20)
84 fprintf(f, "0x%05x", val.lo & 0xfffff);
85 else if (bits <= 24)
86 fprintf(f, "0x%06x", val.lo & 0xffffff);
87 else if (bits <= 28)
88 fprintf(f, "0x%07x", val.lo & 0xfffffff);
Peter Stugedad1e302008-11-22 17:13:36 +000089 else if (bits <= 32)
90 fprintf(f, "0x%08x", val.lo);
Peter Stugeb1180b42010-05-17 07:40:20 +000091 else if (bits <= 36)
92 fprintf(f, "0x%01x%08x", val.hi & 0xf, val.lo);
93 else if (bits <= 40)
94 fprintf(f, "0x%02x%08x", val.hi & 0xff, val.lo);
95 else if (bits <= 44)
96 fprintf(f, "0x%03x%08x", val.hi & 0xfff, val.lo);
97 else if (bits <= 48)
98 fprintf(f, "0x%04x%08x", val.hi & 0xffff, val.lo);
99 else if (bits <= 52)
100 fprintf(f, "0x%05x%08x", val.hi & 0xfffff, val.lo);
101 else if (bits <= 56)
102 fprintf(f, "0x%06x%08x", val.hi & 0xffffff, val.lo);
103 else if (bits <= 60)
104 fprintf(f, "0x%07x%08x", val.hi & 0xfffffff, val.lo);
Peter Stugedad1e302008-11-22 17:13:36 +0000105 else
106 fprintf(f, "0x%08x%08x", val.hi, val.lo);
107}
108
109int msr_eq(const struct msr a, const struct msr b) {
110 return a.hi == b.hi && a.lo == b.lo;
111}
112
113struct msr msr_shl(const struct msr a, const uint8_t bits) {
114 struct msr ret;
115
116 ret.hi = bits < 32 ? a.hi << bits : 0;
117 ret.lo = bits < 32 ? a.lo << bits : 0;
118
119 if (bits < 32)
120 ret.hi |= bits ? a.lo >> (32 - bits) : 0;
121 else
122 ret.hi |= a.lo << (bits - 32);
123
124 return ret;
125}
126
127struct msr msr_shr(const struct msr a, const uint8_t bits) {
128 struct msr ret;
129
130 ret.hi = bits < 32 ? a.hi >> bits : 0;
131 ret.lo = bits < 32 ? a.lo >> bits : 0;
132
133 if (bits < 32)
134 ret.lo |= bits ? a.hi << (32 - bits) : 0;
135 else
136 ret.lo |= a.hi >> (bits - 32);
137
138 return ret;
139}
140
141void msr_and(struct msr *a, const struct msr b) {
142 a->hi &= b.hi;
143 a->lo &= b.lo;
144}
145
146const struct msrdef *findmsrdef(const uint32_t addr) {
147 uint8_t t;
148 const struct msrdef *m;
149 if (!targets)
150 return NULL;
151 for (t = 0; t < targets_found; t++)
152 for (m = targets[t]->msrs; !MSR_ISEOT(*m); m++)
153 if (addr == m->addr)
154 return m;
155 return NULL;
156}
157
Marc Jones8f210762009-03-08 04:37:39 +0000158uint32_t msraddrbyname(const char *name) {
Peter Stuge3108a122009-01-26 17:18:31 +0000159 uint8_t t;
160 const uint32_t addr = strtoul(name, NULL, 16);
161 const struct msrdef *m;
162 if (!targets)
Peter Stuge5f28c092009-03-23 17:43:12 +0000163 return addr;
Peter Stuge3108a122009-01-26 17:18:31 +0000164 for (t = 0; t < targets_found; t++)
165 for (m = targets[t]->msrs; !MSR_ISEOT(*m); m++) {
166 if (addr == m->addr)
167 return m->addr;
168 if (!strcasecmp(name, m->symbol))
169 return m->addr;
170 }
Peter Stuge5f28c092009-03-23 17:43:12 +0000171 return addr;
Peter Stuge3108a122009-01-26 17:18:31 +0000172}
173
Peter Stugedad1e302008-11-22 17:13:36 +0000174void dumpmsrdefs(const struct targetdef *t) {
175 const struct msrdef *m;
176 const struct msrbits *mb;
Peter Stugecc9db9d2008-11-22 18:29:44 +0000177 if (NULL == t)
Peter Stugedad1e302008-11-22 17:13:36 +0000178 return;
179 printf("# %s MSRs:\n", t->name);
180 for (m = t->msrs; !MSR_ISEOT(*m); m++) {
181 if (t->msrs != m)
182 printf("\n");
183 printf("# %s\n", m->symbol);
184 for (mb = m->bits; mb->size; mb++)
185 print_bitdef(stdout, mb, "\n");
186 printf("0x%08x\n", m->addr);
187 }
188}
189
190int dumpmsrdefsvals(FILE *f, const struct targetdef *t, const uint8_t cpu) {
191 struct msr val = MSR1(0);
192 const struct msrdef *m;
193 const struct msrbits *mb;
Peter Stugecc9db9d2008-11-22 18:29:44 +0000194 if (NULL == t)
Peter Stugedad1e302008-11-22 17:13:36 +0000195 return 1;
196 fprintf(f, "# %s MSRs:\n", t->name);
197 for (m = t->msrs; !MSR_ISEOT(*m); m++) {
198 if (t->msrs != m)
199 fprintf(f, "\n");
200 if (!sys->rdmsr(cpu, m->addr, &val))
201 return 1;
202 fprintf(f, "# %s\n", m->symbol);
203 for (mb = m->bits; mb->size; mb++)
204 print_bitdef(f, mb, "\n");
205 fprintf(f, "0x%08x 0x%08x%08x\n", m->addr, val.hi, val.lo);
206 }
207 return 0;
208}
209
210/**
211 * Parse a hexadecimal string into an MSR value.
Uwe Hermann708ccac2009-04-10 21:05:56 +0000212 *
Peter Stugedad1e302008-11-22 17:13:36 +0000213 * Leading 0x or 0X is optional, the string is always parsed as hexadecimal.
Peter Stuge34f29072010-01-17 18:33:53 +0000214 * Any non-hexadecimal character except ' ' can separate the high 32 bits and
Peter Stugedad1e302008-11-22 17:13:36 +0000215 * the low 32 bits. If there is such a separator, high and low values do not
216 * need to be zero padded. If there is no separator, the last <=8 digits are
217 * the low 32 bits and any characters before them are the high 32 bits.
218 * When there is no separator and less than eight digits, the high 32 bits
219 * are set to 0.
220 * Parsing fails when there is a separator and it is followed by another
221 * non-hexadecimal character.
222 *
223 * @param str The string to parse. The string must be writable but will be
224 * restored before return.
225 * @param msr Pointer to the struct msr where the value will be stored.
Paul Menzel85bb83a2010-01-17 21:59:27 +0000226 * @param endptr If endptr is not NULL, *endptr will point to after the MSR.
Peter Stugedad1e302008-11-22 17:13:36 +0000227 * @return 1 on success, 0 on parse failure. msr is unchanged on failure.
228 */
Peter Stuge34f29072010-01-17 18:33:53 +0000229uint8_t str2msr(char *str, struct msr *msr, char **endptr) {
Peter Stugedad1e302008-11-22 17:13:36 +0000230 char c;
231 size_t len, lo;
232 if (0 == strncmp(str, "0x", 2) || 0 == strncmp(str, "0X", 2))
233 str += 2;
234 len = strspn(str, HEXCHARS);
Peter Stuge34f29072010-01-17 18:33:53 +0000235 if (len <= 8 && (0 == str[len] || ' ' == str[len])) {
Peter Stugedad1e302008-11-22 17:13:36 +0000236 msr->hi = 0;
237 lo = 0;
238 } else if (len <= 8) {
239 lo = len + strcspn(str + len, HEXCHARS);
240 if (0 == len && 0 == strspn(str + lo, HEXCHARS))
241 return 0;
242 c = str[len];
243 str[len] = 0;
244 msr->hi = strtoul(str, NULL, 16);
245 str[len] = c;
246 } else {
247 lo = len - 8;
248 c = str[lo];
249 str[lo] = 0;
250 msr->hi = strtoul(str, NULL, 16);
251 str[lo] = c;
252 }
Peter Stuge34f29072010-01-17 18:33:53 +0000253 msr->lo = strtoul(str + lo, endptr, 16);
Peter Stugedad1e302008-11-22 17:13:36 +0000254 return 1;
255}
256
257void decodemsr(const uint8_t cpu, const uint32_t addr, const struct msr val) {
258 struct msr bitval, mask;
259 const struct msrdef *m = findmsrdef(addr);
260 const struct msrbits *mb;
261
Peter Stugecc9db9d2008-11-22 18:29:44 +0000262 if (NULL != m)
Peter Stugedad1e302008-11-22 17:13:36 +0000263 printf("# %s ", m->symbol);
264 printf("0x%08x = 0x%08x%08x\n", addr, val.hi, val.lo);
Peter Stugecc9db9d2008-11-22 18:29:44 +0000265 if (NULL == m) {
Peter Stugedad1e302008-11-22 17:13:36 +0000266 fprintf(stderr, "Sorry - no definition exists for this MSR! Please add it and send a signed-off\n");
267 fprintf(stderr, "patch to coreboot@coreboot.org. Thanks for your help!\n");
268 return;
269 }
270
271 for (mb = m->bits; mb->size; mb++) {
272 if (!reserved && 0 == strcmp(mb->name, "RSVD"))
273 continue;
274 print_bitdef(stdout, mb, " = ");
275 mask.hi = mask.lo = 0xffffffff;
276 mask = msr_shr(mask, 64 - mb->size);
277 bitval = msr_shr(val, mb->start - mb->size + 1);
278 msr_and(&bitval, mask);
279 print_bitval(stdout, mb, bitval);
280 }
281}
282
283/**
284 * Compare two MSR values and print any differences with field definitions and
285 * both old and new values decoded.
286 *
287 * @param f Output stream.
288 * @param addr MSR address.
289 * @param a Left value.
290 * @param b Right value.
291 * @return 1 when a and b differ, 0 when they are equal or only reserved bits
292 * differ and processing of reserved bits was not requested (with -r).
293 */
294uint8_t diff_msr(FILE *f, const uint32_t addr, const struct msr a, const struct msr b) {
295 uint8_t ret = 0, first = 1;
296 struct msr aval, bval, mask;
297 const struct msrdef *m = findmsrdef(addr);
298 const struct msrbits *mb;
299
300 if (a.hi == b.hi && a.lo == b.lo)
301 return 0;
302
Peter Stugecc9db9d2008-11-22 18:29:44 +0000303 if (NULL == m) {
Peter Stugedad1e302008-11-22 17:13:36 +0000304 fprintf(stderr, "MSR 0x%08x has no definition! Please add it and send a Signed-off-by patch\n", addr);
305 fprintf(stderr, "to coreboot@coreboot.org. Thank you for your help!\n");
306 return 1;
307 }
308
309 for (mb = m->bits; mb->size; mb++) {
310 if (!reserved && 0 == strcmp(mb->name, "RSVD"))
311 continue;
312 mask.hi = mask.lo = 0xffffffff;
313 mask = msr_shr(mask, 64 - mb->size);
314 aval = msr_shr(a, mb->start - mb->size + 1);
315 bval = msr_shr(b, mb->start - mb->size + 1);
316 msr_and(&aval, mask);
317 msr_and(&bval, mask);
318 if (msr_eq(aval, bval))
319 continue;
320 if (first) {
321 fprintf(f, "# %s\n", m->symbol);
322 fprintf(f, "-0x%08x 0x%08x%08x\n", addr, a.hi, a.lo);
323 fprintf(f, "+0x%08x 0x%08x%08x\n", addr, b.hi, b.lo);
324 first = 0;
325 ret = 1;
326 }
327 print_bitdef(f, mb, "\n-");
328 print_bitval(f, mb, aval);
329 fprintf(f, "+");
330 print_bitval(f, mb, bval);
331 }
332 return ret;
333}