1 /*
2  * Copyright (c) 2021 Omar Polo <op@omarpolo.com>
3  *
4  * Permission to use, copy, modify, and distribute this software for any
5  * purpose with or without fee is hereby granted, provided that the above
6  * copyright notice and this permission notice appear in all copies.
7  *
8  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
15  */
16 
17 #include <limits.h>
18 #include <stdlib.h>
19 #include <string.h>
20 
21 #include "compl.h"
22 #include "defaults.h"
23 #include "minibuffer.h"
24 #include "telescope.h"
25 #include "ui.h"
26 #include "utf8.h"
27 
28 #define GUARD_RECURSIVE_MINIBUFFER()				\
29 	do {							\
30 		if (in_minibuffer) {				\
31 			message("enable-recursive-minibuffers " \
32 			    "is not yet available.");		\
33 			return;					\
34 		}						\
35 	} while(0)
36 
37 /* return 1 if moved, 0 otherwise */
38 static inline int
39 forward_line(struct buffer *buffer, int n)
40 {
41 	struct vline *vl;
42 	int did;
43 
44 	if (buffer->current_line == NULL)
45 		return 0;
46 	vl = buffer->current_line;
47 
48 	did = 0;
49 	while (n != 0) {
50 		if (n > 0) {
51 			vl = TAILQ_NEXT(vl, vlines);
52 			if (vl == NULL)
53 				return did;
54 			if (vl->parent->flags & L_HIDDEN)
55 				continue;
56 			buffer->current_line = vl;
57 			n--;
58 		} else {
59 			vl = TAILQ_PREV(vl, vhead, vlines);
60 			if (vl == NULL)
61 				return did;
62 			if (vl->parent->flags & L_HIDDEN)
63 				continue;
64 			if (buffer->current_line == buffer->top_line) {
65 				buffer->line_off--;
66 				buffer->top_line = vl;
67 			}
68 			buffer->current_line = vl;
69 			n++;
70 		}
71 
72 		did = 1;
73 	}
74 
75 	return did;
76 }
77 
78 void
79 cmd_previous_line(struct buffer *buffer)
80 {
81 	forward_line(buffer, -1);
82 }
83 
84 void
85 cmd_next_line(struct buffer *buffer)
86 {
87 	forward_line(buffer, +1);
88 }
89 
90 void
91 cmd_backward_char(struct buffer *buffer)
92 {
93 	if (buffer->cpoff != 0)
94 		buffer->cpoff--;
95 }
96 
97 void
98 cmd_forward_char(struct buffer *buffer)
99 {
100 	size_t len = 0;
101 
102 	if (buffer->current_line->line != NULL)
103 		len = utf8_cplen(buffer->current_line->line);
104 	if (++buffer->cpoff > len)
105 		buffer->cpoff = len;
106 }
107 
108 void
109 cmd_backward_paragraph(struct buffer *buffer)
110 {
111 	do {
112 		if (!forward_line(buffer, -1)) {
113 			message("No previous paragraph");
114 			return;
115 		}
116 	} while (buffer->current_line->line != NULL ||
117 	    buffer->current_line->parent->type != LINE_TEXT);
118 }
119 
120 void
121 cmd_forward_paragraph(struct buffer *buffer)
122 {
123 	do {
124 		if (!forward_line(buffer, +1)) {
125 			message("No next paragraph");
126 			return;
127 		}
128 	} while (buffer->current_line->line != NULL ||
129 	    buffer->current_line->parent->type != LINE_TEXT);
130 }
131 
132 void
133 cmd_move_beginning_of_line(struct buffer *buffer)
134 {
135 	buffer->cpoff = 0;
136 }
137 
138 void
139 cmd_move_end_of_line(struct buffer *buffer)
140 {
141 	struct vline	*vl;
142 
143 	vl = buffer->current_line;
144 	if (vl->line == NULL)
145 		return;
146 	buffer->cpoff = utf8_cplen(vl->line);
147 }
148 
149 void
150 cmd_redraw(struct buffer *buffer)
151 {
152         ui_schedule_redraw();
153 }
154 
155 void
156 cmd_scroll_line_up(struct buffer *buffer)
157 {
158 	struct vline	*vl;
159 
160 	if ((vl = TAILQ_PREV(buffer->top_line, vhead, vlines))
161 	    == NULL)
162 		return;
163 
164 	forward_line(buffer, -1);
165 
166 	buffer->top_line = vl;
167 }
168 
169 void
170 cmd_scroll_line_down(struct buffer *buffer)
171 {
172 	if (!forward_line(buffer, +1))
173 		return;
174 
175 	buffer->top_line = TAILQ_NEXT(buffer->top_line, vlines);
176 	buffer->line_off++;
177 }
178 
179 void
180 cmd_scroll_up(struct buffer *buffer)
181 {
182 	struct vline	*vl;
183 	int		 i;
184 
185 	for (i = 0; i < body_lines; ++i) {
186 		vl = TAILQ_PREV(buffer->top_line, vhead, vlines);
187 		if (vl == NULL)
188 			break;
189 		buffer->top_line = vl;
190 		forward_line(buffer, -1);
191 	}
192 }
193 
194 void
195 cmd_scroll_down(struct buffer *buffer)
196 {
197 	int i;
198 
199 	for (i = 0; i < body_lines; ++i) {
200 		if (!forward_line(buffer, +1))
201 			break;
202 
203 		buffer->top_line = TAILQ_NEXT(buffer->top_line,
204 		    vlines);
205 	}
206 }
207 
208 void
209 cmd_beginning_of_buffer(struct buffer *buffer)
210 {
211 	buffer->current_line = TAILQ_FIRST(&buffer->head);
212 	buffer->cpoff = 0;
213 	buffer->top_line = buffer->current_line;
214 	buffer->line_off = 0;
215 }
216 
217 void
218 cmd_end_of_buffer(struct buffer *buffer)
219 {
220 	buffer->current_line = TAILQ_LAST(&buffer->head, vhead);
221 	buffer->cpoff = body_cols;
222 }
223 
224 void
225 cmd_kill_telescope(struct buffer *buffer)
226 {
227 	save_session();
228 	event_loopbreak();
229 }
230 
231 void
232 cmd_push_button(struct buffer *buffer)
233 {
234 	struct vline	*vl;
235 	struct line	*l;
236 
237 	vl = buffer->current_line;
238 	switch (vl->parent->type) {
239 	case LINE_LINK:
240 		load_url_in_tab(current_tab, vl->parent->alt);
241 		break;
242 	case LINE_PRE_START:
243 		l = TAILQ_NEXT(vl->parent, lines);
244 		for (; l != NULL; l = TAILQ_NEXT(l, lines)) {
245 			if (l->type == LINE_PRE_END)
246 				break;
247 			l->flags ^= L_HIDDEN;
248 			if (l->flags & L_HIDDEN)
249 				buffer->line_max--;
250 			else
251 				buffer->line_max++;
252 		}
253 		break;
254 	default:
255 		break;
256 	}
257 }
258 
259 void
260 cmd_push_button_new_tab(struct buffer *buffer)
261 {
262 	struct vline	*vl;
263 
264 	vl = buffer->current_line;
265 	if (vl->parent->type != LINE_LINK)
266 		return;
267 
268 	new_tab(vl->parent->alt);
269 }
270 
271 void
272 cmd_previous_button(struct buffer *buffer)
273 {
274 	struct excursion place;
275 
276 	save_excursion(&place, buffer);
277 
278 	do {
279 		if (!forward_line(buffer, -1)) {
280 			restore_excursion(&place, buffer);
281 			message("No previous link");
282 			return;
283 		}
284 	} while (buffer->current_line->parent->type != LINE_LINK);
285 }
286 
287 void
288 cmd_next_button(struct buffer *buffer)
289 {
290 	struct excursion place;
291 
292 	save_excursion(&place, buffer);
293 
294 	do {
295 		if (!forward_line(buffer, +1)){
296 			restore_excursion(&place, buffer);
297 			message("No next link");
298 			return;
299 		}
300 	} while (buffer->current_line->parent->type != LINE_LINK);
301 }
302 
303 static inline int
304 is_heading(const struct line *l)
305 {
306 	return l->type == LINE_TITLE_1 ||
307 		l->type == LINE_TITLE_2 ||
308 		l->type == LINE_TITLE_3;
309 }
310 
311 void
312 cmd_previous_heading(struct buffer *buffer)
313 {
314 	struct excursion place;
315 
316 	save_excursion(&place, buffer);
317 
318 	do {
319 		if (!forward_line(buffer, -1)) {
320 			restore_excursion(&place, buffer);
321 			message("No previous heading");
322 			return;
323 		}
324 	} while (!is_heading(buffer->current_line->parent));
325 }
326 
327 void
328 cmd_next_heading(struct buffer *buffer)
329 {
330 	struct excursion place;
331 
332 	save_excursion(&place, buffer);
333 
334 	do {
335 		if (!forward_line(buffer, +1)) {
336 			restore_excursion(&place, buffer);
337 			message("No next heading");
338 			return;
339 		}
340 	} while (!is_heading(buffer->current_line->parent));
341 }
342 
343 void
344 cmd_previous_page(struct buffer *buffer)
345 {
346 	if (!load_previous_page(current_tab))
347 		message("No previous page");
348 	else
349 		start_loading_anim(current_tab);
350 }
351 
352 void
353 cmd_next_page(struct buffer *buffer)
354 {
355 	if (!load_next_page(current_tab))
356 		message("No next page");
357 	else
358 		start_loading_anim(current_tab);
359 }
360 
361 void
362 cmd_clear_minibuf(struct buffer *buffer)
363 {
364         message(NULL);
365 }
366 
367 void
368 cmd_execute_extended_command(struct buffer *buffer)
369 {
370 	size_t	 len;
371 
372 	GUARD_RECURSIVE_MINIBUFFER();
373 
374 	enter_minibuffer(eecmd_self_insert, eecmd_select, exit_minibuffer,
375 	    &eecmd_history, compl_eecmd, NULL);
376 
377 	len = sizeof(ministate.prompt);
378 	strlcpy(ministate.prompt, "", len);
379 
380 	if (thiskey.meta)
381 		strlcat(ministate.prompt, "M-", len);
382 
383 	strlcat(ministate.prompt, ui_keyname(thiskey.key), len);
384 
385 	if (thiskey.meta)
386 		strlcat(ministate.prompt, " ", len);
387 }
388 
389 void
390 cmd_tab_close(struct buffer *buffer)
391 {
392 	struct tab *tab, *t;
393 
394 	tab = current_tab;
395 	if (TAILQ_PREV(tab, tabshead, tabs) == NULL &&
396 	    TAILQ_NEXT(tab, tabs) == NULL) {
397 		message("Can't close the only tab.");
398 		return;
399 	}
400 
401 	if (evtimer_pending(&tab->loadingev, NULL))
402 		evtimer_del(&tab->loadingev);
403 
404 	stop_tab(tab);
405 
406 	if ((t = TAILQ_PREV(tab, tabshead, tabs)) == NULL)
407 		t = TAILQ_NEXT(tab, tabs);
408 	TAILQ_REMOVE(&tabshead, tab, tabs);
409 	free(tab);
410 
411 	switch_to_tab(t);
412 }
413 
414 void
415 cmd_tab_close_other(struct buffer *buffer)
416 {
417 	struct tab *t, *i;
418 
419 	TAILQ_FOREACH_SAFE(t, &tabshead, tabs, i) {
420 		if (t == current_tab)
421 			continue;
422 
423 		stop_tab(t);
424 		TAILQ_REMOVE(&tabshead, t, tabs);
425 		free(t);
426 	}
427 }
428 
429 void
430 cmd_tab_new(struct buffer *buffer)
431 {
432 	const char *url;
433 
434 	if ((url = new_tab_url) == NULL)
435 		url = NEW_TAB_URL;
436 
437 	new_tab(url);
438 }
439 
440 void
441 cmd_tab_next(struct buffer *buffer)
442 {
443 	struct tab *t;
444 
445 	if ((t = TAILQ_NEXT(current_tab, tabs)) == NULL)
446 		t = TAILQ_FIRST(&tabshead);
447 	switch_to_tab(t);
448 }
449 
450 void
451 cmd_tab_previous(struct buffer *buffer)
452 {
453 	struct tab *t;
454 
455 	if ((t = TAILQ_PREV(current_tab, tabshead, tabs)) == NULL)
456 		t = TAILQ_LAST(&tabshead, tabshead);
457 	switch_to_tab(t);
458 }
459 
460 void
461 cmd_tab_move(struct buffer *buffer)
462 {
463 	struct tab *t;
464 
465 	t = TAILQ_NEXT(current_tab, tabs);
466 	TAILQ_REMOVE(&tabshead, current_tab, tabs);
467 
468 	if (t == NULL)
469 		TAILQ_INSERT_HEAD(&tabshead, current_tab, tabs);
470 	else
471 		TAILQ_INSERT_AFTER(&tabshead, t, current_tab, tabs);
472 }
473 
474 void
475 cmd_tab_move_to(struct buffer *buffer)
476 {
477 	struct tab *t;
478 
479 	t = TAILQ_PREV(current_tab, tabshead, tabs);
480 	TAILQ_REMOVE(&tabshead, current_tab, tabs);
481 
482 	if (t == NULL) {
483 		if (TAILQ_EMPTY(&tabshead))
484 			TAILQ_INSERT_HEAD(&tabshead, current_tab, tabs);
485 		else
486 			TAILQ_INSERT_TAIL(&tabshead, current_tab, tabs);
487 	} else
488 		TAILQ_INSERT_BEFORE(t, current_tab, tabs);
489 }
490 
491 void
492 cmd_tab_select(struct buffer *buffer)
493 {
494 	GUARD_RECURSIVE_MINIBUFFER();
495 
496 	enter_minibuffer(sensible_self_insert, ts_select, exit_minibuffer,
497 	    NULL, compl_ts, NULL);
498 	strlcpy(ministate.prompt, "Select tab: ", sizeof(ministate.prompt));
499 }
500 
501 void
502 cmd_load_url(struct buffer *buffer)
503 {
504 	GUARD_RECURSIVE_MINIBUFFER();
505 
506 	enter_minibuffer(sensible_self_insert, lu_select, exit_minibuffer,
507 	    &lu_history, NULL, NULL);
508 	strlcpy(ministate.prompt, "Load URL: ", sizeof(ministate.prompt));
509 	strlcpy(ministate.buf, "gemini://", sizeof(ministate.buf));
510 	cmd_move_end_of_line(&ministate.buffer);
511 }
512 
513 void
514 cmd_load_current_url(struct buffer *buffer)
515 {
516 	GUARD_RECURSIVE_MINIBUFFER();
517 
518 	enter_minibuffer(sensible_self_insert, lu_select, exit_minibuffer,
519 	    &lu_history, NULL, NULL);
520 	strlcpy(ministate.prompt, "Load URL: ", sizeof(ministate.prompt));
521 	strlcpy(ministate.buf, current_tab->hist_cur->h, sizeof(ministate.buf));
522 	ministate.buffer.cpoff = utf8_cplen(ministate.buf);
523 }
524 
525 void
526 cmd_reload_page(struct buffer *buffer)
527 {
528 	load_url_in_tab(current_tab, current_tab->hist_cur->h);
529 }
530 
531 void
532 cmd_bookmark_page(struct buffer *buffer)
533 {
534 	GUARD_RECURSIVE_MINIBUFFER();
535 
536 	enter_minibuffer(sensible_self_insert, bp_select, exit_minibuffer, NULL,
537 	    NULL, NULL);
538 	strlcpy(ministate.prompt, "Bookmark URL: ", sizeof(ministate.prompt));
539 	strlcpy(ministate.buf, current_tab->hist_cur->h, sizeof(ministate.buf));
540 	ministate.buffer.cpoff = utf8_cplen(ministate.buf);
541 }
542 
543 void
544 cmd_list_bookmarks(struct buffer *buffer)
545 {
546 	load_url_in_tab(current_tab, "about:bookmarks");
547 }
548 
549 void
550 cmd_toggle_help(struct buffer *buffer)
551 {
552 	ui_toggle_side_window();
553 }
554 
555 void
556 cmd_link_select(struct buffer *buffer)
557 {
558 	struct line *l;
559 
560 	GUARD_RECURSIVE_MINIBUFFER();
561 
562 	l = TAILQ_FIRST(&buffer->page.head);
563 	while (l != NULL && l->type != LINE_LINK)
564 		l = TAILQ_NEXT(l, lines);
565 
566 	if (l == NULL) {
567 		message("No links found");
568 		return;
569 	}
570 
571 	enter_minibuffer(sensible_self_insert, ls_select, exit_minibuffer,
572 	    NULL, compl_ls, l);
573 	strlcpy(ministate.prompt, "Select link: ", sizeof(ministate.prompt));
574 }
575 
576 void
577 cmd_swiper(struct buffer *buffer)
578 {
579 	GUARD_RECURSIVE_MINIBUFFER();
580 
581 	enter_minibuffer(sensible_self_insert, swiper_select, exit_minibuffer,
582 	    NULL, compl_swiper, TAILQ_FIRST(&buffer->page.head));
583 	strlcpy(ministate.prompt, "Select line: ", sizeof(ministate.prompt));
584 }
585 
586 void
587 cmd_toc(struct buffer *buffer)
588 {
589 	struct line *l;
590 
591 	GUARD_RECURSIVE_MINIBUFFER();
592 
593 	l = TAILQ_FIRST(&buffer->page.head);
594 	while (l != NULL &&
595 	    l->type != LINE_TITLE_1 &&
596 	    l->type != LINE_TITLE_2 &&
597 	    l->type != LINE_TITLE_3)
598 		l = TAILQ_NEXT(l, lines);
599 
600 	if (l == NULL) {
601 		message("No headings found");
602 		return;
603 	}
604 
605 	enter_minibuffer(sensible_self_insert, toc_select, exit_minibuffer,
606 	    NULL, compl_toc, l);
607 	strlcpy(ministate.prompt, "Select heading: ",
608 	    sizeof(ministate.prompt));
609 }
610 
611 void
612 cmd_inc_fill_column(struct buffer *buffer)
613 {
614 	if (fill_column == INT_MAX)
615 		return;
616 
617 	fill_column += 2;
618 	message("fill-column: %d", fill_column);
619 
620 	ui_schedule_redraw();
621 }
622 
623 void
624 cmd_dec_fill_column(struct buffer *buffer)
625 {
626 	if (fill_column == INT_MAX || fill_column < 8)
627 		return;
628 
629 	fill_column -= 2;
630 	message("fill-column: %d", fill_column);
631 
632 	ui_schedule_redraw();
633 }
634 
635 void
636 cmd_olivetti_mode(struct buffer *buffer)
637 {
638 	olivetti_mode = !olivetti_mode;
639 	if (olivetti_mode)
640 		message("olivetti-mode enabled");
641 	else
642 		message("olivetti-mode disabled");
643 
644 	ui_schedule_redraw();
645 }
646 
647 void
648 cmd_mini_delete_char(struct buffer *buffer)
649 {
650 	char *c, *n;
651 
652 	if (!in_minibuffer) {
653 		message("text is read-only");
654 		return;
655 	}
656 
657 	minibuffer_taint_hist();
658 
659 	c = utf8_nth(buffer->current_line->line, buffer->cpoff);
660 	if (*c == '\0')
661 		return;
662 	n = utf8_next_cp(c);
663 
664 	memmove(c, n, strlen(n)+1);
665 
666 	recompute_completions(0);
667 }
668 
669 void
670 cmd_mini_delete_backward_char(struct buffer *buffer)
671 {
672 	char *c, *p, *start;
673 
674 	if (!in_minibuffer) {
675 		message("text is read-only");
676 		return;
677 	}
678 
679 	minibuffer_taint_hist();
680 
681 	c = utf8_nth(buffer->current_line->line, buffer->cpoff);
682 	start = buffer->current_line->line;
683 	if (c == start)
684 		return;
685 	p = utf8_prev_cp(c-1, start);
686 
687 	memmove(p, c, strlen(c)+1);
688 	buffer->cpoff--;
689 
690 	recompute_completions(0);
691 }
692 
693 void
694 cmd_mini_kill_line(struct buffer *buffer)
695 {
696 	char *c;
697 
698 	if (!in_minibuffer) {
699 		message("text is read-only");
700 		return;
701 	}
702 
703 	minibuffer_taint_hist();
704 	c = utf8_nth(buffer->current_line->line, buffer->cpoff);
705 	*c = '\0';
706 
707 	recompute_completions(0);
708 }
709 
710 void
711 cmd_mini_abort(struct buffer *buffer)
712 {
713 	if (!in_minibuffer)
714 		return;
715 
716 	ministate.abortfn();
717 }
718 
719 void
720 cmd_mini_complete_and_exit(struct buffer *buffer)
721 {
722 	if (!in_minibuffer)
723 		return;
724 
725 	minibuffer_taint_hist();
726 	ministate.donefn();
727 }
728 
729 void
730 cmd_mini_previous_history_element(struct buffer *buffer)
731 {
732 	if (ministate.history == NULL) {
733 		message("No history");
734 		return;
735 	}
736 
737 	if (ministate.hist_cur == NULL ||
738 	    (ministate.hist_cur = TAILQ_PREV(ministate.hist_cur, mhisthead, entries)) == NULL) {
739 		ministate.hist_cur = TAILQ_LAST(&ministate.history->head, mhisthead);
740 		ministate.hist_off = ministate.history->len - 1;
741 		if (ministate.hist_cur == NULL)
742 			message("No prev history item");
743 	} else {
744 		ministate.hist_off--;
745 	}
746 
747 	if (ministate.hist_cur != NULL)
748 		buffer->current_line->line = ministate.hist_cur->h;
749 }
750 
751 void
752 cmd_mini_next_history_element(struct buffer *buffer)
753 {
754 	if (ministate.history == NULL) {
755 		message("No history");
756 		return;
757 	}
758 
759 	if (ministate.hist_cur == NULL ||
760 	    (ministate.hist_cur = TAILQ_NEXT(ministate.hist_cur, entries)) == NULL) {
761 		ministate.hist_cur = TAILQ_FIRST(&ministate.history->head);
762 		ministate.hist_off = 0;
763 		if (ministate.hist_cur == NULL)
764 			message("No next history item");
765 	} else {
766 		ministate.hist_off++;
767 	}
768 
769 	if (ministate.hist_cur != NULL)
770 		buffer->current_line->line = ministate.hist_cur->h;
771 }
772 
773 void
774 cmd_previous_completion(struct buffer *buffer)
775 {
776 	if (in_minibuffer != MB_COMPREAD)
777 		return;
778 
779 	buffer = &ministate.compl.buffer;
780 
781 	if (buffer->current_line != NULL)
782 		buffer->current_line->parent->type = LINE_COMPL;
783 
784 	forward_line(buffer, -1);
785 
786 	if (buffer->current_line != NULL)
787 		buffer->current_line->parent->type = LINE_COMPL_CURRENT;
788 }
789 
790 void
791 cmd_next_completion(struct buffer *buffer)
792 {
793 	if (in_minibuffer != MB_COMPREAD)
794 		return;
795 
796 	buffer = &ministate.compl.buffer;
797 
798 	if (buffer->current_line != NULL)
799 		buffer->current_line->parent->type = LINE_COMPL;
800 
801 	forward_line(buffer, +1);
802 
803 	if (buffer->current_line != NULL)
804 		buffer->current_line->parent->type = LINE_COMPL_CURRENT;
805 }
806 
807 void
808 cmd_insert_current_candidate(struct buffer *buffer)
809 {
810 	struct vline *vl;
811 
812 	if (in_minibuffer != MB_COMPREAD)
813 		return;
814 
815 	buffer = &ministate.compl.buffer;
816 	if ((vl = buffer->current_line) == NULL)
817 		return;
818 
819 	minibuffer_taint_hist();
820 	strlcpy(ministate.buf, vl->parent->line, sizeof(ministate.buf));
821 	ministate.buffer.cpoff = utf8_cplen(ministate.buf);
822 }
823 
824 void
825 cmd_suspend_telescope(struct buffer *buffer)
826 {
827 	message("Zzz...");
828 	ui_suspend();
829 }
830 
831 void
832 cmd_toggle_pre_wrap(struct buffer *buffer)
833 {
834 	dont_wrap_pre = !dont_wrap_pre;
835 
836 	if (dont_wrap_pre)
837 		message("Don't wrap preformatted blocks");
838 	else
839 		message("Wrap preformatted blocks");
840 
841 	ui_schedule_redraw();
842 }
843 
844 void
845 cmd_mini_goto_beginning(struct buffer *buffer)
846 {
847 	struct vline *vl;
848 
849 	if (!in_minibuffer)
850 		return;
851 
852 	buffer = &ministate.compl.buffer;
853 
854 	if ((vl = buffer->current_line) != NULL)
855 		vl->parent->type = LINE_COMPL;
856 
857 	vl = TAILQ_FIRST(&buffer->head);
858 	while (vl != NULL && vl->parent->flags & L_HIDDEN)
859 		vl = TAILQ_NEXT(vl, vlines);
860 
861 	if (vl == NULL)
862 		return;
863 
864 	vl->parent->type = LINE_COMPL_CURRENT;
865 	buffer->top_line = vl;
866 	buffer->current_line = vl;
867 }
868 
869 void
870 cmd_mini_goto_end(struct buffer *buffer)
871 {
872 	struct vline *vl;
873 
874 	if (!in_minibuffer)
875 		return;
876 
877 	buffer = &ministate.compl.buffer;
878 
879 	if ((vl = buffer->current_line) != NULL)
880 		vl->parent->type = LINE_COMPL;
881 
882 	vl = TAILQ_LAST(&buffer->head, vhead);
883 	while (vl != NULL && vl->parent->flags & L_HIDDEN)
884 		vl = TAILQ_PREV(vl, vhead, vlines);
885 
886 	if (vl == NULL)
887 		return;
888 
889 	vl->parent->type = LINE_COMPL_CURRENT;
890 	buffer->current_line = vl;
891 }