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