A Simple X Image Viewer
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.
 
 
 
 
 
 

610 rindas
14 KiB

  1. /* Copyright 2011 Bert Muennich
  2. *
  3. * This file is part of sxiv.
  4. *
  5. * sxiv is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published
  7. * by the Free Software Foundation; either version 2 of the License,
  8. * or (at your option) any later version.
  9. *
  10. * sxiv is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with sxiv. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. #define _POSIX_C_SOURCE 200112L
  19. #define _THUMBS_CONFIG
  20. #include <stdio.h>
  21. #include <stdlib.h>
  22. #include <string.h>
  23. #include <sys/types.h>
  24. #include <sys/stat.h>
  25. #include <unistd.h>
  26. #include <utime.h>
  27. #include "thumbs.h"
  28. #include "util.h"
  29. #include "config.h"
  30. #if HAVE_LIBEXIF
  31. #include <libexif/exif-data.h>
  32. void exif_auto_orientate(const fileinfo_t*);
  33. #endif
  34. static char *cache_dir;
  35. char* tns_cache_filepath(const char *filepath)
  36. {
  37. size_t len;
  38. char *cfile = NULL;
  39. if (cache_dir == NULL || filepath == NULL || *filepath != '/')
  40. return NULL;
  41. if (strncmp(filepath, cache_dir, strlen(cache_dir)) != 0) {
  42. /* don't cache images inside the cache directory! */
  43. len = strlen(cache_dir) + strlen(filepath) + 6;
  44. cfile = (char*) s_malloc(len);
  45. snprintf(cfile, len, "%s/%s.jpg", cache_dir, filepath + 1);
  46. }
  47. return cfile;
  48. }
  49. Imlib_Image tns_cache_load(const char *filepath, bool *outdated)
  50. {
  51. char *cfile;
  52. struct stat cstats, fstats;
  53. Imlib_Image im = NULL;
  54. if (filepath == NULL)
  55. return NULL;
  56. if (stat(filepath, &fstats) < 0)
  57. return NULL;
  58. if ((cfile = tns_cache_filepath(filepath)) != NULL) {
  59. if (stat(cfile, &cstats) == 0) {
  60. if (cstats.st_mtime == fstats.st_mtime)
  61. im = imlib_load_image(cfile);
  62. else
  63. *outdated = true;
  64. }
  65. free(cfile);
  66. }
  67. return im;
  68. }
  69. void tns_cache_write(Imlib_Image im, const char *filepath, bool force)
  70. {
  71. char *cfile, *dirend;
  72. struct stat cstats, fstats;
  73. struct utimbuf times;
  74. Imlib_Load_Error err = 0;
  75. if (im == NULL || filepath == NULL)
  76. return;
  77. if (stat(filepath, &fstats) < 0)
  78. return;
  79. if ((cfile = tns_cache_filepath(filepath)) != NULL) {
  80. if (force || stat(cfile, &cstats) < 0 ||
  81. cstats.st_mtime != fstats.st_mtime)
  82. {
  83. if ((dirend = strrchr(cfile, '/')) != NULL) {
  84. *dirend = '\0';
  85. err = r_mkdir(cfile);
  86. *dirend = '/';
  87. }
  88. if (err == 0) {
  89. imlib_context_set_image(im);
  90. imlib_image_set_format("jpg");
  91. imlib_image_attach_data_value("quality", NULL, 90, NULL);
  92. imlib_save_image_with_error_return(cfile, &err);
  93. }
  94. if (err == 0) {
  95. times.actime = fstats.st_atime;
  96. times.modtime = fstats.st_mtime;
  97. utime(cfile, &times);
  98. }
  99. }
  100. free(cfile);
  101. }
  102. }
  103. void tns_clean_cache(tns_t *tns)
  104. {
  105. int dirlen;
  106. bool delete;
  107. char *cfile, *filename, *tpos;
  108. r_dir_t dir;
  109. if (cache_dir == NULL)
  110. return;
  111. if (r_opendir(&dir, cache_dir) < 0) {
  112. warn("could not open thumbnail cache directory: %s", cache_dir);
  113. return;
  114. }
  115. dirlen = strlen(cache_dir);
  116. while ((cfile = r_readdir(&dir)) != NULL) {
  117. filename = cfile + dirlen;
  118. delete = false;
  119. if ((tpos = strrchr(filename, '.')) != NULL) {
  120. *tpos = '\0';
  121. if (access(filename, F_OK) < 0)
  122. delete = true;
  123. *tpos = '.';
  124. }
  125. if (delete) {
  126. if (unlink(cfile) < 0)
  127. warn("could not delete cache file: %s", cfile);
  128. }
  129. free(cfile);
  130. }
  131. r_closedir(&dir);
  132. }
  133. void tns_init(tns_t *tns, const fileinfo_t *files, const int *cnt, int *sel,
  134. win_t *win)
  135. {
  136. int len;
  137. const char *homedir, *dsuffix = "";
  138. if (tns == NULL)
  139. return;
  140. if (*cnt > 0) {
  141. tns->thumbs = (thumb_t*) s_malloc(*cnt * sizeof(thumb_t));
  142. memset(tns->thumbs, 0, *cnt * sizeof(thumb_t));
  143. } else {
  144. tns->thumbs = NULL;
  145. }
  146. tns->files = files;
  147. tns->cnt = cnt;
  148. tns->loadnext = tns->first = tns->end = tns->r_first = tns->r_end = 0;
  149. tns->sel = sel;
  150. tns->win = win;
  151. tns->dirty = false;
  152. tns->zl = 0;
  153. tns_zoom(tns, 1);
  154. if ((homedir = getenv("XDG_CACHE_HOME")) == NULL || homedir[0] == '\0') {
  155. homedir = getenv("HOME");
  156. dsuffix = "/.cache";
  157. }
  158. if (homedir != NULL) {
  159. free(cache_dir);
  160. len = strlen(homedir) + strlen(dsuffix) + 6;
  161. cache_dir = (char*) s_malloc(len);
  162. snprintf(cache_dir, len, "%s%s/sxiv", homedir, dsuffix);
  163. } else {
  164. warn("could not locate thumbnail cache directory");
  165. }
  166. }
  167. void tns_free(tns_t *tns)
  168. {
  169. int i;
  170. if (tns == NULL)
  171. return;
  172. if (tns->thumbs != NULL) {
  173. for (i = 0; i < *tns->cnt; i++) {
  174. if (tns->thumbs[i].im != NULL) {
  175. imlib_context_set_image(tns->thumbs[i].im);
  176. imlib_free_image();
  177. }
  178. }
  179. free(tns->thumbs);
  180. tns->thumbs = NULL;
  181. }
  182. free(cache_dir);
  183. cache_dir = NULL;
  184. }
  185. Imlib_Image tns_scale_down(Imlib_Image im, int dim)
  186. {
  187. int w, h;
  188. float z, zw, zh;
  189. imlib_context_set_image(im);
  190. w = imlib_image_get_width();
  191. h = imlib_image_get_height();
  192. zw = (float) dim / (float) w;
  193. zh = (float) dim / (float) h;
  194. z = MIN(zw, zh);
  195. z = MIN(z, 1.0);
  196. if (z < 1.0) {
  197. imlib_context_set_anti_alias(1);
  198. im = imlib_create_cropped_scaled_image(0, 0, w, h,
  199. MAX(z * w, 1), MAX(z * h, 1));
  200. if (im == NULL)
  201. die("could not allocate memory");
  202. imlib_free_image_and_decache();
  203. }
  204. return im;
  205. }
  206. bool tns_load(tns_t *tns, int n, bool force)
  207. {
  208. int w, h;
  209. bool cache_hit = false;
  210. float zw, zh;
  211. thumb_t *t;
  212. Imlib_Image im = NULL;
  213. const fileinfo_t *file;
  214. if (tns == NULL || tns->thumbs == NULL)
  215. return false;
  216. if (n < 0 || n >= *tns->cnt)
  217. return false;
  218. file = &tns->files[n];
  219. if (file->name == NULL || file->path == NULL)
  220. return false;
  221. t = &tns->thumbs[n];
  222. if (t->im != NULL) {
  223. imlib_context_set_image(t->im);
  224. imlib_free_image();
  225. }
  226. if (!force && (im = tns_cache_load(file->path, &force)) != NULL) {
  227. cache_hit = true;
  228. } else {
  229. #if HAVE_LIBEXIF
  230. if (!force) {
  231. int pw = 0, ph = 0, x = 0, y = 0;
  232. bool err;
  233. ExifData *ed;
  234. ExifEntry *entry;
  235. ExifContent *ifd;
  236. ExifByteOrder byte_order;
  237. int tmpfd;
  238. char tmppath[] = "/tmp/sxiv-XXXXXX";
  239. Imlib_Image tmpim;
  240. if ((ed = exif_data_new_from_file(file->path)) != NULL &&
  241. ed->data != NULL && ed->size > 0)
  242. {
  243. if ((tmpfd = mkstemp(tmppath)) >= 0) {
  244. err = write(tmpfd, ed->data, ed->size) != ed->size;
  245. close(tmpfd);
  246. if (!err && (tmpim = imlib_load_image(tmppath)) != NULL) {
  247. byte_order = exif_data_get_byte_order(ed);
  248. ifd = ed->ifd[EXIF_IFD_EXIF];
  249. entry = exif_content_get_entry(ifd, EXIF_TAG_PIXEL_X_DIMENSION);
  250. if (entry != NULL)
  251. pw = exif_get_long(entry->data, byte_order);
  252. entry = exif_content_get_entry(ifd, EXIF_TAG_PIXEL_Y_DIMENSION);
  253. if (entry != NULL)
  254. ph = exif_get_long(entry->data, byte_order);
  255. imlib_context_set_image(tmpim);
  256. w = imlib_image_get_width();
  257. h = imlib_image_get_height();
  258. if (pw > w && ph > h && (pw - ph >= 0) == (w - h >= 0)) {
  259. zw = (float) pw / (float) w;
  260. zh = (float) ph / (float) h;
  261. if (zw < zh) {
  262. pw /= zh;
  263. x = (w - pw) / 2;
  264. w = pw;
  265. } else if (zw > zh) {
  266. ph /= zw;
  267. y = (h - ph) / 2;
  268. h = ph;
  269. }
  270. }
  271. if ((im = imlib_create_cropped_image(x, y, w, h)) == NULL)
  272. die("could not allocate memory");
  273. imlib_free_image_and_decache();
  274. }
  275. unlink(tmppath);
  276. }
  277. exif_data_unref(ed);
  278. }
  279. }
  280. #endif
  281. if (im == NULL && (access(file->path, R_OK) < 0 ||
  282. (im = imlib_load_image(file->path)) == NULL))
  283. {
  284. if (file->warn)
  285. warn("could not open image: %s", file->name);
  286. return false;
  287. }
  288. }
  289. if (!cache_hit) {
  290. #if HAVE_LIBEXIF
  291. imlib_context_set_image(im);
  292. exif_auto_orientate(file);
  293. #endif
  294. im = tns_scale_down(im, thumb_sizes[ARRLEN(thumb_sizes)-1]);
  295. tns_cache_write(im, file->path, true);
  296. }
  297. t->im = tns_scale_down(im, thumb_sizes[tns->zl]);
  298. imlib_context_set_image(t->im);
  299. t->w = imlib_image_get_width();
  300. t->h = imlib_image_get_height();
  301. tns->dirty = true;
  302. return true;
  303. }
  304. void tns_unload(tns_t *tns, int n)
  305. {
  306. thumb_t *t;
  307. if (tns == NULL || tns->thumbs == NULL)
  308. return;
  309. if (n < 0 || n >= *tns->cnt)
  310. return;
  311. t = &tns->thumbs[n];
  312. if (t->im != NULL) {
  313. imlib_context_set_image(t->im);
  314. imlib_free_image();
  315. t->im = NULL;
  316. }
  317. }
  318. void tns_check_view(tns_t *tns, bool scrolled)
  319. {
  320. int r;
  321. if (tns == NULL)
  322. return;
  323. tns->first -= tns->first % tns->cols;
  324. r = *tns->sel % tns->cols;
  325. if (scrolled) {
  326. /* move selection into visible area */
  327. if (*tns->sel >= tns->first + tns->cols * tns->rows)
  328. *tns->sel = tns->first + r + tns->cols * (tns->rows - 1);
  329. else if (*tns->sel < tns->first)
  330. *tns->sel = tns->first + r;
  331. } else {
  332. /* scroll to selection */
  333. if (tns->first + tns->cols * tns->rows <= *tns->sel) {
  334. tns->first = *tns->sel - r - tns->cols * (tns->rows - 1);
  335. tns->dirty = true;
  336. } else if (tns->first > *tns->sel) {
  337. tns->first = *tns->sel - r;
  338. tns->dirty = true;
  339. }
  340. }
  341. }
  342. void tns_render(tns_t *tns)
  343. {
  344. thumb_t *t;
  345. win_t *win;
  346. int i, cnt, r, x, y;
  347. if (tns == NULL || tns->thumbs == NULL || tns->win == NULL)
  348. return;
  349. if (!tns->dirty)
  350. return;
  351. win = tns->win;
  352. win_clear(win);
  353. imlib_context_set_drawable(win->buf.pm);
  354. tns->cols = MAX(1, win->w / tns->dim);
  355. tns->rows = MAX(1, win->h / tns->dim);
  356. if (*tns->cnt < tns->cols * tns->rows) {
  357. tns->first = 0;
  358. cnt = *tns->cnt;
  359. } else {
  360. tns_check_view(tns, false);
  361. cnt = tns->cols * tns->rows;
  362. if ((r = tns->first + cnt - *tns->cnt) >= tns->cols)
  363. tns->first -= r - r % tns->cols;
  364. if (r > 0)
  365. cnt -= r % tns->cols;
  366. }
  367. r = cnt % tns->cols ? 1 : 0;
  368. tns->x = x = (win->w - MIN(cnt, tns->cols) * tns->dim) / 2 + tns->bw + 3;
  369. tns->y = y = (win->h - (cnt / tns->cols + r) * tns->dim) / 2 + tns->bw + 3;
  370. tns->loadnext = *tns->cnt;
  371. tns->end = tns->first + cnt;
  372. for (i = tns->r_first; i < tns->r_end; i++) {
  373. if ((i < tns->first || i >= tns->end) && tns->thumbs[i].im != NULL)
  374. tns_unload(tns, i);
  375. }
  376. tns->r_first = tns->first;
  377. tns->r_end = tns->end;
  378. for (i = tns->first; i < tns->end; i++) {
  379. t = &tns->thumbs[i];
  380. if (t->im != NULL) {
  381. t->x = x + (thumb_sizes[tns->zl] - t->w) / 2;
  382. t->y = y + (thumb_sizes[tns->zl] - t->h) / 2;
  383. imlib_context_set_image(t->im);
  384. imlib_render_image_on_drawable_at_size(t->x, t->y, t->w, t->h);
  385. if (tns->files[i].marked)
  386. tns_mark(tns, i, true);
  387. } else {
  388. tns->loadnext = MIN(tns->loadnext, i);
  389. }
  390. if ((i + 1) % tns->cols == 0) {
  391. x = tns->x;
  392. y += tns->dim;
  393. } else {
  394. x += tns->dim;
  395. }
  396. }
  397. tns->dirty = false;
  398. tns_highlight(tns, *tns->sel, true);
  399. }
  400. void tns_mark(tns_t *tns, int n, bool mark)
  401. {
  402. if (tns == NULL || tns->thumbs == NULL || tns->win == NULL)
  403. return;
  404. if (n >= 0 && n < *tns->cnt && tns->thumbs[n].im != NULL) {
  405. win_t *win = tns->win;
  406. thumb_t *t = &tns->thumbs[n];
  407. unsigned long col = win->fullscreen ? win->fscol : win->bgcol;
  408. int x = t->x + t->w, y = t->y + t->h;
  409. win_draw_rect(win, x - 1, y + 1, 1, tns->bw, true, 1, col);
  410. win_draw_rect(win, x + 1, y - 1, tns->bw, 1, true, 1, col);
  411. if (mark)
  412. col = win->selcol;
  413. win_draw_rect(win, x, y, tns->bw + 2, tns->bw + 2, true, 1, col);
  414. if (!mark && n == *tns->sel)
  415. tns_highlight(tns, n, true);
  416. }
  417. }
  418. void tns_highlight(tns_t *tns, int n, bool hl)
  419. {
  420. if (tns == NULL || tns->thumbs == NULL || tns->win == NULL)
  421. return;
  422. if (n >= 0 && n < *tns->cnt && tns->thumbs[n].im != NULL) {
  423. win_t *win = tns->win;
  424. thumb_t *t = &tns->thumbs[n];
  425. unsigned long col;
  426. int oxy = (tns->bw + 1) / 2 + 1, owh = tns->bw + 2;
  427. if (hl)
  428. col = win->selcol;
  429. else
  430. col = win->fullscreen ? win->fscol : win->bgcol;
  431. win_draw_rect(win, t->x - oxy, t->y - oxy, t->w + owh, t->h + owh,
  432. false, tns->bw, col);
  433. if (tns->files[n].marked)
  434. tns_mark(tns, n, true);
  435. }
  436. }
  437. bool tns_move_selection(tns_t *tns, direction_t dir, int cnt)
  438. {
  439. int old, max;
  440. if (tns == NULL || tns->thumbs == NULL)
  441. return false;
  442. old = *tns->sel;
  443. cnt = cnt > 1 ? cnt : 1;
  444. switch (dir) {
  445. case DIR_UP:
  446. *tns->sel = MAX(*tns->sel - cnt * tns->cols, *tns->sel % tns->cols);
  447. break;
  448. case DIR_DOWN:
  449. max = tns->cols * ((*tns->cnt - 1) / tns->cols) +
  450. MIN((*tns->cnt - 1) % tns->cols, *tns->sel % tns->cols);
  451. *tns->sel = MIN(*tns->sel + cnt * tns->cols, max);
  452. break;
  453. case DIR_LEFT:
  454. *tns->sel = MAX(*tns->sel - cnt, 0);
  455. break;
  456. case DIR_RIGHT:
  457. *tns->sel = MIN(*tns->sel + cnt, *tns->cnt - 1);
  458. break;
  459. }
  460. if (*tns->sel != old) {
  461. tns_highlight(tns, old, false);
  462. tns_check_view(tns, false);
  463. if (!tns->dirty)
  464. tns_highlight(tns, *tns->sel, true);
  465. }
  466. return *tns->sel != old;
  467. }
  468. bool tns_scroll(tns_t *tns, direction_t dir, bool screen)
  469. {
  470. int d, max, old;
  471. if (tns == NULL)
  472. return false;
  473. old = tns->first;
  474. d = tns->cols * (screen ? tns->rows : 1);
  475. if (dir == DIR_DOWN) {
  476. max = *tns->cnt - tns->cols * tns->rows;
  477. if (*tns->cnt % tns->cols != 0)
  478. max += tns->cols - *tns->cnt % tns->cols;
  479. tns->first = MIN(tns->first + d, max);
  480. } else if (dir == DIR_UP) {
  481. tns->first = MAX(tns->first - d, 0);
  482. }
  483. if (tns->first != old) {
  484. tns_check_view(tns, true);
  485. tns->dirty = true;
  486. }
  487. return tns->first != old;
  488. }
  489. bool tns_zoom(tns_t *tns, int d)
  490. {
  491. int i, oldzl;
  492. if (tns == NULL || tns->thumbs == NULL)
  493. return false;
  494. oldzl = tns->zl;
  495. tns->zl += -(d < 0) + (d > 0);
  496. tns->zl = MAX(tns->zl, 0);
  497. tns->zl = MIN(tns->zl, ARRLEN(thumb_sizes)-1);
  498. tns->bw = ((thumb_sizes[tns->zl] - 1) >> 5) + 1;
  499. tns->dim = thumb_sizes[tns->zl] + 2 * tns->bw + 6;
  500. if (tns->zl != oldzl) {
  501. for (i = 0; i < *tns->cnt; i++)
  502. tns_unload(tns, i);
  503. tns->dirty = true;
  504. }
  505. return tns->zl != oldzl;
  506. }
  507. int tns_translate(tns_t *tns, int x, int y)
  508. {
  509. int n;
  510. if (tns == NULL || tns->thumbs == NULL)
  511. return -1;
  512. if (x < tns->x || y < tns->y)
  513. return -1;
  514. n = tns->first + (y - tns->y) / tns->dim * tns->cols +
  515. (x - tns->x) / tns->dim;
  516. if (n >= *tns->cnt)
  517. n = -1;
  518. return n;
  519. }