Commit | Line | Data |
---|---|---|
5d5314d6 JW |
1 | /* |
2 | * Kernel Debugger Architecture Independent Console I/O handler | |
3 | * | |
4 | * This file is subject to the terms and conditions of the GNU General Public | |
5 | * License. See the file "COPYING" in the main directory of this archive | |
6 | * for more details. | |
7 | * | |
8 | * Copyright (c) 1999-2006 Silicon Graphics, Inc. All Rights Reserved. | |
9 | * Copyright (c) 2009 Wind River Systems, Inc. All Rights Reserved. | |
10 | */ | |
11 | ||
5d5314d6 JW |
12 | #include <linux/types.h> |
13 | #include <linux/ctype.h> | |
14 | #include <linux/kernel.h> | |
15 | #include <linux/init.h> | |
16 | #include <linux/kdev_t.h> | |
17 | #include <linux/console.h> | |
18 | #include <linux/string.h> | |
19 | #include <linux/sched.h> | |
20 | #include <linux/smp.h> | |
21 | #include <linux/nmi.h> | |
22 | #include <linux/delay.h> | |
a0de055c | 23 | #include <linux/kgdb.h> |
5d5314d6 JW |
24 | #include <linux/kdb.h> |
25 | #include <linux/kallsyms.h> | |
26 | #include "kdb_private.h" | |
27 | ||
28 | #define CMD_BUFLEN 256 | |
29 | char kdb_prompt_str[CMD_BUFLEN]; | |
30 | ||
d37d39ae | 31 | int kdb_trap_printk; |
34aaff40 | 32 | int kdb_printf_cpu = -1; |
5d5314d6 | 33 | |
37f86b46 | 34 | static int kgdb_transition_check(char *buffer) |
5d5314d6 | 35 | { |
37f86b46 | 36 | if (buffer[0] != '+' && buffer[0] != '$') { |
5d5314d6 JW |
37 | KDB_STATE_SET(KGDB_TRANS); |
38 | kdb_printf("%s", buffer); | |
37f86b46 JW |
39 | } else { |
40 | int slen = strlen(buffer); | |
41 | if (slen > 3 && buffer[slen - 3] == '#') { | |
42 | kdb_gdb_state_pass(buffer); | |
43 | strcpy(buffer, "kgdb"); | |
44 | KDB_STATE_SET(DOING_KGDB); | |
45 | return 1; | |
46 | } | |
5d5314d6 | 47 | } |
37f86b46 | 48 | return 0; |
5d5314d6 JW |
49 | } |
50 | ||
53b63136 DT |
51 | /** |
52 | * kdb_handle_escape() - validity check on an accumulated escape sequence. | |
53 | * @buf: Accumulated escape characters to be examined. Note that buf | |
54 | * is not a string, it is an array of characters and need not be | |
55 | * nil terminated. | |
56 | * @sz: Number of accumulated escape characters. | |
57 | * | |
58 | * Return: -1 if the escape sequence is unwanted, 0 if it is incomplete, | |
59 | * otherwise it returns a mapped key value to pass to the upper layers. | |
60 | */ | |
61 | static int kdb_handle_escape(char *buf, size_t sz) | |
62 | { | |
63 | char *lastkey = buf + sz - 1; | |
64 | ||
65 | switch (sz) { | |
66 | case 1: | |
67 | if (*lastkey == '\e') | |
68 | return 0; | |
69 | break; | |
70 | ||
71 | case 2: /* \e<something> */ | |
72 | if (*lastkey == '[') | |
73 | return 0; | |
74 | break; | |
75 | ||
76 | case 3: | |
77 | switch (*lastkey) { | |
78 | case 'A': /* \e[A, up arrow */ | |
79 | return 16; | |
80 | case 'B': /* \e[B, down arrow */ | |
81 | return 14; | |
82 | case 'C': /* \e[C, right arrow */ | |
83 | return 6; | |
84 | case 'D': /* \e[D, left arrow */ | |
85 | return 2; | |
86 | case '1': /* \e[<1,3,4>], may be home, del, end */ | |
87 | case '3': | |
88 | case '4': | |
89 | return 0; | |
90 | } | |
91 | break; | |
92 | ||
93 | case 4: | |
94 | if (*lastkey == '~') { | |
95 | switch (buf[2]) { | |
96 | case '1': /* \e[1~, home */ | |
97 | return 1; | |
98 | case '3': /* \e[3~, del */ | |
99 | return 4; | |
100 | case '4': /* \e[4~, end */ | |
101 | return 5; | |
102 | } | |
103 | } | |
104 | break; | |
105 | } | |
106 | ||
107 | return -1; | |
108 | } | |
109 | ||
4f27e824 DT |
110 | /** |
111 | * kdb_getchar() - Read a single character from a kdb console (or consoles). | |
112 | * | |
113 | * Other than polling the various consoles that are currently enabled, | |
114 | * most of the work done in this function is dealing with escape sequences. | |
115 | * | |
116 | * An escape key could be the start of a vt100 control sequence such as \e[D | |
117 | * (left arrow) or it could be a character in its own right. The standard | |
118 | * method for detecting the difference is to wait for 2 seconds to see if there | |
119 | * are any other characters. kdb is complicated by the lack of a timer service | |
120 | * (interrupts are off), by multiple input sources. Escape sequence processing | |
121 | * has to be done as states in the polling loop. | |
122 | * | |
123 | * Return: The key pressed or a control code derived from an escape sequence. | |
124 | */ | |
125 | char kdb_getchar(void) | |
5d5314d6 JW |
126 | { |
127 | #define ESCAPE_UDELAY 1000 | |
128 | #define ESCAPE_DELAY (2*1000000/ESCAPE_UDELAY) /* 2 seconds worth of udelays */ | |
cdca8d89 DT |
129 | char buf[4]; /* longest vt100 escape sequence is 4 bytes */ |
130 | char *pbuf = buf; | |
5d5314d6 | 131 | int escape_delay = 0; |
cdca8d89 | 132 | get_char_func *f, *f_prev = NULL; |
5d5314d6 | 133 | int key; |
1ed05558 | 134 | static bool last_char_was_cr; |
5d5314d6 JW |
135 | |
136 | for (f = &kdb_poll_funcs[0]; ; ++f) { | |
137 | if (*f == NULL) { | |
138 | /* Reset NMI watchdog once per poll loop */ | |
139 | touch_nmi_watchdog(); | |
140 | f = &kdb_poll_funcs[0]; | |
141 | } | |
d04213af | 142 | |
5d5314d6 JW |
143 | key = (*f)(); |
144 | if (key == -1) { | |
145 | if (escape_delay) { | |
146 | udelay(ESCAPE_UDELAY); | |
d04213af DT |
147 | if (--escape_delay == 0) |
148 | return '\e'; | |
5d5314d6 JW |
149 | } |
150 | continue; | |
151 | } | |
d04213af | 152 | |
1ed05558 DA |
153 | /* |
154 | * The caller expects that newlines are either CR or LF. However | |
155 | * some terminals send _both_ CR and LF. Avoid having to handle | |
156 | * this in the caller by stripping the LF if we saw a CR right | |
157 | * before. | |
158 | */ | |
159 | if (last_char_was_cr && key == '\n') { | |
160 | last_char_was_cr = false; | |
161 | continue; | |
162 | } | |
163 | last_char_was_cr = (key == '\r'); | |
164 | ||
cdca8d89 DT |
165 | /* |
166 | * When the first character is received (or we get a change | |
167 | * input source) we set ourselves up to handle an escape | |
168 | * sequences (just in case). | |
169 | */ | |
170 | if (f_prev != f) { | |
171 | f_prev = f; | |
172 | pbuf = buf; | |
5d5314d6 | 173 | escape_delay = ESCAPE_DELAY; |
5d5314d6 | 174 | } |
d04213af | 175 | |
cdca8d89 DT |
176 | *pbuf++ = key; |
177 | key = kdb_handle_escape(buf, pbuf - buf); | |
c58ff643 DT |
178 | if (key < 0) /* no escape sequence; return best character */ |
179 | return buf[pbuf - buf == 2 ? 1 : 0]; | |
cdca8d89 DT |
180 | if (key > 0) |
181 | return key; | |
5d5314d6 | 182 | } |
cdca8d89 DT |
183 | |
184 | unreachable(); | |
5d5314d6 JW |
185 | } |
186 | ||
187 | /* | |
188 | * kdb_read | |
189 | * | |
190 | * This function reads a string of characters, terminated by | |
191 | * a newline, or by reaching the end of the supplied buffer, | |
192 | * from the current kernel debugger console device. | |
193 | * Parameters: | |
194 | * buffer - Address of character buffer to receive input characters. | |
195 | * bufsize - size, in bytes, of the character buffer | |
196 | * Returns: | |
197 | * Returns a pointer to the buffer containing the received | |
198 | * character string. This string will be terminated by a | |
199 | * newline character. | |
200 | * Locking: | |
201 | * No locks are required to be held upon entry to this | |
202 | * function. It is not reentrant - it relies on the fact | |
203 | * that while kdb is running on only one "master debug" cpu. | |
204 | * Remarks: | |
4f27e824 | 205 | * The buffer size must be >= 2. |
5d5314d6 JW |
206 | */ |
207 | ||
208 | static char *kdb_read(char *buffer, size_t bufsize) | |
209 | { | |
210 | char *cp = buffer; | |
211 | char *bufend = buffer+bufsize-2; /* Reserve space for newline | |
212 | * and null byte */ | |
213 | char *lastchar; | |
214 | char *p_tmp; | |
215 | char tmp; | |
216 | static char tmpbuffer[CMD_BUFLEN]; | |
217 | int len = strlen(buffer); | |
218 | int len_tmp; | |
219 | int tab = 0; | |
220 | int count; | |
221 | int i; | |
222 | int diag, dtab_count; | |
c2b94c72 | 223 | int key, buf_size, ret; |
5d5314d6 JW |
224 | |
225 | ||
226 | diag = kdbgetintenv("DTABCOUNT", &dtab_count); | |
227 | if (diag) | |
228 | dtab_count = 30; | |
229 | ||
230 | if (len > 0) { | |
231 | cp += len; | |
232 | if (*(buffer+len-1) == '\n') | |
233 | cp--; | |
234 | } | |
235 | ||
236 | lastchar = cp; | |
237 | *cp = '\0'; | |
238 | kdb_printf("%s", buffer); | |
239 | poll_again: | |
4f27e824 | 240 | key = kdb_getchar(); |
5d5314d6 JW |
241 | if (key != 9) |
242 | tab = 0; | |
243 | switch (key) { | |
244 | case 8: /* backspace */ | |
245 | if (cp > buffer) { | |
246 | if (cp < lastchar) { | |
247 | memcpy(tmpbuffer, cp, lastchar - cp); | |
248 | memcpy(cp-1, tmpbuffer, lastchar - cp); | |
249 | } | |
250 | *(--lastchar) = '\0'; | |
251 | --cp; | |
252 | kdb_printf("\b%s \r", cp); | |
253 | tmp = *cp; | |
254 | *cp = '\0'; | |
255 | kdb_printf(kdb_prompt_str); | |
256 | kdb_printf("%s", buffer); | |
257 | *cp = tmp; | |
258 | } | |
259 | break; | |
1ed05558 DA |
260 | case 10: /* linefeed */ |
261 | case 13: /* carriage return */ | |
5d5314d6 JW |
262 | *lastchar++ = '\n'; |
263 | *lastchar++ = '\0'; | |
37f86b46 JW |
264 | if (!KDB_STATE(KGDB_TRANS)) { |
265 | KDB_STATE_SET(KGDB_TRANS); | |
266 | kdb_printf("%s", buffer); | |
267 | } | |
5d5314d6 JW |
268 | kdb_printf("\n"); |
269 | return buffer; | |
270 | case 4: /* Del */ | |
271 | if (cp < lastchar) { | |
272 | memcpy(tmpbuffer, cp+1, lastchar - cp - 1); | |
273 | memcpy(cp, tmpbuffer, lastchar - cp - 1); | |
274 | *(--lastchar) = '\0'; | |
275 | kdb_printf("%s \r", cp); | |
276 | tmp = *cp; | |
277 | *cp = '\0'; | |
278 | kdb_printf(kdb_prompt_str); | |
279 | kdb_printf("%s", buffer); | |
280 | *cp = tmp; | |
281 | } | |
282 | break; | |
283 | case 1: /* Home */ | |
284 | if (cp > buffer) { | |
285 | kdb_printf("\r"); | |
286 | kdb_printf(kdb_prompt_str); | |
287 | cp = buffer; | |
288 | } | |
289 | break; | |
290 | case 5: /* End */ | |
291 | if (cp < lastchar) { | |
292 | kdb_printf("%s", cp); | |
293 | cp = lastchar; | |
294 | } | |
295 | break; | |
296 | case 2: /* Left */ | |
297 | if (cp > buffer) { | |
298 | kdb_printf("\b"); | |
299 | --cp; | |
300 | } | |
301 | break; | |
302 | case 14: /* Down */ | |
303 | memset(tmpbuffer, ' ', | |
304 | strlen(kdb_prompt_str) + (lastchar-buffer)); | |
305 | *(tmpbuffer+strlen(kdb_prompt_str) + | |
306 | (lastchar-buffer)) = '\0'; | |
307 | kdb_printf("\r%s\r", tmpbuffer); | |
308 | *lastchar = (char)key; | |
309 | *(lastchar+1) = '\0'; | |
310 | return lastchar; | |
311 | case 6: /* Right */ | |
312 | if (cp < lastchar) { | |
313 | kdb_printf("%c", *cp); | |
314 | ++cp; | |
315 | } | |
316 | break; | |
317 | case 16: /* Up */ | |
318 | memset(tmpbuffer, ' ', | |
319 | strlen(kdb_prompt_str) + (lastchar-buffer)); | |
320 | *(tmpbuffer+strlen(kdb_prompt_str) + | |
321 | (lastchar-buffer)) = '\0'; | |
322 | kdb_printf("\r%s\r", tmpbuffer); | |
323 | *lastchar = (char)key; | |
324 | *(lastchar+1) = '\0'; | |
325 | return lastchar; | |
326 | case 9: /* Tab */ | |
327 | if (tab < 2) | |
328 | ++tab; | |
329 | p_tmp = buffer; | |
330 | while (*p_tmp == ' ') | |
331 | p_tmp++; | |
332 | if (p_tmp > cp) | |
333 | break; | |
334 | memcpy(tmpbuffer, p_tmp, cp-p_tmp); | |
335 | *(tmpbuffer + (cp-p_tmp)) = '\0'; | |
336 | p_tmp = strrchr(tmpbuffer, ' '); | |
337 | if (p_tmp) | |
338 | ++p_tmp; | |
339 | else | |
340 | p_tmp = tmpbuffer; | |
341 | len = strlen(p_tmp); | |
c2b94c72 PB |
342 | buf_size = sizeof(tmpbuffer) - (p_tmp - tmpbuffer); |
343 | count = kallsyms_symbol_complete(p_tmp, buf_size); | |
5d5314d6 JW |
344 | if (tab == 2 && count > 0) { |
345 | kdb_printf("\n%d symbols are found.", count); | |
346 | if (count > dtab_count) { | |
347 | count = dtab_count; | |
348 | kdb_printf(" But only first %d symbols will" | |
349 | " be printed.\nYou can change the" | |
350 | " environment variable DTABCOUNT.", | |
351 | count); | |
352 | } | |
353 | kdb_printf("\n"); | |
354 | for (i = 0; i < count; i++) { | |
c2b94c72 PB |
355 | ret = kallsyms_symbol_next(p_tmp, i, buf_size); |
356 | if (WARN_ON(!ret)) | |
5d5314d6 | 357 | break; |
c2b94c72 PB |
358 | if (ret != -E2BIG) |
359 | kdb_printf("%s ", p_tmp); | |
360 | else | |
361 | kdb_printf("%s... ", p_tmp); | |
5d5314d6 JW |
362 | *(p_tmp + len) = '\0'; |
363 | } | |
364 | if (i >= dtab_count) | |
365 | kdb_printf("..."); | |
366 | kdb_printf("\n"); | |
367 | kdb_printf(kdb_prompt_str); | |
368 | kdb_printf("%s", buffer); | |
369 | } else if (tab != 2 && count > 0) { | |
370 | len_tmp = strlen(p_tmp); | |
371 | strncpy(p_tmp+len_tmp, cp, lastchar-cp+1); | |
372 | len_tmp = strlen(p_tmp); | |
373 | strncpy(cp, p_tmp+len, len_tmp-len + 1); | |
374 | len = len_tmp - len; | |
375 | kdb_printf("%s", cp); | |
376 | cp += len; | |
377 | lastchar += len; | |
378 | } | |
379 | kdb_nextline = 1; /* reset output line number */ | |
380 | break; | |
381 | default: | |
382 | if (key >= 32 && lastchar < bufend) { | |
383 | if (cp < lastchar) { | |
384 | memcpy(tmpbuffer, cp, lastchar - cp); | |
385 | memcpy(cp+1, tmpbuffer, lastchar - cp); | |
386 | *++lastchar = '\0'; | |
387 | *cp = key; | |
388 | kdb_printf("%s\r", cp); | |
389 | ++cp; | |
390 | tmp = *cp; | |
391 | *cp = '\0'; | |
392 | kdb_printf(kdb_prompt_str); | |
393 | kdb_printf("%s", buffer); | |
394 | *cp = tmp; | |
395 | } else { | |
396 | *++lastchar = '\0'; | |
397 | *cp++ = key; | |
398 | /* The kgdb transition check will hide | |
399 | * printed characters if we think that | |
400 | * kgdb is connecting, until the check | |
401 | * fails */ | |
37f86b46 JW |
402 | if (!KDB_STATE(KGDB_TRANS)) { |
403 | if (kgdb_transition_check(buffer)) | |
404 | return buffer; | |
405 | } else { | |
5d5314d6 | 406 | kdb_printf("%c", key); |
37f86b46 | 407 | } |
5d5314d6 JW |
408 | } |
409 | /* Special escape to kgdb */ | |
410 | if (lastchar - buffer >= 5 && | |
411 | strcmp(lastchar - 5, "$?#3f") == 0) { | |
f679c498 | 412 | kdb_gdb_state_pass(lastchar - 5); |
5d5314d6 JW |
413 | strcpy(buffer, "kgdb"); |
414 | KDB_STATE_SET(DOING_KGDB); | |
415 | return buffer; | |
416 | } | |
f679c498 JW |
417 | if (lastchar - buffer >= 11 && |
418 | strcmp(lastchar - 11, "$qSupported") == 0) { | |
419 | kdb_gdb_state_pass(lastchar - 11); | |
5d5314d6 | 420 | strcpy(buffer, "kgdb"); |
d613d828 | 421 | KDB_STATE_SET(DOING_KGDB); |
5d5314d6 JW |
422 | return buffer; |
423 | } | |
424 | } | |
425 | break; | |
426 | } | |
427 | goto poll_again; | |
428 | } | |
429 | ||
430 | /* | |
431 | * kdb_getstr | |
432 | * | |
433 | * Print the prompt string and read a command from the | |
434 | * input device. | |
435 | * | |
436 | * Parameters: | |
437 | * buffer Address of buffer to receive command | |
438 | * bufsize Size of buffer in bytes | |
439 | * prompt Pointer to string to use as prompt string | |
440 | * Returns: | |
441 | * Pointer to command buffer. | |
442 | * Locking: | |
443 | * None. | |
444 | * Remarks: | |
445 | * For SMP kernels, the processor number will be | |
446 | * substituted for %d, %x or %o in the prompt. | |
447 | */ | |
448 | ||
32d375f6 | 449 | char *kdb_getstr(char *buffer, size_t bufsize, const char *prompt) |
5d5314d6 JW |
450 | { |
451 | if (prompt && kdb_prompt_str != prompt) | |
ca976bfb | 452 | strscpy(kdb_prompt_str, prompt, CMD_BUFLEN); |
5d5314d6 JW |
453 | kdb_printf(kdb_prompt_str); |
454 | kdb_nextline = 1; /* Prompt and input resets line number */ | |
455 | return kdb_read(buffer, bufsize); | |
456 | } | |
457 | ||
458 | /* | |
459 | * kdb_input_flush | |
460 | * | |
461 | * Get rid of any buffered console input. | |
462 | * | |
463 | * Parameters: | |
464 | * none | |
465 | * Returns: | |
466 | * nothing | |
467 | * Locking: | |
468 | * none | |
469 | * Remarks: | |
470 | * Call this function whenever you want to flush input. If there is any | |
471 | * outstanding input, it ignores all characters until there has been no | |
472 | * data for approximately 1ms. | |
473 | */ | |
474 | ||
475 | static void kdb_input_flush(void) | |
476 | { | |
477 | get_char_func *f; | |
478 | int res; | |
479 | int flush_delay = 1; | |
480 | while (flush_delay) { | |
481 | flush_delay--; | |
482 | empty: | |
483 | touch_nmi_watchdog(); | |
484 | for (f = &kdb_poll_funcs[0]; *f; ++f) { | |
485 | res = (*f)(); | |
486 | if (res != -1) { | |
487 | flush_delay = 1; | |
488 | goto empty; | |
489 | } | |
490 | } | |
491 | if (flush_delay) | |
492 | mdelay(1); | |
493 | } | |
494 | } | |
495 | ||
496 | /* | |
497 | * kdb_printf | |
498 | * | |
499 | * Print a string to the output device(s). | |
500 | * | |
501 | * Parameters: | |
502 | * printf-like format and optional args. | |
503 | * Returns: | |
504 | * 0 | |
505 | * Locking: | |
506 | * None. | |
507 | * Remarks: | |
508 | * use 'kdbcons->write()' to avoid polluting 'log_buf' with | |
509 | * kdb output. | |
510 | * | |
511 | * If the user is doing a cmd args | grep srch | |
512 | * then kdb_grepping_flag is set. | |
513 | * In that case we need to accumulate full lines (ending in \n) before | |
514 | * searching for the pattern. | |
515 | */ | |
516 | ||
517 | static char kdb_buffer[256]; /* A bit too big to go on stack */ | |
518 | static char *next_avail = kdb_buffer; | |
519 | static int size_avail; | |
520 | static int suspend_grep; | |
521 | ||
522 | /* | |
523 | * search arg1 to see if it contains arg2 | |
524 | * (kdmain.c provides flags for ^pat and pat$) | |
525 | * | |
526 | * return 1 for found, 0 for not found | |
527 | */ | |
528 | static int kdb_search_string(char *searched, char *searchfor) | |
529 | { | |
530 | char firstchar, *cp; | |
531 | int len1, len2; | |
532 | ||
533 | /* not counting the newline at the end of "searched" */ | |
534 | len1 = strlen(searched)-1; | |
535 | len2 = strlen(searchfor); | |
536 | if (len1 < len2) | |
537 | return 0; | |
538 | if (kdb_grep_leading && kdb_grep_trailing && len1 != len2) | |
539 | return 0; | |
540 | if (kdb_grep_leading) { | |
541 | if (!strncmp(searched, searchfor, len2)) | |
542 | return 1; | |
543 | } else if (kdb_grep_trailing) { | |
544 | if (!strncmp(searched+len1-len2, searchfor, len2)) | |
545 | return 1; | |
546 | } else { | |
547 | firstchar = *searchfor; | |
548 | cp = searched; | |
549 | while ((cp = strchr(cp, firstchar))) { | |
550 | if (!strncmp(cp, searchfor, len2)) | |
551 | return 1; | |
552 | cp++; | |
553 | } | |
554 | } | |
555 | return 0; | |
556 | } | |
557 | ||
9d71b344 SG |
558 | static void kdb_msg_write(const char *msg, int msg_len) |
559 | { | |
560 | struct console *c; | |
fcdb84cc | 561 | const char *cp; |
b8ef04be | 562 | int cookie; |
fcdb84cc | 563 | int len; |
9d71b344 SG |
564 | |
565 | if (msg_len == 0) | |
566 | return; | |
567 | ||
fcdb84cc CC |
568 | cp = msg; |
569 | len = msg_len; | |
9d71b344 | 570 | |
fcdb84cc CC |
571 | while (len--) { |
572 | dbg_io_ops->write_char(*cp); | |
573 | cp++; | |
9d71b344 SG |
574 | } |
575 | ||
b8ef04be JO |
576 | /* |
577 | * The console_srcu_read_lock() only provides safe console list | |
578 | * traversal. The use of the ->write() callback relies on all other | |
579 | * CPUs being stopped at the moment and console drivers being able to | |
580 | * handle reentrance when @oops_in_progress is set. | |
581 | * | |
582 | * There is no guarantee that every console driver can handle | |
583 | * reentrance in this way; the developer deploying the debugger | |
584 | * is responsible for ensuring that the console drivers they | |
585 | * have selected handle reentrance appropriately. | |
586 | */ | |
587 | cookie = console_srcu_read_lock(); | |
588 | for_each_console_srcu(c) { | |
589 | if (!(console_srcu_read_flags(c) & CON_ENABLED)) | |
e8857288 | 590 | continue; |
5946d1f5 SG |
591 | if (c == dbg_io_ops->cons) |
592 | continue; | |
2a78b85b SG |
593 | /* |
594 | * Set oops_in_progress to encourage the console drivers to | |
595 | * disregard their internal spin locks: in the current calling | |
596 | * context the risk of deadlock is a bigger problem than risks | |
597 | * due to re-entering the console driver. We operate directly on | |
598 | * oops_in_progress rather than using bust_spinlocks() because | |
599 | * the calls bust_spinlocks() makes on exit are not appropriate | |
600 | * for this calling context. | |
601 | */ | |
602 | ++oops_in_progress; | |
9d71b344 | 603 | c->write(c, msg, msg_len); |
2a78b85b | 604 | --oops_in_progress; |
9d71b344 SG |
605 | touch_nmi_watchdog(); |
606 | } | |
b8ef04be | 607 | console_srcu_read_unlock(cookie); |
9d71b344 SG |
608 | } |
609 | ||
f7d4ca8b | 610 | int vkdb_printf(enum kdb_msgsrc src, const char *fmt, va_list ap) |
5d5314d6 | 611 | { |
5d5314d6 JW |
612 | int diag; |
613 | int linecount; | |
17b572e8 | 614 | int colcount; |
5d5314d6 | 615 | int logging, saved_loglevel = 0; |
5d5314d6 JW |
616 | int retlen = 0; |
617 | int fnd, len; | |
d5d8d3d0 | 618 | int this_cpu, old_cpu; |
5d5314d6 JW |
619 | char *cp, *cp2, *cphold = NULL, replaced_byte = ' '; |
620 | char *moreprompt = "more> "; | |
3f649ab7 | 621 | unsigned long flags; |
5d5314d6 | 622 | |
5d5314d6 JW |
623 | /* Serialize kdb_printf if multiple cpus try to write at once. |
624 | * But if any cpu goes recursive in kdb, just print the output, | |
625 | * even if it is interleaved with any other text. | |
626 | */ | |
34aaff40 | 627 | local_irq_save(flags); |
d5d8d3d0 PM |
628 | this_cpu = smp_processor_id(); |
629 | for (;;) { | |
630 | old_cpu = cmpxchg(&kdb_printf_cpu, -1, this_cpu); | |
631 | if (old_cpu == -1 || old_cpu == this_cpu) | |
632 | break; | |
633 | ||
634 | cpu_relax(); | |
5d5314d6 JW |
635 | } |
636 | ||
637 | diag = kdbgetintenv("LINES", &linecount); | |
638 | if (diag || linecount <= 1) | |
639 | linecount = 24; | |
640 | ||
17b572e8 JW |
641 | diag = kdbgetintenv("COLUMNS", &colcount); |
642 | if (diag || colcount <= 1) | |
643 | colcount = 80; | |
644 | ||
5d5314d6 JW |
645 | diag = kdbgetintenv("LOGGING", &logging); |
646 | if (diag) | |
647 | logging = 0; | |
648 | ||
649 | if (!kdb_grepping_flag || suspend_grep) { | |
650 | /* normally, every vsnprintf starts a new buffer */ | |
651 | next_avail = kdb_buffer; | |
652 | size_avail = sizeof(kdb_buffer); | |
653 | } | |
5d5314d6 | 654 | vsnprintf(next_avail, size_avail, fmt, ap); |
5d5314d6 JW |
655 | |
656 | /* | |
657 | * If kdb_parse() found that the command was cmd xxx | grep yyy | |
658 | * then kdb_grepping_flag is set, and kdb_grep_string contains yyy | |
659 | * | |
660 | * Accumulate the print data up to a newline before searching it. | |
661 | * (vsnprintf does null-terminate the string that it generates) | |
662 | */ | |
663 | ||
664 | /* skip the search if prints are temporarily unconditional */ | |
665 | if (!suspend_grep && kdb_grepping_flag) { | |
666 | cp = strchr(kdb_buffer, '\n'); | |
667 | if (!cp) { | |
668 | /* | |
669 | * Special cases that don't end with newlines | |
670 | * but should be written without one: | |
671 | * The "[nn]kdb> " prompt should | |
672 | * appear at the front of the buffer. | |
673 | * | |
674 | * The "[nn]more " prompt should also be | |
675 | * (MOREPROMPT -> moreprompt) | |
676 | * written * but we print that ourselves, | |
677 | * we set the suspend_grep flag to make | |
678 | * it unconditional. | |
679 | * | |
680 | */ | |
681 | if (next_avail == kdb_buffer) { | |
682 | /* | |
683 | * these should occur after a newline, | |
684 | * so they will be at the front of the | |
685 | * buffer | |
686 | */ | |
687 | cp2 = kdb_buffer; | |
688 | len = strlen(kdb_prompt_str); | |
689 | if (!strncmp(cp2, kdb_prompt_str, len)) { | |
690 | /* | |
691 | * We're about to start a new | |
692 | * command, so we can go back | |
693 | * to normal mode. | |
694 | */ | |
695 | kdb_grepping_flag = 0; | |
696 | goto kdb_printit; | |
697 | } | |
698 | } | |
699 | /* no newline; don't search/write the buffer | |
700 | until one is there */ | |
701 | len = strlen(kdb_buffer); | |
702 | next_avail = kdb_buffer + len; | |
703 | size_avail = sizeof(kdb_buffer) - len; | |
704 | goto kdb_print_out; | |
705 | } | |
706 | ||
707 | /* | |
708 | * The newline is present; print through it or discard | |
709 | * it, depending on the results of the search. | |
710 | */ | |
711 | cp++; /* to byte after the newline */ | |
712 | replaced_byte = *cp; /* remember what/where it was */ | |
713 | cphold = cp; | |
714 | *cp = '\0'; /* end the string for our search */ | |
715 | ||
716 | /* | |
717 | * We now have a newline at the end of the string | |
718 | * Only continue with this output if it contains the | |
719 | * search string. | |
720 | */ | |
721 | fnd = kdb_search_string(kdb_buffer, kdb_grep_string); | |
722 | if (!fnd) { | |
723 | /* | |
724 | * At this point the complete line at the start | |
725 | * of kdb_buffer can be discarded, as it does | |
726 | * not contain what the user is looking for. | |
727 | * Shift the buffer left. | |
728 | */ | |
729 | *cphold = replaced_byte; | |
730 | strcpy(kdb_buffer, cphold); | |
731 | len = strlen(kdb_buffer); | |
732 | next_avail = kdb_buffer + len; | |
733 | size_avail = sizeof(kdb_buffer) - len; | |
734 | goto kdb_print_out; | |
735 | } | |
d081a6e3 | 736 | if (kdb_grepping_flag >= KDB_GREPPING_FLAG_SEARCH) { |
fb6daa75 DT |
737 | /* |
738 | * This was a interactive search (using '/' at more | |
d081a6e3 DT |
739 | * prompt) and it has completed. Replace the \0 with |
740 | * its original value to ensure multi-line strings | |
741 | * are handled properly, and return to normal mode. | |
fb6daa75 | 742 | */ |
d081a6e3 | 743 | *cphold = replaced_byte; |
fb6daa75 | 744 | kdb_grepping_flag = 0; |
d081a6e3 | 745 | } |
5d5314d6 JW |
746 | /* |
747 | * at this point the string is a full line and | |
748 | * should be printed, up to the null. | |
749 | */ | |
750 | } | |
751 | kdb_printit: | |
752 | ||
753 | /* | |
754 | * Write to all consoles. | |
755 | */ | |
756 | retlen = strlen(kdb_buffer); | |
49795757 | 757 | cp = (char *) printk_skip_headers(kdb_buffer); |
9d71b344 | 758 | if (!dbg_kdb_mode && kgdb_connected) |
f7d4ca8b | 759 | gdbstub_msg_write(cp, retlen - (cp - kdb_buffer)); |
9d71b344 SG |
760 | else |
761 | kdb_msg_write(cp, retlen - (cp - kdb_buffer)); | |
762 | ||
5d5314d6 JW |
763 | if (logging) { |
764 | saved_loglevel = console_loglevel; | |
a8fe19eb | 765 | console_loglevel = CONSOLE_LOGLEVEL_SILENT; |
f7d4ca8b DT |
766 | if (printk_get_level(kdb_buffer) || src == KDB_MSGSRC_PRINTK) |
767 | printk("%s", kdb_buffer); | |
768 | else | |
769 | pr_info("%s", kdb_buffer); | |
5d5314d6 JW |
770 | } |
771 | ||
17b572e8 JW |
772 | if (KDB_STATE(PAGER)) { |
773 | /* | |
774 | * Check printed string to decide how to bump the | |
775 | * kdb_nextline to control when the more prompt should | |
776 | * show up. | |
777 | */ | |
778 | int got = 0; | |
779 | len = retlen; | |
780 | while (len--) { | |
781 | if (kdb_buffer[len] == '\n') { | |
782 | kdb_nextline++; | |
783 | got = 0; | |
784 | } else if (kdb_buffer[len] == '\r') { | |
785 | got = 0; | |
786 | } else { | |
787 | got++; | |
788 | } | |
789 | } | |
790 | kdb_nextline += got / (colcount + 1); | |
791 | } | |
5d5314d6 JW |
792 | |
793 | /* check for having reached the LINES number of printed lines */ | |
17b572e8 | 794 | if (kdb_nextline >= linecount) { |
4f27e824 | 795 | char ch; |
5d5314d6 JW |
796 | |
797 | /* Watch out for recursion here. Any routine that calls | |
798 | * kdb_printf will come back through here. And kdb_read | |
799 | * uses kdb_printf to echo on serial consoles ... | |
800 | */ | |
801 | kdb_nextline = 1; /* In case of recursion */ | |
802 | ||
803 | /* | |
804 | * Pause until cr. | |
805 | */ | |
806 | moreprompt = kdbgetenv("MOREPROMPT"); | |
807 | if (moreprompt == NULL) | |
808 | moreprompt = "more> "; | |
809 | ||
5d5314d6 | 810 | kdb_input_flush(); |
9d71b344 | 811 | kdb_msg_write(moreprompt, strlen(moreprompt)); |
5d5314d6 JW |
812 | |
813 | if (logging) | |
814 | printk("%s", moreprompt); | |
815 | ||
4f27e824 | 816 | ch = kdb_getchar(); |
5d5314d6 JW |
817 | kdb_nextline = 1; /* Really set output line 1 */ |
818 | ||
819 | /* empty and reset the buffer: */ | |
820 | kdb_buffer[0] = '\0'; | |
821 | next_avail = kdb_buffer; | |
822 | size_avail = sizeof(kdb_buffer); | |
4f27e824 | 823 | if ((ch == 'q') || (ch == 'Q')) { |
5d5314d6 JW |
824 | /* user hit q or Q */ |
825 | KDB_FLAG_SET(CMD_INTERRUPT); /* command interrupted */ | |
826 | KDB_STATE_CLEAR(PAGER); | |
827 | /* end of command output; back to normal mode */ | |
828 | kdb_grepping_flag = 0; | |
829 | kdb_printf("\n"); | |
4f27e824 | 830 | } else if (ch == ' ') { |
17b572e8 | 831 | kdb_printf("\r"); |
5d5314d6 | 832 | suspend_grep = 1; /* for this recursion */ |
4f27e824 | 833 | } else if (ch == '\n' || ch == '\r') { |
5d5314d6 JW |
834 | kdb_nextline = linecount - 1; |
835 | kdb_printf("\r"); | |
836 | suspend_grep = 1; /* for this recursion */ | |
4f27e824 | 837 | } else if (ch == '/' && !kdb_grepping_flag) { |
fb6daa75 DT |
838 | kdb_printf("\r"); |
839 | kdb_getstr(kdb_grep_string, KDB_GREP_STRLEN, | |
840 | kdbgetenv("SEARCHPROMPT") ?: "search> "); | |
841 | *strchrnul(kdb_grep_string, '\n') = '\0'; | |
842 | kdb_grepping_flag += KDB_GREPPING_FLAG_SEARCH; | |
843 | suspend_grep = 1; /* for this recursion */ | |
4f27e824 DT |
844 | } else if (ch) { |
845 | /* user hit something unexpected */ | |
5d5314d6 | 846 | suspend_grep = 1; /* for this recursion */ |
4f27e824 | 847 | if (ch != '/') |
fb6daa75 DT |
848 | kdb_printf( |
849 | "\nOnly 'q', 'Q' or '/' are processed at " | |
850 | "more prompt, input ignored\n"); | |
851 | else | |
852 | kdb_printf("\n'/' cannot be used during | " | |
853 | "grep filtering, input ignored\n"); | |
5d5314d6 JW |
854 | } else if (kdb_grepping_flag) { |
855 | /* user hit enter */ | |
856 | suspend_grep = 1; /* for this recursion */ | |
857 | kdb_printf("\n"); | |
858 | } | |
859 | kdb_input_flush(); | |
860 | } | |
861 | ||
862 | /* | |
863 | * For grep searches, shift the printed string left. | |
864 | * replaced_byte contains the character that was overwritten with | |
865 | * the terminating null, and cphold points to the null. | |
866 | * Then adjust the notion of available space in the buffer. | |
867 | */ | |
868 | if (kdb_grepping_flag && !suspend_grep) { | |
869 | *cphold = replaced_byte; | |
870 | strcpy(kdb_buffer, cphold); | |
871 | len = strlen(kdb_buffer); | |
872 | next_avail = kdb_buffer + len; | |
873 | size_avail = sizeof(kdb_buffer) - len; | |
874 | } | |
875 | ||
876 | kdb_print_out: | |
877 | suspend_grep = 0; /* end of what may have been a recursive call */ | |
878 | if (logging) | |
879 | console_loglevel = saved_loglevel; | |
d5d8d3d0 PM |
880 | /* kdb_printf_cpu locked the code above. */ |
881 | smp_store_release(&kdb_printf_cpu, old_cpu); | |
d5d8d3d0 | 882 | local_irq_restore(flags); |
5d5314d6 JW |
883 | return retlen; |
884 | } | |
d37d39ae JW |
885 | |
886 | int kdb_printf(const char *fmt, ...) | |
887 | { | |
888 | va_list ap; | |
889 | int r; | |
890 | ||
891 | va_start(ap, fmt); | |
f7d4ca8b | 892 | r = vkdb_printf(KDB_MSGSRC_INTERNAL, fmt, ap); |
d37d39ae JW |
893 | va_end(ap); |
894 | ||
895 | return r; | |
896 | } | |
f7030bbc | 897 | EXPORT_SYMBOL_GPL(kdb_printf); |