op public repos

Blame

Date:: Sun Apr 24 10:15:32 2022 UTC
Message:: merge the fs into the ui process The previous separation between the fs and ui process wasn't that good. The idea was to have a `ui' process tightly sandboxed, but it was a lie actually. `ui' was one imsg away from making internet connections and accessing data on the disk, so it wasn't really limited in (almost) any way. Furthermore, having to serialize data to/from the fs proc started to become not really maneagable. As a first step to fix this situation, join the fs and ui process.
Actions:: History | Blob | Raw File
  1 1fce2e75 2021-08-14 op /*
  2 1fce2e75 2021-08-14 op  * Copyright (c) 2021 Omar Polo <op@omarpolo.com>
  3 1fce2e75 2021-08-14 op  *
  4 1fce2e75 2021-08-14 op  * Permission to use, copy, modify, and distribute this software for any
  5 1fce2e75 2021-08-14 op  * purpose with or without fee is hereby granted, provided that the above
  6 1fce2e75 2021-08-14 op  * copyright notice and this permission notice appear in all copies.
  7 1fce2e75 2021-08-14 op  *
  8 1fce2e75 2021-08-14 op  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  9 1fce2e75 2021-08-14 op  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 10 1fce2e75 2021-08-14 op  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 11 1fce2e75 2021-08-14 op  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 12 1fce2e75 2021-08-14 op  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 13 1fce2e75 2021-08-14 op  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 14 1fce2e75 2021-08-14 op  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 15 1fce2e75 2021-08-14 op  */
 16 1fce2e75 2021-08-14 op 
 17 1fce2e75 2021-08-14 op #include "compat.h"
 18 1fce2e75 2021-08-14 op 
 19 1fce2e75 2021-08-14 op #include <errno.h>
 20 f63b8f73 2022-04-24 op #include <limits.h>
 21 1fce2e75 2021-08-14 op #include <stdio.h>
 22 1fce2e75 2021-08-14 op #include <stdlib.h>
 23 1fce2e75 2021-08-14 op #include <string.h>
 24 9e97090d 2022-02-26 op #include <time.h>
 25 1fce2e75 2021-08-14 op #include <unistd.h>
 26 1fce2e75 2021-08-14 op 
 27 1fce2e75 2021-08-14 op #include "defaults.h"
 28 b9fcc0e9 2021-10-08 op #include "fs.h"
 29 1fce2e75 2021-08-14 op #include "minibuffer.h"
 30 1fce2e75 2021-08-14 op #include "session.h"
 31 1fce2e75 2021-08-14 op #include "ui.h"
 32 1fce2e75 2021-08-14 op 
 33 9e97090d 2022-02-26 op struct history	history;
 34 9e97090d 2022-02-26 op 
 35 1fce2e75 2021-08-14 op static struct event	 autosaveev;
 36 1fce2e75 2021-08-14 op 
 37 1fce2e75 2021-08-14 op void
 38 1fce2e75 2021-08-14 op switch_to_tab(struct tab *tab)
 39 1fce2e75 2021-08-14 op {
 40 1fce2e75 2021-08-14 op 	current_tab = tab;
 41 1fce2e75 2021-08-14 op 	tab->flags &= ~TAB_URGENT;
 42 1fce2e75 2021-08-14 op 
 43 fb8dcd1c 2022-01-18 op 	if (operating && tab->flags & TAB_LAZY)
 44 ed21a9a1 2022-01-11 op 		load_url_in_tab(tab, tab->hist_cur->h, NULL, LU_MODE_NOHIST);
 45 1fce2e75 2021-08-14 op }
 46 1fce2e75 2021-08-14 op 
 47 1fce2e75 2021-08-14 op unsigned int
 48 1fce2e75 2021-08-14 op tab_new_id(void)
 49 1fce2e75 2021-08-14 op {
 50 1fce2e75 2021-08-14 op 	static uint32_t tab_counter;
 51 1fce2e75 2021-08-14 op 
 52 1fce2e75 2021-08-14 op 	return tab_counter++;
 53 1fce2e75 2021-08-14 op }
 54 1fce2e75 2021-08-14 op 
 55 1fce2e75 2021-08-14 op struct tab *
 56 1fce2e75 2021-08-14 op new_tab(const char *url, const char *base, struct tab *after)
 57 1fce2e75 2021-08-14 op {
 58 1fce2e75 2021-08-14 op 	struct tab	*tab;
 59 1fce2e75 2021-08-14 op 
 60 87aeb47b 2021-08-18 op 	ui_schedule_redraw();
 61 1fce2e75 2021-08-14 op 	autosave_hook();
 62 1fce2e75 2021-08-14 op 
 63 1fce2e75 2021-08-14 op 	if ((tab = calloc(1, sizeof(*tab))) == NULL) {
 64 1fce2e75 2021-08-14 op 		event_loopbreak();
 65 1fce2e75 2021-08-14 op 		return NULL;
 66 1fce2e75 2021-08-14 op 	}
 67 1fce2e75 2021-08-14 op 
 68 1fce2e75 2021-08-14 op 	TAILQ_INIT(&tab->hist.head);
 69 1fce2e75 2021-08-14 op 	TAILQ_INIT(&tab->buffer.head);
 70 1fce2e75 2021-08-14 op 	TAILQ_INIT(&tab->buffer.page.head);
 71 3b30597e 2022-02-11 op 	evtimer_set(&tab->loadingev, NULL, NULL);
 72 1fce2e75 2021-08-14 op 
 73 1fce2e75 2021-08-14 op 	tab->id = tab_new_id();
 74 1fce2e75 2021-08-14 op 
 75 1fce2e75 2021-08-14 op 	if (after != NULL)
 76 1fce2e75 2021-08-14 op 		TAILQ_INSERT_AFTER(&tabshead, after, tab, tabs);
 77 1fce2e75 2021-08-14 op 	else
 78 1fce2e75 2021-08-14 op 		TAILQ_INSERT_TAIL(&tabshead, tab, tabs);
 79 1fce2e75 2021-08-14 op 
 80 ea639250 2021-01-02 op 	if (!operating)
 81 ea639250 2021-01-02 op 		tab->flags |= TAB_LAZY;
 82 1fce2e75 2021-08-14 op 	load_url_in_tab(tab, url, base, 0);
 83 ea639250 2021-01-02 op 	switch_to_tab(tab);
 84 1fce2e75 2021-08-14 op 	return tab;
 85 1fce2e75 2021-08-14 op }
 86 1fce2e75 2021-08-14 op 
 87 1fce2e75 2021-08-14 op /*
 88 6c74799d 2022-01-05 op  * Move a tab from the tablist to the killed tab list and erase its
 89 05de8ac3 2022-01-06 op  * contents.  Append should always be 0 to prepend tabs so unkill_tab
 90 05de8ac3 2022-01-06 op  * can work correctly; appending is only useful during startup when
 91 05de8ac3 2022-01-06 op  * receiving the list of killed tabs to keep the correct order.
 92 05de8ac3 2022-01-06 op  * NB: doesn't update the current_tab.
 93 1fce2e75 2021-08-14 op  */
 94 1fce2e75 2021-08-14 op void
 95 05de8ac3 2022-01-06 op kill_tab(struct tab *tab, int append)
 96 1fce2e75 2021-08-14 op {
 97 6c74799d 2022-01-05 op 	int count;
 98 6c74799d 2022-01-05 op 
 99 1fce2e75 2021-08-14 op 	stop_tab(tab);
100 6c74799d 2022-01-05 op 	erase_buffer(&tab->buffer);
101 6c74799d 2022-01-05 op 	TAILQ_REMOVE(&tabshead, tab, tabs);
102 87aeb47b 2021-08-18 op 	ui_schedule_redraw();
103 1fce2e75 2021-08-14 op 	autosave_hook();
104 1fce2e75 2021-08-14 op 
105 1fce2e75 2021-08-14 op 	if (evtimer_pending(&tab->loadingev, NULL))
106 1fce2e75 2021-08-14 op 		evtimer_del(&tab->loadingev);
107 1fce2e75 2021-08-14 op 
108 05de8ac3 2022-01-06 op 	if (append)
109 05de8ac3 2022-01-06 op 		TAILQ_INSERT_TAIL(&ktabshead, tab, tabs);
110 05de8ac3 2022-01-06 op 	else
111 05de8ac3 2022-01-06 op 		TAILQ_INSERT_HEAD(&ktabshead, tab, tabs);
112 6c74799d 2022-01-05 op 
113 6c74799d 2022-01-05 op 	/* gc closed tabs */
114 6c74799d 2022-01-05 op 	count = 0;
115 6c74799d 2022-01-05 op 	TAILQ_FOREACH(tab, &ktabshead, tabs)
116 6c74799d 2022-01-05 op 		count++;
117 6c74799d 2022-01-05 op 	while (count > max_killed_tabs) {
118 6c74799d 2022-01-05 op 		count--;
119 6c74799d 2022-01-05 op 		free_tab(TAILQ_LAST(&ktabshead, tabshead));
120 6c74799d 2022-01-05 op 	}
121 6c74799d 2022-01-05 op }
122 6c74799d 2022-01-05 op 
123 6c74799d 2022-01-05 op /*
124 265508d0 2022-01-05 op  * Resurrects the lastest killed tab and returns it.  The tab is already
125 6c74799d 2022-01-05 op  * added to the tab list with the TAB_LAZY flag set.  NB: this doesn't
126 6c74799d 2022-01-05 op  * update current_tab.
127 6c74799d 2022-01-05 op  */
128 6c74799d 2022-01-05 op struct tab *
129 6c74799d 2022-01-05 op unkill_tab(void)
130 6c74799d 2022-01-05 op {
131 6c74799d 2022-01-05 op 	struct tab *t;
132 6c74799d 2022-01-05 op 
133 6c74799d 2022-01-05 op 	if (TAILQ_EMPTY(&ktabshead))
134 6c74799d 2022-01-05 op 		return NULL;
135 6c74799d 2022-01-05 op 
136 b7286684 2022-01-13 op 	ui_schedule_redraw();
137 6c74799d 2022-01-05 op 	autosave_hook();
138 6c74799d 2022-01-05 op 
139 6c74799d 2022-01-05 op 	t = TAILQ_FIRST(&ktabshead);
140 6c74799d 2022-01-05 op 	TAILQ_REMOVE(&ktabshead, t, tabs);
141 6c74799d 2022-01-05 op 	TAILQ_INSERT_TAIL(&tabshead, t, tabs);
142 6c74799d 2022-01-05 op 	t->flags |= TAB_LAZY;
143 6c74799d 2022-01-05 op 	return t;
144 6c74799d 2022-01-05 op }
145 6c74799d 2022-01-05 op 
146 6c74799d 2022-01-05 op /*
147 1b45e5df 2022-01-05 op  * Free every resource linked to the tab, including the tab itself, and
148 1b45e5df 2022-01-05 op  * removes it from the *killed* tablist.
149 6c74799d 2022-01-05 op  */
150 6c74799d 2022-01-05 op void
151 6c74799d 2022-01-05 op free_tab(struct tab *tab)
152 6c74799d 2022-01-05 op {
153 6c74799d 2022-01-05 op 	TAILQ_REMOVE(&ktabshead, tab, tabs);
154 bf935370 2022-01-05 op 	hist_clear(&tab->hist);
155 1fce2e75 2021-08-14 op 	free(tab);
156 1fce2e75 2021-08-14 op }
157 1fce2e75 2021-08-14 op 
158 1fce2e75 2021-08-14 op void
159 1fce2e75 2021-08-14 op stop_tab(struct tab *tab)
160 1fce2e75 2021-08-14 op {
161 1fce2e75 2021-08-14 op 	ui_send_net(IMSG_STOP, tab->id, NULL, 0);
162 1fce2e75 2021-08-14 op }
163 1fce2e75 2021-08-14 op 
164 6c74799d 2022-01-05 op static inline void
165 f63b8f73 2022-04-24 op savetab(FILE *fp, struct tab *tab, int killed)
166 1fce2e75 2021-08-14 op {
167 f63b8f73 2022-04-24 op 	struct hist	*h;
168 f63b8f73 2022-04-24 op 	size_t		 top_line, current_line;
169 f63b8f73 2022-04-24 op 	int		 future;
170 1fce2e75 2021-08-14 op 
171 f63b8f73 2022-04-24 op 	get_scroll_position(tab, &top_line, &current_line);
172 d0971653 2021-09-15 op 
173 f63b8f73 2022-04-24 op 	fprintf(fp, "%s ", tab->hist_cur->h);
174 6c74799d 2022-01-05 op 	if (tab == current_tab)
175 f63b8f73 2022-04-24 op 		fprintf(fp, "current,");
176 6c74799d 2022-01-05 op 	if (killed)
177 f63b8f73 2022-04-24 op 		fprintf(fp, "killed,");
178 1fce2e75 2021-08-14 op 
179 f63b8f73 2022-04-24 op 	fprintf(fp, "top=%zu,cur=%zu %s\n", top_line, current_line,
180 f63b8f73 2022-04-24 op 	    tab->buffer.page.title);
181 e795e935 2022-01-18 op 
182 6c74799d 2022-01-05 op 	future = 0;
183 6c74799d 2022-01-05 op 	TAILQ_FOREACH(h, &tab->hist.head, entries) {
184 6c74799d 2022-01-05 op 		if (h == tab->hist_cur) {
185 6c74799d 2022-01-05 op 			future = 1;
186 6c74799d 2022-01-05 op 			continue;
187 6c74799d 2022-01-05 op 		}
188 1fce2e75 2021-08-14 op 
189 f63b8f73 2022-04-24 op 		fprintf(fp, "%s %s\n", future ? ">" : "<", h->h);
190 6c74799d 2022-01-05 op 	}
191 6c74799d 2022-01-05 op }
192 1040cc7f 2021-01-02 op 
193 6c74799d 2022-01-05 op void
194 6c74799d 2022-01-05 op save_session(void)
195 6c74799d 2022-01-05 op {
196 f63b8f73 2022-04-24 op 	FILE			*session, *hist;
197 6c74799d 2022-01-05 op 	struct tab		*tab;
198 9e97090d 2022-02-26 op 	size_t			 i;
199 1fce2e75 2021-08-14 op 
200 6c74799d 2022-01-05 op 	if (safe_mode)
201 6c74799d 2022-01-05 op 		return;
202 6c74799d 2022-01-05 op 
203 f63b8f73 2022-04-24 op 	if ((session = fopen(session_file, "w")) == NULL)
204 f63b8f73 2022-04-24 op 		return;
205 6c74799d 2022-01-05 op 
206 6c74799d 2022-01-05 op 	TAILQ_FOREACH(tab, &tabshead, tabs)
207 f63b8f73 2022-04-24 op 		savetab(session, tab, 0);
208 6c74799d 2022-01-05 op 	TAILQ_FOREACH(tab, &ktabshead, tabs)
209 f63b8f73 2022-04-24 op 		savetab(session, tab, 1);
210 6c74799d 2022-01-05 op 
211 f63b8f73 2022-04-24 op 	fclose(session);
212 9e97090d 2022-02-26 op 
213 f63b8f73 2022-04-24 op 	if ((hist = fopen(history_file, "a")) == NULL)
214 f63b8f73 2022-04-24 op 		return;
215 f63b8f73 2022-04-24 op 
216 9e97090d 2022-02-26 op 	if (history.dirty) {
217 9e97090d 2022-02-26 op 		for (i = 0; i < history.len && history.dirty > 0; ++i) {
218 9e97090d 2022-02-26 op 			if (!history.items[i].dirty)
219 9e97090d 2022-02-26 op 				continue;
220 9e97090d 2022-02-26 op 			history.dirty--;
221 9e97090d 2022-02-26 op 			history.items[i].dirty = 0;
222 9e97090d 2022-02-26 op 
223 f63b8f73 2022-04-24 op 			fprintf(hist, "%lld %s\n",
224 f63b8f73 2022-04-24 op 			    (long long)history.items[i].ts,
225 f63b8f73 2022-04-24 op 			    history.items[i].uri);
226 9e97090d 2022-02-26 op 		}
227 9e97090d 2022-02-26 op 		history.dirty = 0;
228 9e97090d 2022-02-26 op 	}
229 f63b8f73 2022-04-24 op 
230 f63b8f73 2022-04-24 op 	fclose(hist);
231 9e97090d 2022-02-26 op }
232 9e97090d 2022-02-26 op 
233 9e97090d 2022-02-26 op void
234 9e97090d 2022-02-26 op history_push(struct histitem *hi)
235 9e97090d 2022-02-26 op {
236 9e97090d 2022-02-26 op 	size_t		 i, oldest = 0;
237 9e97090d 2022-02-26 op 	char		*uri;
238 9e97090d 2022-02-26 op 
239 9e97090d 2022-02-26 op 	for (i = 0; i < history.len; ++i) {
240 9e97090d 2022-02-26 op 		if (history.items[i].ts < history.items[oldest].ts)
241 9e97090d 2022-02-26 op 			oldest = i;
242 9e97090d 2022-02-26 op 
243 9e97090d 2022-02-26 op 		/* remove duplicates */
244 9e97090d 2022-02-26 op 		if (!strcmp(history.items[i].uri, hi->uri))
245 9e97090d 2022-02-26 op 			return;
246 9e97090d 2022-02-26 op 	}
247 9e97090d 2022-02-26 op 
248 9e97090d 2022-02-26 op 	if ((uri = strdup(hi->uri)) == NULL)
249 9e97090d 2022-02-26 op 		abort();
250 9e97090d 2022-02-26 op 
251 9e97090d 2022-02-26 op 	/* don't grow too much; replace the oldest */
252 9e97090d 2022-02-26 op 	if (history.len == HISTORY_CAP) {
253 9e97090d 2022-02-26 op 		history.items[oldest].ts = hi->ts;
254 9e97090d 2022-02-26 op 		free(history.items[oldest].uri);
255 9e97090d 2022-02-26 op 		history.items[oldest].uri = uri;
256 9e97090d 2022-02-26 op 		return;
257 9e97090d 2022-02-26 op 	}
258 9e97090d 2022-02-26 op 
259 9e97090d 2022-02-26 op 	history.items[history.len].ts = hi->ts;
260 9e97090d 2022-02-26 op 	history.items[history.len].uri = uri;
261 9e97090d 2022-02-26 op 	history.len++;
262 9e97090d 2022-02-26 op }
263 9e97090d 2022-02-26 op 
264 9e97090d 2022-02-26 op static int
265 9e97090d 2022-02-26 op history_cmp(const void *a, const void *b)
266 9e97090d 2022-02-26 op {
267 9e97090d 2022-02-26 op 	const struct history_item *i = a, *j = b;
268 9e97090d 2022-02-26 op 	return strcmp(i->uri, j->uri);
269 9e97090d 2022-02-26 op }
270 9e97090d 2022-02-26 op 
271 9e97090d 2022-02-26 op void
272 9e97090d 2022-02-26 op history_sort(void)
273 9e97090d 2022-02-26 op {
274 9e97090d 2022-02-26 op 	qsort(history.items, history.len, sizeof(history.items[0]),
275 9e97090d 2022-02-26 op 	    history_cmp);
276 1fce2e75 2021-08-14 op }
277 1fce2e75 2021-08-14 op 
278 1fce2e75 2021-08-14 op void
279 9e97090d 2022-02-26 op history_add(const char *uri)
280 9e97090d 2022-02-26 op {
281 9e97090d 2022-02-26 op 	size_t	 i, j, insert = 0, oldest = 0;
282 9e97090d 2022-02-26 op 	char	*u;
283 9e97090d 2022-02-26 op 	int	 c;
284 9e97090d 2022-02-26 op 
285 9e97090d 2022-02-26 op 	for (i = 0; i < history.len; ++i) {
286 9e97090d 2022-02-26 op 		if (history.items[i].ts < history.items[oldest].ts)
287 9e97090d 2022-02-26 op 			oldest = i;
288 9e97090d 2022-02-26 op 
289 9e97090d 2022-02-26 op 		if (insert != 0 && insert < i)
290 9e97090d 2022-02-26 op 			continue;
291 9e97090d 2022-02-26 op 
292 9e97090d 2022-02-26 op 		c = strcmp(uri, history.items[i].uri);
293 9e97090d 2022-02-26 op 		if (c == 0) {
294 9e97090d 2022-02-26 op 			history.items[i].ts = time(NULL);
295 9e97090d 2022-02-26 op 			history.items[i].dirty = 1;
296 9e97090d 2022-02-26 op 			history.dirty++;
297 9e97090d 2022-02-26 op 			autosave_hook();
298 9e97090d 2022-02-26 op 			return;
299 9e97090d 2022-02-26 op 		}
300 9e97090d 2022-02-26 op 
301 9e97090d 2022-02-26 op 		if (c > 0)
302 9e97090d 2022-02-26 op 			insert = i;
303 9e97090d 2022-02-26 op 	}
304 9e97090d 2022-02-26 op 
305 9e97090d 2022-02-26 op 	if ((u = strdup(uri)) == NULL)
306 9e97090d 2022-02-26 op 		return;
307 9e97090d 2022-02-26 op 
308 9e97090d 2022-02-26 op 	/* if history is full, replace the oldest one */
309 9e97090d 2022-02-26 op 	if (history.len == HISTORY_CAP) {
310 9e97090d 2022-02-26 op 		free(history.items[oldest].uri);
311 9e97090d 2022-02-26 op 		history.items[oldest].uri = u;
312 9e97090d 2022-02-26 op 		history.items[oldest].ts = time(NULL);
313 9e97090d 2022-02-26 op 		history.items[oldest].dirty = 1;
314 9e97090d 2022-02-26 op 		history.dirty++;
315 9e97090d 2022-02-26 op 		history_sort();
316 9e97090d 2022-02-26 op 		autosave_hook();
317 9e97090d 2022-02-26 op 		return;
318 9e97090d 2022-02-26 op 	}
319 9e97090d 2022-02-26 op 
320 9e97090d 2022-02-26 op 	/* otherwise just insert in the right spot */
321 9e97090d 2022-02-26 op 
322 9e97090d 2022-02-26 op 	for (j = history.len; j > insert; --j)
323 9e97090d 2022-02-26 op 		memcpy(&history.items[j], &history.items[j-1],
324 9e97090d 2022-02-26 op 		    sizeof(history.items[j]));
325 9e97090d 2022-02-26 op 
326 9e97090d 2022-02-26 op 	history.items[insert].ts = time(NULL);
327 9e97090d 2022-02-26 op 	history.items[insert].uri = u;
328 9e97090d 2022-02-26 op 	history.items[insert].dirty = 1;
329 9e97090d 2022-02-26 op 	history.dirty++;
330 9e97090d 2022-02-26 op 	history.len++;
331 9e97090d 2022-02-26 op 	autosave_hook();
332 9e97090d 2022-02-26 op }
333 9e97090d 2022-02-26 op 
334 9e97090d 2022-02-26 op void
335 1fce2e75 2021-08-14 op autosave_init(void)
336 1fce2e75 2021-08-14 op {
337 1fce2e75 2021-08-14 op 	evtimer_set(&autosaveev, autosave_timer, NULL);
338 1fce2e75 2021-08-14 op }
339 1fce2e75 2021-08-14 op 
340 1fce2e75 2021-08-14 op void
341 1fce2e75 2021-08-14 op autosave_timer(int fd, short event, void *data)
342 1fce2e75 2021-08-14 op {
343 1fce2e75 2021-08-14 op 	save_session();
344 1fce2e75 2021-08-14 op }
345 1fce2e75 2021-08-14 op 
346 1fce2e75 2021-08-14 op /*
347 1fce2e75 2021-08-14 op  * Function to be called in "interesting" places where we may want to
348 1fce2e75 2021-08-14 op  * schedule an autosave (like on new tab or before loading an url.)
349 1fce2e75 2021-08-14 op  */
350 1fce2e75 2021-08-14 op void
351 1fce2e75 2021-08-14 op autosave_hook(void)
352 1fce2e75 2021-08-14 op {
353 1fce2e75 2021-08-14 op 	struct timeval tv;
354 1fce2e75 2021-08-14 op 
355 1fce2e75 2021-08-14 op 	if (autosave <= 0)
356 1fce2e75 2021-08-14 op 		return;
357 1fce2e75 2021-08-14 op 
358 1fce2e75 2021-08-14 op 	if (!evtimer_pending(&autosaveev, NULL)) {
359 1fce2e75 2021-08-14 op 		tv.tv_sec = autosave;
360 1fce2e75 2021-08-14 op 		tv.tv_usec = 0;
361 1fce2e75 2021-08-14 op 
362 1fce2e75 2021-08-14 op 		evtimer_add(&autosaveev, &tv);
363 1fce2e75 2021-08-14 op 	}
364 1fce2e75 2021-08-14 op }