2 * Copyright (C) 2008 - 2016 The Geeqie Team
4 * Authors: John Ellis, Vladimir Nadvornik, Laurent Monin
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License along
17 * with this program; if not, write to the Free Software Foundation, Inc.,
18 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
22 #include "history_list.h"
24 #include "secure_save.h"
25 #include "ui_fileops.h"
29 *-----------------------------------------------------------------------------
30 * Implements a history chain. Used by the Back and Forward toolbar buttons.
31 * Selecting any folder appends the path to the end of the chain.
32 * Pressing the Back and Forward buttons moves along the chain, but does
33 * not make additions to the chain.
34 * The chain always increases and is deleted at the end of the session
35 *-----------------------------------------------------------------------------
38 static GList *history_chain = NULL;
39 static guint chain_index = G_MAXUINT;
40 static gboolean nav_button = FALSE; /** Used to prevent the nav buttons making entries to the chain **/
42 const gchar *history_chain_back()
46 chain_index = chain_index > 0 ? chain_index - 1 : 0;
48 return g_list_nth_data(history_chain, chain_index);
51 const gchar *history_chain_forward()
54 guint last = g_list_length(history_chain) - 1;
56 chain_index = chain_index < last ? chain_index + 1 : last;
58 return g_list_nth_data(history_chain, chain_index);
62 * @brief Appends a path to the history chain
63 * @param path Path selected
65 * Each time the user selects a new path it is appended to the chain
66 * except when it is identical to the current last entry
67 * The pointer is always moved to the end of the chain
69 void history_chain_append_end(const gchar *path)
75 if(chain_index == G_MAXUINT)
77 history_chain = g_list_append (history_chain, g_strdup(path));
82 work = g_list_last(history_chain);
83 if (g_strcmp0(work->data , path) != 0)
85 history_chain = g_list_append (history_chain, g_strdup(path));
86 chain_index = g_list_length(history_chain) - 1;
87 DEBUG_3("%d %s", chain_index, path);
91 chain_index = g_list_length(history_chain) - 1;
102 *-----------------------------------------------------------------------------
104 *-----------------------------------------------------------------------------
107 #define HISTORY_DEFAULT_KEY_COUNT 16
110 typedef struct _HistoryData HistoryData;
117 static GList *history_list = NULL;
120 static gchar *quoted_from_text(const gchar *text)
124 gint l = strlen(text);
126 if (l == 0) return NULL;
128 while (c < l && text[c] !='"') c++;
135 while (e < l && text[e] !='"') e++;
140 return g_strndup(ptr, e - c);
147 gboolean history_list_load(const gchar *path)
154 pathl = path_from_utf8(path);
155 f = fopen(pathl, "r");
157 if (!f) return FALSE;
159 /* first line must start with History comment */
160 if (!fgets(s_buf, sizeof(s_buf), f) ||
161 strncmp(s_buf, "#History", 8) != 0)
167 while (fgets(s_buf, sizeof(s_buf), f))
169 if (s_buf[0]=='#') continue;
177 while (ptr[c] != ']' && ptr[c] != '\n' && ptr[c] != '\0') c++;
180 key = g_strndup(ptr, c);
186 value = quoted_from_text(s_buf);
189 history_list_add_to_key(key, value, 0);
202 gboolean history_list_save(const gchar *path)
209 pathl = path_from_utf8(path);
210 ssi = secure_open(pathl);
214 log_printf(_("Unable to write history lists to: %s\n"), path);
218 secure_fprintf(ssi, "#History lists\n\n");
220 list = g_list_last(history_list);
221 while (list && secsave_errno == SS_ERR_NONE)
229 secure_fprintf(ssi, "[%s]\n", hd->key);
231 /* save them inverted (oldest to newest)
232 * so that when reading they are added correctly
234 work = g_list_last(hd->list);
235 list_count = g_list_position(hd->list, g_list_last(hd->list)) + 1;
236 while (work && secsave_errno == SS_ERR_NONE)
238 if (!(strcmp(hd->key, "path_list") == 0 && list_count > options->open_recent_list_maxsize))
240 secure_fprintf(ssi, "\"%s\"\n", (gchar *)work->data);
245 secure_fputc(ssi, '\n');
248 secure_fprintf(ssi, "#end\n");
250 return (secure_close(ssi) == 0);
253 static void history_list_free(HistoryData *hd)
270 static HistoryData *history_list_find_by_key(const gchar *key)
272 GList *work = history_list;
274 if (!key) return NULL;
278 HistoryData *hd = work->data;
279 if (strcmp(hd->key, key) == 0) return hd;
285 const gchar *history_list_find_last_path_by_key(const gchar *key)
289 hd = history_list_find_by_key(key);
290 if (!hd || !hd->list) return NULL;
292 return hd->list->data;
295 void history_list_free_key(const gchar *key)
298 hd = history_list_find_by_key(key);
301 history_list = g_list_remove(history_list, hd);
302 history_list_free(hd);
305 void history_list_add_to_key(const gchar *key, const gchar *path, gint max)
310 if (!key || !path) return;
312 hd = history_list_find_by_key(key);
315 hd = g_new(HistoryData, 1);
316 hd->key = g_strdup(key);
318 history_list = g_list_prepend(history_list, hd);
321 /* if already in the list, simply move it to the top */
325 gchar *buf = work->data;
327 if (strcmp(buf, path) == 0)
329 /* if not first, move it */
330 if (work != hd->list)
332 hd->list = g_list_remove(hd->list, buf);
333 hd->list = g_list_prepend(hd->list, buf);
340 hd->list = g_list_prepend(hd->list, g_strdup(path));
342 if (max == -1) max = HISTORY_DEFAULT_KEY_COUNT;
346 GList *work = hd->list;
357 while (work && len > max)
363 hd->list = g_list_delete_link(hd->list, node);
369 void history_list_item_change(const gchar *key, const gchar *oldpath, const gchar *newpath)
374 if (!oldpath) return;
375 hd = history_list_find_by_key(key);
381 gchar *buf = work->data;
382 if (strcmp(buf, oldpath) == 0)
386 work->data = g_strdup(newpath);
390 hd->list = g_list_remove(hd->list, buf);
399 void history_list_item_move(const gchar *key, const gchar *path, gint direction)
406 hd = history_list_find_by_key(key);
412 gchar *buf = work->data;
413 if (strcmp(buf, path) == 0)
417 hd->list = g_list_remove(hd->list, buf);
418 hd->list = g_list_insert(hd->list, buf, p);
426 void history_list_item_remove(const gchar *key, const gchar *path)
428 history_list_item_change(key, path, NULL);
431 GList *history_list_get_by_key(const gchar *key)
435 hd = history_list_find_by_key(key);
436 if (!hd) return NULL;
440 /* vim: set shiftwidth=8 softtabstop=0 cindent cinoptions={1s: */