op public repos

Blob

Date:: Mon Jul 12 15:29:59 2021 UTC
Message:: move declarations to minibuffer.h
Actions:: History | Blame | Raw File
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 "minibuffer.h"
22 #include "telescope.h"
23 
24 /* return 1 if moved, 0 otherwise */
25 static inline int
26 forward_line(struct buffer *buffer, int n)
27 {
28 	struct vline *vl;
29 	int did;
30 
31 	if (buffer->current_line == NULL)
32 		return 0;
33 	vl = buffer->current_line;
34 
35 	did = 0;
36 	while (n != 0) {
37 		if (n > 0) {
38 			vl = TAILQ_NEXT(vl, vlines);
39 			if (vl == NULL)
40 				return did;
41 			if (vl->parent->flags & L_HIDDEN)
42 				continue;
43 			buffer->current_line = vl;
44 			n--;
45 		} else {
46 			vl = TAILQ_PREV(vl, vhead, vlines);
47 			if (vl == NULL)
48 				return did;
49 			if (vl->parent->flags & L_HIDDEN)
50 				continue;
51 			if (buffer->current_line == buffer->top_line)
52 				buffer->top_line = vl;
53 			buffer->current_line = vl;
54 			n++;
55 		}
56 
57 		did = 1;
58 	}
59 
60 	return did;
61 }
62 
63 void
64 cmd_previous_line(struct buffer *buffer)
65 {
66 	forward_line(buffer, -1);
67 }
68 
69 void
70 cmd_next_line(struct buffer *buffer)
71 {
72 	forward_line(buffer, +1);
73 }
74 
75 void
76 cmd_backward_char(struct buffer *buffer)
77 {
78 	if (buffer->cpoff != 0)
79 		buffer->cpoff--;
80 }
81 
82 void
83 cmd_forward_char(struct buffer *buffer)
84 {
85 	size_t len = 0;
86 
87 	if (buffer->current_line->line != NULL)
88 		len = utf8_cplen(buffer->current_line->line);
89 	if (++buffer->cpoff > len)
90 		buffer->cpoff = len;
91 }
92 
93 void
94 cmd_backward_paragraph(struct buffer *buffer)
95 {
96 	do {
97 		if (!forward_line(buffer, -1)) {
98 			message("No previous paragraph");
99 			return;
100 		}
101 	} while (buffer->current_line->line != NULL ||
102 	    buffer->current_line->parent->type != LINE_TEXT);
103 }
104 
105 void
106 cmd_forward_paragraph(struct buffer *buffer)
107 {
108 	do {
109 		if (!forward_line(buffer, +1)) {
110 			message("No next paragraph");
111 			return;
112 		}
113 	} while (buffer->current_line->line != NULL ||
114 	    buffer->current_line->parent->type != LINE_TEXT);
115 }
116 
117 void
118 cmd_move_beginning_of_line(struct buffer *buffer)
119 {
120 	buffer->cpoff = 0;
121 }
122 
123 void
124 cmd_move_end_of_line(struct buffer *buffer)
125 {
126 	struct vline	*vl;
127 
128 	vl = buffer->current_line;
129 	if (vl->line == NULL)
130 		return;
131 	buffer->cpoff = utf8_cplen(vl->line);
132 }
133 
134 void
135 cmd_redraw(struct buffer *buffer)
136 {
137         ui_schedule_redraw();
138 }
139 
140 void
141 cmd_scroll_line_up(struct buffer *buffer)
142 {
143 	struct vline	*vl;
144 
145 	if ((vl = TAILQ_PREV(buffer->top_line, vhead, vlines))
146 	    == NULL)
147 		return;
148 
149 	forward_line(buffer, -1);
150 
151 	buffer->line_off--;
152 	buffer->top_line = vl;
153 }
154 
155 void
156 cmd_scroll_line_down(struct buffer *buffer)
157 {
158 	if (!forward_line(buffer, +1))
159 		return;
160 
161 	buffer->top_line = TAILQ_NEXT(buffer->top_line, vlines);
162 	buffer->line_off++;
163 }
164 
165 void
166 cmd_scroll_up(struct buffer *buffer)
167 {
168 	forward_line(buffer, -1*body_lines);
169 }
170 
171 void
172 cmd_scroll_down(struct buffer *buffer)
173 {
174 	forward_line(buffer, body_lines);
175 }
176 
177 void
178 cmd_beginning_of_buffer(struct buffer *buffer)
179 {
180 	buffer->current_line = TAILQ_FIRST(&buffer->head);
181 	buffer->cpoff = 0;
182 	buffer->top_line = buffer->current_line;
183 	buffer->line_off = 0;
184 }
185 
186 void
187 cmd_end_of_buffer(struct buffer *buffer)
188 {
189 	buffer->current_line = TAILQ_LAST(&buffer->head, vhead);
190 	buffer->cpoff = body_cols;
191 }
192 
193 void
194 cmd_kill_telescope(struct buffer *buffer)
195 {
196 	save_session();
197 	event_loopbreak();
198 }
199 
200 void
201 cmd_push_button(struct buffer *buffer)
202 {
203 	struct vline	*vl;
204 	struct line	*l;
205 
206 	vl = buffer->current_line;
207 	switch (vl->parent->type) {
208 	case LINE_LINK:
209 		load_url_in_tab(current_tab(), vl->parent->alt);
210 		break;
211 	case LINE_PRE_START:
212 		l = TAILQ_NEXT(vl->parent, lines);
213 		for (; l != NULL; l = TAILQ_NEXT(l, lines)) {
214 			if (l->type == LINE_PRE_END)
215 				break;
216 			l->flags ^= L_HIDDEN;
217 		}
218 		break;
219 	default:
220 		break;
221 	}
222 }
223 
224 void
225 cmd_push_button_new_tab(struct buffer *buffer)
226 {
227 	struct vline	*vl;
228 
229 	vl = buffer->current_line;
230 	if (vl->parent->type != LINE_LINK)
231 		return;
232 
233 	new_tab(vl->parent->alt);
234 }
235 
236 void
237 cmd_previous_button(struct buffer *buffer)
238 {
239 	struct excursion place;
240 
241 	save_excursion(&place, buffer);
242 
243 	do {
244 		if (!forward_line(buffer, -1)) {
245 			restore_excursion(&place, buffer);
246 			message("No previous link");
247 			return;
248 		}
249 	} while (buffer->current_line->parent->type != LINE_LINK);
250 }
251 
252 void
253 cmd_next_button(struct buffer *buffer)
254 {
255 	struct excursion place;
256 
257 	save_excursion(&place, buffer);
258 
259 	do {
260 		if (!forward_line(buffer, +1)){
261 			restore_excursion(&place, buffer);
262 			message("No next link");
263 			return;
264 		}
265 	} while (buffer->current_line->parent->type != LINE_LINK);
266 }
267 
268 static inline int
269 is_heading(const struct line *l)
270 {
271 	return l->type == LINE_TITLE_1 ||
272 		l->type == LINE_TITLE_2 ||
273 		l->type == LINE_TITLE_3;
274 }
275 
276 void
277 cmd_previous_heading(struct buffer *buffer)
278 {
279 	struct excursion place;
280 
281 	save_excursion(&place, buffer);
282 
283 	do {
284 		if (!forward_line(buffer, -1)) {
285 			restore_excursion(&place, buffer);
286 			message("No previous heading");
287 			return;
288 		}
289 	} while (!is_heading(buffer->current_line->parent));
290 }
291 
292 void
293 cmd_next_heading(struct buffer *buffer)
294 {
295 	struct excursion place;
296 
297 	save_excursion(&place, buffer);
298 
299 	do {
300 		if (!forward_line(buffer, +1)) {
301 			restore_excursion(&place, buffer);
302 			message("No next heading");
303 			return;
304 		}
305 	} while (!is_heading(buffer->current_line->parent));
306 }
307 
308 void
309 cmd_previous_page(struct buffer *buffer)
310 {
311 	struct tab *tab = current_tab();
312 
313 	if (!load_previous_page(tab))
314 		message("No previous page");
315 	else
316 		start_loading_anim(tab);
317 }
318 
319 void
320 cmd_next_page(struct buffer *buffer)
321 {
322 	struct tab *tab = current_tab();
323 
324 	if (!load_next_page(tab))
325 		message("No next page");
326 	else
327 		start_loading_anim(tab);
328 }
329 
330 void
331 cmd_clear_minibuf(struct buffer *buffer)
332 {
333         message(NULL);
334 }
335 
336 void
337 cmd_execute_extended_command(struct buffer *buffer)
338 {
339 	size_t	 len;
340 
341 	if (in_minibuffer) {
342 		message("We don't have enable-recursive-minibuffers");
343 		return;
344 	}
345 
346 	enter_minibuffer(eecmd_self_insert, eecmd_select, exit_minibuffer,
347 	    &eecmd_history);
348 
349 	len = sizeof(ministate.prompt);
350 	strlcpy(ministate.prompt, "", len);
351 
352 	if (thiskey.meta)
353 		strlcat(ministate.prompt, "M-", len);
354 
355 	strlcat(ministate.prompt, ui_keyname(thiskey.key), len);
356 
357 	if (thiskey.meta)
358 		strlcat(ministate.prompt, " ", len);
359 }
360 
361 void
362 cmd_tab_close(struct buffer *buffer)
363 {
364 	struct tab *tab, *t;
365 
366 	tab = current_tab();
367 	if (TAILQ_PREV(tab, tabshead, tabs) == NULL &&
368 	    TAILQ_NEXT(tab, tabs) == NULL) {
369 		message("Can't close the only tab.");
370 		return;
371 	}
372 
373 	if (evtimer_pending(&tab->loadingev, NULL))
374 		evtimer_del(&tab->loadingev);
375 
376 	stop_tab(tab);
377 
378 	if ((t = TAILQ_PREV(tab, tabshead, tabs)) == NULL)
379 		t = TAILQ_NEXT(tab, tabs);
380 	TAILQ_REMOVE(&tabshead, tab, tabs);
381 	free(tab);
382 
383 	switch_to_tab(t);
384 }
385 
386 void
387 cmd_tab_close_other(struct buffer *buffer)
388 {
389 	struct tab *t, *i;
390 
391 	TAILQ_FOREACH_SAFE(t, &tabshead, tabs, i) {
392 		if (t->flags & TAB_CURRENT)
393 			continue;
394 
395 		stop_tab(t);
396 		TAILQ_REMOVE(&tabshead, t, tabs);
397 		free(t);
398 	}
399 }
400 
401 void
402 cmd_tab_new(struct buffer *buffer)
403 {
404 	const char *url;
405 
406 	if ((url = new_tab_url) == NULL)
407 		url = NEW_TAB_URL;
408 
409 	new_tab(url);
410 }
411 
412 void
413 cmd_tab_next(struct buffer *buffer)
414 {
415 	struct tab *tab, *t;
416 
417 	tab = current_tab();
418 	tab->flags &= ~TAB_CURRENT;
419 
420 	if ((t = TAILQ_NEXT(tab, tabs)) == NULL)
421 		t = TAILQ_FIRST(&tabshead);
422 	t->flags |= TAB_CURRENT;
423 	t->flags &= ~TAB_URGENT;
424 }
425 
426 void
427 cmd_tab_previous(struct buffer *buffer)
428 {
429 	struct tab *tab, *t;
430 
431 	tab = current_tab();
432 	tab->flags &= ~TAB_CURRENT;
433 
434 	if ((t = TAILQ_PREV(tab, tabshead, tabs)) == NULL)
435 		t = TAILQ_LAST(&tabshead, tabshead);
436 	t->flags |= TAB_CURRENT;
437 	t->flags &= ~TAB_URGENT;
438 }
439 
440 void
441 cmd_tab_move(struct buffer *buffer)
442 {
443 	struct tab *tab, *t;
444 
445 	tab = current_tab();
446 	t = TAILQ_NEXT(tab, tabs);
447 	TAILQ_REMOVE(&tabshead, tab, tabs);
448 
449 	if (t == NULL)
450 		TAILQ_INSERT_HEAD(&tabshead, tab, tabs);
451 	else
452 		TAILQ_INSERT_AFTER(&tabshead, t, tab, tabs);
453 }
454 
455 void
456 cmd_tab_move_to(struct buffer *buffer)
457 {
458 	struct tab *tab, *t;
459 
460 	tab = current_tab();
461 	t = TAILQ_PREV(tab, tabshead, tabs);
462 	TAILQ_REMOVE(&tabshead, tab, tabs);
463 
464 	if (t == NULL) {
465 		if (TAILQ_EMPTY(&tabshead))
466 			TAILQ_INSERT_HEAD(&tabshead, tab, tabs);
467 		else
468 			TAILQ_INSERT_TAIL(&tabshead, tab, tabs);
469 	} else
470 		TAILQ_INSERT_BEFORE(t, tab, tabs);
471 }
472 
473 void
474 cmd_load_url(struct buffer *buffer)
475 {
476 	if (in_minibuffer) {
477 		message("We don't have enable-recursive-minibuffers");
478 		return;
479 	}
480 
481 	enter_minibuffer(lu_self_insert, lu_select, exit_minibuffer,
482 	    &lu_history);
483 	strlcpy(ministate.prompt, "Load URL: ", sizeof(ministate.prompt));
484 	strlcpy(ministate.buf, "gemini://", sizeof(ministate.buf));
485 	cmd_move_end_of_line(&ministate.buffer);
486 }
487 
488 void
489 cmd_load_current_url(struct buffer *buffer)
490 {
491 	struct tab *tab = current_tab();
492 
493 	if (in_minibuffer) {
494 		message("We don't have enable-recursive-minibuffers");
495 		return;
496 	}
497 
498 	enter_minibuffer(lu_self_insert, lu_select, exit_minibuffer,
499 	    &lu_history);
500 	strlcpy(ministate.prompt, "Load URL: ", sizeof(ministate.prompt));
501 	strlcpy(ministate.buf, tab->hist_cur->h, sizeof(ministate.buf));
502 	ministate.buffer.cpoff = utf8_cplen(ministate.buf);
503 }
504 
505 void
506 cmd_bookmark_page(struct buffer *buffer)
507 {
508 	struct tab *tab = current_tab();
509 
510 	enter_minibuffer(lu_self_insert, bp_select, exit_minibuffer, NULL);
511 	strlcpy(ministate.prompt, "Bookmark URL: ", sizeof(ministate.prompt));
512 	strlcpy(ministate.buf, tab->hist_cur->h, sizeof(ministate.buf));
513 	ministate.buffer.cpoff = utf8_cplen(ministate.buf);
514 }
515 
516 void
517 cmd_list_bookmarks(struct buffer *buffer)
518 {
519 	load_url_in_tab(current_tab(), "about:bookmarks");
520 }
521 
522 void
523 cmd_toggle_help(struct buffer *buffer)
524 {
525 	ui_toggle_side_window();
526 }
527 
528 void
529 cmd_inc_fill_column(struct buffer *buffer)
530 {
531 	if (fill_column == INT_MAX)
532 		return;
533 
534 	fill_column += 2;
535 	message("fill-column: %d", fill_column);
536 
537 	ui_schedule_redraw();
538 }
539 
540 void
541 cmd_dec_fill_column(struct buffer *buffer)
542 {
543 	if (fill_column == INT_MAX || fill_column < 8)
544 		return;
545 
546 	fill_column -= 2;
547 	message("fill-column: %d", fill_column);
548 
549 	ui_schedule_redraw();
550 }
551 
552 void
553 cmd_olivetti_mode(struct buffer *buffer)
554 {
555 	olivetti_mode = !olivetti_mode;
556 	if (olivetti_mode)
557 		message("olivetti-mode enabled");
558 	else
559 		message("olivetti-mode disabled");
560 
561 	ui_schedule_redraw();
562 }
563 
564 void
565 cmd_mini_delete_char(struct buffer *buffer)
566 {
567 	char *c, *n;
568 
569 	if (!in_minibuffer) {
570 		message("text is read-only");
571 		return;
572 	}
573 
574 	minibuffer_taint_hist();
575 
576 	c = utf8_nth(buffer->current_line->line, buffer->cpoff);
577 	if (*c == '\0')
578 		return;
579 	n = utf8_next_cp(c);
580 
581 	memmove(c, n, strlen(n)+1);
582 }
583 
584 void
585 cmd_mini_delete_backward_char(struct buffer *buffer)
586 {
587 	char *c, *p, *start;
588 
589 	if (!in_minibuffer) {
590 		message("text is read-only");
591 		return;
592 	}
593 
594 	minibuffer_taint_hist();
595 
596 	c = utf8_nth(buffer->current_line->line, buffer->cpoff);
597 	start = buffer->current_line->line;
598 	if (c == start)
599 		return;
600 	p = utf8_prev_cp(c-1, start);
601 
602 	memmove(p, c, strlen(c)+1);
603 	buffer->cpoff--;
604 }
605 
606 void
607 cmd_mini_kill_line(struct buffer *buffer)
608 {
609 	char *c;
610 
611 	if (!in_minibuffer) {
612 		message("text is read-only");
613 		return;
614 	}
615 
616 	minibuffer_taint_hist();
617 	c = utf8_nth(buffer->current_line->line, buffer->cpoff);
618 	*c = '\0';
619 }
620 
621 void
622 cmd_mini_abort(struct buffer *buffer)
623 {
624 	if (!in_minibuffer)
625 		return;
626 
627 	ministate.abortfn();
628 }
629 
630 void
631 cmd_mini_complete_and_exit(struct buffer *buffer)
632 {
633 	if (!in_minibuffer)
634 		return;
635 
636 	minibuffer_taint_hist();
637 	ministate.donefn();
638 }
639 
640 void
641 cmd_mini_previous_history_element(struct buffer *buffer)
642 {
643 	if (ministate.history == NULL) {
644 		message("No history");
645 		return;
646 	}
647 
648 	if (ministate.hist_cur == NULL ||
649 	    (ministate.hist_cur = TAILQ_PREV(ministate.hist_cur, mhisthead, entries)) == NULL) {
650 		ministate.hist_cur = TAILQ_LAST(&ministate.history->head, mhisthead);
651 		ministate.hist_off = ministate.history->len - 1;
652 		if (ministate.hist_cur == NULL)
653 			message("No prev item");
654 	} else {
655 		ministate.hist_off--;
656 	}
657 
658 	if (ministate.hist_cur != NULL)
659 		buffer->current_line->line = ministate.hist_cur->h;
660 }
661 
662 void
663 cmd_mini_next_history_element(struct buffer *buffer)
664 {
665 	if (ministate.history == NULL) {
666 		message("No history");
667 		return;
668 	}
669 
670 	if (ministate.hist_cur == NULL ||
671 	    (ministate.hist_cur = TAILQ_NEXT(ministate.hist_cur, entries)) == NULL) {
672 		ministate.hist_cur = TAILQ_FIRST(&ministate.history->head);
673 		ministate.hist_off = 0;
674 		if (ministate.hist_cur == NULL)
675 			message("No next item");
676 	} else {
677 		ministate.hist_off++;
678 	}
679 
680 	if (ministate.hist_cur != NULL)
681 		buffer->current_line->line = ministate.hist_cur->h;
682 }