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