1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/* Copyright (c) 2015 Harry Jeffery
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "navigator.h"
#include <sys/stat.h>
#include <dirent.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
void imv_navigator_init(struct imv_navigator *nav)
{
nav->buf_size = 512;
nav->paths = malloc(sizeof(char*) * nav->buf_size);
nav->num_paths = 0;
nav->cur_path = 0;
nav->last_move_direction = 1;
nav->changed = 0;
}
void imv_navigator_destroy(struct imv_navigator *nav)
{
if(nav->buf_size > 0) {
free(nav->paths);
nav->paths = NULL;
nav->buf_size = 0;
}
nav->num_paths = 0;
}
static void add_item(struct imv_navigator *nav, const char *path)
{
if(nav->buf_size == nav->num_paths) {
int new_buf_size = nav->buf_size * 2;
char **new_paths = malloc(sizeof(char*) * new_buf_size);
memcpy(new_paths, nav->paths, sizeof(char*) * nav->buf_size);
free(nav->paths);
nav->paths = new_paths;
nav->buf_size = new_buf_size;
}
nav->paths[nav->num_paths] = strdup(path);
nav->num_paths += 1;
if(nav->num_paths == 1) {
nav->changed = 1;
}
}
void imv_navigator_add(struct imv_navigator *nav, const char *path,
int recursive)
{
char path_buf[512];
struct stat path_info;
stat(path, &path_info);
if(S_ISDIR(path_info.st_mode)) {
DIR *d = opendir(path);
if(d) {
struct dirent *dir;
while((dir = readdir(d)) != NULL) {
if(strcmp(dir->d_name, "..") == 0 ||
strcmp(dir->d_name, ".") == 0) {
continue;
}
snprintf(path_buf, sizeof(path_buf), "%s/%s", path, dir->d_name);
if(recursive) {
imv_navigator_add(nav, path_buf, recursive);
} else {
add_item(nav, path_buf);
}
}
closedir(d);
}
} else {
add_item(nav, path);
}
}
const char *imv_navigator_selection(struct imv_navigator *nav)
{
if(nav->num_paths == 0) {
return NULL;
}
return nav->paths[nav->cur_path];
}
void imv_navigator_select_rel(struct imv_navigator *nav, int direction)
{
int prev_path = nav->cur_path;
if(nav->num_paths == 0) {
return;
}
if(direction > 1) {
direction = 1;
} else if(direction < -1) {
direction = -1;
} else if(direction == 0) {
return;
}
nav->cur_path += direction;
if(nav->cur_path == nav->num_paths) {
nav->cur_path = 0;
} else if(nav->cur_path < 0) {
nav->cur_path = nav->num_paths - 1;
}
nav->last_move_direction = direction;
nav->changed = prev_path != nav->cur_path;
}
void imv_navigator_remove(struct imv_navigator *nav, const char *path)
{
int removed = -1;
for(int i = 0; i < nav->num_paths; ++i) {
if(strcmp(path, nav->paths[i]) == 0) {
removed = i;
free(nav->paths[i]);
break;
}
}
if(removed == -1) {
return;
}
for(int i = removed; i < nav->num_paths - 1; ++i) {
nav->paths[i] = nav->paths[i+1];
}
nav->num_paths -= 1;
if(nav->cur_path == removed) {
/* We just removed the current path */
if(nav->last_move_direction < 0) {
/* Move left */
imv_navigator_select_rel(nav, -1);
} else {
/* Try to stay where we are, unless we ran out of room */
if(nav->cur_path == nav->num_paths) {
nav->cur_path = 0;
}
}
}
nav->changed = 1;
}
void imv_navigator_select_str(struct imv_navigator *nav, const int path)
{
if(path <= 0 || path >= nav->num_paths) {
return;
}
int prev_path = nav->cur_path;
nav->cur_path = path;
nav->changed = prev_path != nav->cur_path;
}
int imv_navigator_find_path(struct imv_navigator *nav, const char *path)
{
/* first try to match the exact path */
for(int i = 0; i < nav->num_paths; ++i) {
if(strcmp(path, nav->paths[i]) == 0) {
return i;
}
}
/* no exact matches, try the final portion of the path */
for(int i = 0; i < nav->num_paths; ++i) {
char *last_sep = strrchr(nav->paths[i], '/');
if(last_sep && strcmp(last_sep+1, path) == 0) {
return i;
}
}
/* no matches at all, give up */
return -1;
}
int imv_navigator_poll_changed(struct imv_navigator *nav)
{
if(nav->changed) {
nav->changed = 0;
return 1;
} else {
return 0;
}
}
|
