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 <errno.h>
20 #include <stdio.h>
21 #include <stdlib.h>
22 #include <string.h>
23 #include <unistd.h>
24 
25 #include "defaults.h"
26 #include "fs.h"
27 #include "minibuffer.h"
28 #include "parser.h"
29 #include "session.h"
30 #include "ui.h"
31 
32 static struct event	 autosaveev;
33 
34 void
35 switch_to_tab(struct tab *tab)
36 {
37 	current_tab = tab;
38 	tab->flags &= ~TAB_URGENT;
39 
40 	if (operating && tab->flags & TAB_LAZY) {
41 		tab->flags ^= TAB_LAZY;
42 		load_url_in_tab(tab, tab->hist_cur->h, NULL, LU_MODE_NOHIST);
43 	}
44 }
45 
46 unsigned int
47 tab_new_id(void)
48 {
49 	static uint32_t tab_counter;
50 
51 	return tab_counter++;
52 }
53 
54 struct tab *
55 new_tab(const char *url, const char *base, struct tab *after)
56 {
57 	struct tab	*tab;
58 
59 	ui_schedule_redraw();
60 	autosave_hook();
61 
62 	if ((tab = calloc(1, sizeof(*tab))) == NULL) {
63 		event_loopbreak();
64 		return NULL;
65 	}
66 
67 	TAILQ_INIT(&tab->hist.head);
68 
69 	TAILQ_INIT(&tab->buffer.head);
70 	TAILQ_INIT(&tab->buffer.page.head);
71 
72 	tab->id = tab_new_id();
73 
74 	if (after != NULL)
75 		TAILQ_INSERT_AFTER(&tabshead, after, tab, tabs);
76 	else
77 		TAILQ_INSERT_TAIL(&tabshead, tab, tabs);
78 
79 	if (!operating)
80 		tab->flags |= TAB_LAZY;
81 	load_url_in_tab(tab, url, base, 0);
82 	switch_to_tab(tab);
83 	return tab;
84 }
85 
86 /*
87  * Move a tab from the tablist to the killed tab list and erase its
88  * contents.  Append should always be 0 to prepend tabs so unkill_tab
89  * can work correctly; appending is only useful during startup when
90  * receiving the list of killed tabs to keep the correct order.
91  * NB: doesn't update the current_tab.
92  */
93 void
94 kill_tab(struct tab *tab, int append)
95 {
96 	int count;
97 
98 	stop_tab(tab);
99 	erase_buffer(&tab->buffer);
100 	TAILQ_REMOVE(&tabshead, tab, tabs);
101 	ui_schedule_redraw();
102 	autosave_hook();
103 
104 	if (evtimer_pending(&tab->loadingev, NULL))
105 		evtimer_del(&tab->loadingev);
106 
107 	if (append)
108 		TAILQ_INSERT_TAIL(&ktabshead, tab, tabs);
109 	else
110 		TAILQ_INSERT_HEAD(&ktabshead, tab, tabs);
111 
112 	/* gc closed tabs */
113 	count = 0;
114 	TAILQ_FOREACH(tab, &ktabshead, tabs)
115 		count++;
116 	while (count > max_killed_tabs) {
117 		count--;
118 		free_tab(TAILQ_LAST(&ktabshead, tabshead));
119 	}
120 }
121 
122 /*
123  * Resurrects the lastest killed tab and returns it.  The tab is already
124  * added to the tab list with the TAB_LAZY flag set.  NB: this doesn't
125  * update current_tab.
126  */
127 struct tab *
128 unkill_tab(void)
129 {
130 	struct tab *t;
131 
132 	if (TAILQ_EMPTY(&ktabshead))
133 		return NULL;
134 
135 	ui_schedule_redraw();
136 	autosave_hook();
137 
138 	t = TAILQ_FIRST(&ktabshead);
139 	TAILQ_REMOVE(&ktabshead, t, tabs);
140 	TAILQ_INSERT_TAIL(&tabshead, t, tabs);
141 	t->flags |= TAB_LAZY;
142 	return t;
143 }
144 
145 /*
146  * Free every resource linked to the tab, including the tab itself, and
147  * removes it from the *killed* tablist.
148  */
149 void
150 free_tab(struct tab *tab)
151 {
152 	TAILQ_REMOVE(&ktabshead, tab, tabs);
153 	hist_clear(&tab->hist);
154 	free(tab);
155 }
156 
157 void
158 stop_tab(struct tab *tab)
159 {
160 	ui_send_net(IMSG_STOP, tab->id, NULL, 0);
161 }
162 
163 static inline void
164 sendtab(struct tab *tab, int killed)
165 {
166 	struct session_tab	 st;
167 	struct session_tab_hist	 sth;
168 	struct hist		*h;
169 	int			 future;
170 
171 	memset(&st, 0, sizeof(st));
172 
173 	if (tab == current_tab)
174 		st.flags |= TAB_CURRENT;
175 	if (killed)
176 		st.flags |= TAB_KILLED;
177 
178 	strlcpy(st.uri, tab->hist_cur->h, sizeof(st.uri));
179 	strlcpy(st.title, tab->buffer.page.title, sizeof(st.title));
180 	ui_send_fs(IMSG_SESSION_TAB, 0, &st, sizeof(st));
181 
182 	future = 0;
183 	TAILQ_FOREACH(h, &tab->hist.head, entries) {
184 		if (h == tab->hist_cur) {
185 			future = 1;
186 			continue;
187 		}
188 
189 		memset(&sth, 0, sizeof(sth));
190 		strlcpy(sth.uri, h->h, sizeof(sth.uri));
191 		sth.future = future;
192 		ui_send_fs(IMSG_SESSION_TAB_HIST, 0, &sth, sizeof(sth));
193 	}
194 
195 }
196 
197 void
198 save_session(void)
199 {
200 	struct tab		*tab;
201 
202 	if (safe_mode)
203 		return;
204 
205 	ui_send_fs(IMSG_SESSION_START, 0, NULL, 0);
206 
207 	TAILQ_FOREACH(tab, &tabshead, tabs)
208 		sendtab(tab, 0);
209 	TAILQ_FOREACH(tab, &ktabshead, tabs)
210 		sendtab(tab, 1);
211 
212 	ui_send_fs(IMSG_SESSION_END, 0, NULL, 0);
213 }
214 
215 void
216 autosave_init(void)
217 {
218 	evtimer_set(&autosaveev, autosave_timer, NULL);
219 }
220 
221 void
222 autosave_timer(int fd, short event, void *data)
223 {
224 	save_session();
225 }
226 
227 /*
228  * Function to be called in "interesting" places where we may want to
229  * schedule an autosave (like on new tab or before loading an url.)
230  */
231 void
232 autosave_hook(void)
233 {
234 	struct timeval tv;
235 
236 	if (autosave <= 0)
237 		return;
238 
239 	if (!evtimer_pending(&autosaveev, NULL)) {
240 		tv.tv_sec = autosave;
241 		tv.tv_usec = 0;
242 
243 		evtimer_add(&autosaveev, &tv);
244 	}
245 }