op public repos

Blob

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