Fix returning too early (before cleanup) in RFAC, which led to not cancelling
[kugel-rb/myfork.git] / apps / tagcache.c
blob07af9bf8333fd76cfc25cd2eec04b0adc2b45217
1 /***************************************************************************
2 * __________ __ ___.
3 * Open \______ \ ____ ____ | | _\_ |__ _______ ___
4 * Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
5 * Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
6 * Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
7 * \/ \/ \/ \/ \/
8 * $Id$
10 * Copyright (C) 2005 by Miika Pekkarinen
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version 2
15 * of the License, or (at your option) any later version.
17 * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
18 * KIND, either express or implied.
20 ****************************************************************************/
23 * TagCache API
25 * ----------x---------x------------------x-----
26 * | | | External
27 * +---------------x-------+ | TagCache | Libraries
28 * | Modification routines | | Core |
29 * +-x---------x-----------+ | |
30 * | (R/W) | | | |
31 * | +------x-------------x-+ +-------------x-----+ |
32 * | | x==x Filters & clauses | |
33 * | | Search routines | +-------------------+ |
34 * | | x============================x DirCache
35 * | +-x--------------------+ | (optional)
36 * | | (R) |
37 * | | +-------------------------------+ +---------+ |
38 * | | | DB Commit (sort,unique,index) | | | |
39 * | | +-x--------------------------x--+ | Control | |
40 * | | | (R/W) | (R) | Thread | |
41 * | | | +----------------------+ | | | |
42 * | | | | TagCache DB Builder | | +---------+ |
43 * | | | +-x-------------x------+ | |
44 * | | | | (R) | (W) | |
45 * | | | | +--x--------x---------+ |
46 * | | | | | Temporary Commit DB | |
47 * | | | | +---------------------+ |
48 * +-x----x-------x--+ |
49 * | TagCache RAM DB x==\(W) +-----------------+ |
50 * +-----------------+ \===x | |
51 * | | | | (R) | Ram DB Loader x============x DirCache
52 * +-x----x---x---x---+ /==x | | (optional)
53 * | Tagcache Disk DB x==/ +-----------------+ |
54 * +------------------+ |
58 /* #define LOGF_ENABLE */
60 #include <stdio.h>
61 #include <stdlib.h>
62 #include <ctype.h>
63 #include "config.h"
64 #include "ata_idle_notify.h"
65 #include "thread.h"
66 #include "kernel.h"
67 #include "system.h"
68 #include "logf.h"
69 #include "string.h"
70 #include "usb.h"
71 #include "metadata.h"
72 #include "tagcache.h"
73 #include "buffer.h"
74 #include "crc32.h"
75 #include "misc.h"
76 #include "settings.h"
77 #include "dir.h"
78 #include "structec.h"
80 #ifndef __PCTOOL__
81 #include "lang.h"
82 #include "eeprom_settings.h"
83 #endif
85 #ifdef __PCTOOL__
86 #define yield() do { } while(0)
87 #define sim_sleep(timeout) do { } while(0)
88 #define do_timed_yield() do { } while(0)
89 #endif
91 #ifndef __PCTOOL__
92 /* Tag Cache thread. */
93 static struct event_queue tagcache_queue;
94 static long tagcache_stack[(DEFAULT_STACK_SIZE + 0x4000)/sizeof(long)];
95 static const char tagcache_thread_name[] = "tagcache";
96 #endif
98 #define UNTAGGED "<Untagged>"
100 /* Previous path when scanning directory tree recursively. */
101 static char curpath[TAG_MAXLEN+32];
103 /* Used when removing duplicates. */
104 static char *tempbuf; /* Allocated when needed. */
105 static long tempbufidx; /* Current location in buffer. */
106 static long tempbuf_size; /* Buffer size (TEMPBUF_SIZE). */
107 static long tempbuf_left; /* Buffer space left. */
108 static long tempbuf_pos;
110 #define SORTED_TAGS_COUNT 8
111 #define TAGCACHE_IS_UNIQUE(tag) (BIT_N(tag) & TAGCACHE_UNIQUE_TAGS)
112 #define TAGCACHE_IS_SORTED(tag) (BIT_N(tag) & TAGCACHE_SORTED_TAGS)
113 #define TAGCACHE_IS_NUMERIC_OR_NONUNIQUE(tag) \
114 (BIT_N(tag) & (TAGCACHE_NUMERIC_TAGS | ~TAGCACHE_UNIQUE_TAGS))
115 /* Tags we want to get sorted (loaded to the tempbuf). */
116 #define TAGCACHE_SORTED_TAGS ((1LU << tag_artist) | (1LU << tag_album) | \
117 (1LU << tag_genre) | (1LU << tag_composer) | (1LU << tag_comment) | \
118 (1LU << tag_albumartist) | (1LU << tag_grouping) | (1LU << tag_title))
120 /* Uniqued tags (we can use these tags with filters and conditional clauses). */
121 #define TAGCACHE_UNIQUE_TAGS ((1LU << tag_artist) | (1LU << tag_album) | \
122 (1LU << tag_genre) | (1LU << tag_composer) | (1LU << tag_comment) | \
123 (1LU << tag_albumartist) | (1LU << tag_grouping))
125 /* String presentation of the tags defined in tagcache.h. Must be in correct order! */
126 static const char *tags_str[] = { "artist", "album", "genre", "title",
127 "filename", "composer", "comment", "albumartist", "grouping", "year",
128 "discnumber", "tracknumber", "bitrate", "length", "playcount", "rating",
129 "playtime", "lastplayed", "commitid", "mtime" };
131 /* Status information of the tagcache. */
132 static struct tagcache_stat tc_stat;
134 /* Queue commands. */
135 enum tagcache_queue {
136 Q_STOP_SCAN = 0,
137 Q_START_SCAN,
138 Q_IMPORT_CHANGELOG,
139 Q_UPDATE,
140 Q_REBUILD,
142 /* Internal tagcache command queue. */
143 CMD_UPDATE_MASTER_HEADER,
144 CMD_UPDATE_NUMERIC,
147 struct tagcache_command_entry {
148 int32_t command;
149 int32_t idx_id;
150 int32_t tag;
151 int32_t data;
154 #ifndef __PCTOOL__
155 static struct tagcache_command_entry command_queue[TAGCACHE_COMMAND_QUEUE_LENGTH];
156 static volatile int command_queue_widx = 0;
157 static volatile int command_queue_ridx = 0;
158 static struct mutex command_queue_mutex;
159 #endif
161 /* Tag database structures. */
163 /* Variable-length tag entry in tag files. */
164 struct tagfile_entry {
165 int32_t tag_length; /* Length of the data in bytes including '\0' */
166 int32_t idx_id; /* Corresponding entry location in index file of not unique tags */
167 char tag_data[0]; /* Begin of the tag data */
170 /* Fixed-size tag entry in master db index. */
171 struct index_entry {
172 int32_t tag_seek[TAG_COUNT]; /* Location of tag data or numeric tag data */
173 int32_t flag; /* Status flags */
176 /* Header is the same in every file. */
177 struct tagcache_header {
178 int32_t magic; /* Header version number */
179 int32_t datasize; /* Data size in bytes */
180 int32_t entry_count; /* Number of entries in this file */
183 struct master_header {
184 struct tagcache_header tch;
185 int32_t serial; /* Increasing counting number */
186 int32_t commitid; /* Number of commits so far */
187 int32_t dirty;
190 /* For the endianess correction */
191 static const char *tagfile_entry_ec = "ll";
193 Note: This should be (1 + TAG_COUNT) amount of l's.
195 static const char *index_entry_ec = "lllllllllllllllllllll";
197 static const char *tagcache_header_ec = "lll";
198 static const char *master_header_ec = "llllll";
200 static struct master_header current_tcmh;
202 #ifdef HAVE_TC_RAMCACHE
203 /* Header is created when loading database to ram. */
204 struct ramcache_header {
205 struct master_header h; /* Header from the master index */
206 struct index_entry *indices; /* Master index file content */
207 char *tags[TAG_COUNT]; /* Tag file content (not including filename tag) */
208 int entry_count[TAG_COUNT]; /* Number of entries in the indices. */
211 # ifdef HAVE_EEPROM_SETTINGS
212 struct statefile_header {
213 struct ramcache_header *hdr;
214 struct tagcache_stat tc_stat;
216 # endif
218 /* Pointer to allocated ramcache_header */
219 static struct ramcache_header *hdr;
220 #endif
222 /**
223 * Full tag entries stored in a temporary file waiting
224 * for commit to the cache. */
225 struct temp_file_entry {
226 long tag_offset[TAG_COUNT];
227 short tag_length[TAG_COUNT];
228 long flag;
230 long data_length;
233 struct tempbuf_id_list {
234 long id;
235 struct tempbuf_id_list *next;
238 struct tempbuf_searchidx {
239 long idx_id;
240 char *str;
241 int seek;
242 struct tempbuf_id_list idlist;
245 /* Lookup buffer for fixing messed up index while after sorting. */
246 static long commit_entry_count;
247 static long lookup_buffer_depth;
248 static struct tempbuf_searchidx **lookup;
250 /* Used when building the temporary file. */
251 static int cachefd = -1, filenametag_fd;
252 static int total_entry_count = 0;
253 static int data_size = 0;
254 static int processed_dir_count;
256 /* Thread safe locking */
257 static volatile int write_lock;
258 static volatile int read_lock;
260 static bool delete_entry(long idx_id);
262 const char* tagcache_tag_to_str(int tag)
264 return tags_str[tag];
267 #ifdef HAVE_DIRCACHE
269 * Returns true if specified flag is still present, i.e., dircache
270 * has not been reloaded.
272 static bool is_dircache_intact(void)
274 return dircache_get_appflag(DIRCACHE_APPFLAG_TAGCACHE);
276 #endif
278 static int open_tag_fd(struct tagcache_header *hdr, int tag, bool write)
280 int fd;
281 char buf[MAX_PATH];
282 int rc;
284 if (TAGCACHE_IS_NUMERIC(tag) || tag < 0 || tag >= TAG_COUNT)
285 return -1;
287 snprintf(buf, sizeof buf, TAGCACHE_FILE_INDEX, tag);
289 fd = open(buf, write ? O_RDWR : O_RDONLY);
290 if (fd < 0)
292 logf("tag file open failed: tag=%d write=%d file=%s", tag, write, buf);
293 tc_stat.ready = false;
294 return fd;
297 /* Check the header. */
298 rc = ecread(fd, hdr, 1, tagcache_header_ec, tc_stat.econ);
299 if (hdr->magic != TAGCACHE_MAGIC || rc != sizeof(struct tagcache_header))
301 logf("header error");
302 tc_stat.ready = false;
303 close(fd);
304 return -2;
307 return fd;
310 static int open_master_fd(struct master_header *hdr, bool write)
312 int fd;
313 int rc;
315 fd = open(TAGCACHE_FILE_MASTER, write ? O_RDWR : O_RDONLY);
316 if (fd < 0)
318 logf("master file open failed for R/W");
319 tc_stat.ready = false;
320 return fd;
323 tc_stat.econ = false;
325 /* Check the header. */
326 rc = read(fd, hdr, sizeof(struct master_header));
327 if (hdr->tch.magic == TAGCACHE_MAGIC && rc == sizeof(struct master_header))
329 /* Success. */
330 return fd;
333 /* Trying to read again, this time with endianess correction enabled. */
334 lseek(fd, 0, SEEK_SET);
336 rc = ecread(fd, hdr, 1, master_header_ec, true);
337 if (hdr->tch.magic != TAGCACHE_MAGIC || rc != sizeof(struct master_header))
339 logf("header error");
340 tc_stat.ready = false;
341 close(fd);
342 return -2;
345 tc_stat.econ = true;
347 return fd;
350 #ifndef __PCTOOL__
351 static bool do_timed_yield(void)
353 /* Sorting can lock up for quite a while, so yield occasionally */
354 static long wakeup_tick = 0;
355 if (current_tick >= wakeup_tick)
357 wakeup_tick = current_tick + (HZ/4);
358 yield();
359 return true;
361 return false;
363 #endif
365 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
366 static long find_entry_ram(const char *filename,
367 const struct dirent *dc)
369 static long last_pos = 0;
370 int i;
372 /* Check if we tagcache is loaded into ram. */
373 if (!tc_stat.ramcache)
374 return -1;
376 if (dc == NULL)
377 dc = dircache_get_entry_ptr(filename);
379 if (dc == NULL)
381 logf("tagcache: file not found.");
382 return -1;
385 try_again:
387 if (last_pos > 0)
388 i = last_pos;
389 else
390 i = 0;
392 for (; i < hdr->h.tch.entry_count; i++)
394 if (hdr->indices[i].tag_seek[tag_filename] == (long)dc)
396 last_pos = MAX(0, i - 3);
397 return i;
400 do_timed_yield();
403 if (last_pos > 0)
405 last_pos = 0;
406 goto try_again;
409 return -1;
411 #endif
413 static long find_entry_disk(const char *filename, bool localfd)
415 struct tagcache_header tch;
416 static long last_pos = -1;
417 long pos_history[POS_HISTORY_COUNT];
418 long pos_history_idx = 0;
419 bool found = false;
420 struct tagfile_entry tfe;
421 int fd;
422 char buf[TAG_MAXLEN+32];
423 int i;
424 int pos = -1;
426 if (!tc_stat.ready)
427 return -2;
429 fd = filenametag_fd;
430 if (fd < 0 || localfd)
432 last_pos = -1;
433 if ( (fd = open_tag_fd(&tch, tag_filename, false)) < 0)
434 return -1;
437 check_again:
439 if (last_pos > 0)
440 lseek(fd, last_pos, SEEK_SET);
441 else
442 lseek(fd, sizeof(struct tagcache_header), SEEK_SET);
444 while (true)
446 pos = lseek(fd, 0, SEEK_CUR);
447 for (i = pos_history_idx-1; i >= 0; i--)
448 pos_history[i+1] = pos_history[i];
449 pos_history[0] = pos;
451 if (ecread(fd, &tfe, 1, tagfile_entry_ec, tc_stat.econ)
452 != sizeof(struct tagfile_entry))
454 break ;
457 if (tfe.tag_length >= (long)sizeof(buf))
459 logf("too long tag #1");
460 close(fd);
461 if (!localfd)
462 filenametag_fd = -1;
463 last_pos = -1;
464 return -2;
467 if (read(fd, buf, tfe.tag_length) != tfe.tag_length)
469 logf("read error #2");
470 close(fd);
471 if (!localfd)
472 filenametag_fd = -1;
473 last_pos = -1;
474 return -3;
477 if (!strcasecmp(filename, buf))
479 last_pos = pos_history[pos_history_idx];
480 found = true;
481 break ;
484 if (pos_history_idx < POS_HISTORY_COUNT - 1)
485 pos_history_idx++;
488 /* Not found? */
489 if (!found)
491 if (last_pos > 0)
493 last_pos = -1;
494 logf("seek again");
495 goto check_again;
498 if (fd != filenametag_fd || localfd)
499 close(fd);
500 return -4;
503 if (fd != filenametag_fd || localfd)
504 close(fd);
506 return tfe.idx_id;
509 static int find_index(const char *filename)
511 long idx_id = -1;
513 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
514 if (tc_stat.ramcache && is_dircache_intact())
515 idx_id = find_entry_ram(filename, NULL);
516 #endif
518 if (idx_id < 0)
519 idx_id = find_entry_disk(filename, true);
521 return idx_id;
524 bool tagcache_find_index(struct tagcache_search *tcs, const char *filename)
526 int idx_id;
528 if (!tc_stat.ready)
529 return false;
531 idx_id = find_index(filename);
532 if (idx_id < 0)
533 return false;
535 if (!tagcache_search(tcs, tag_filename))
536 return false;
538 tcs->entry_count = 0;
539 tcs->idx_id = idx_id;
541 return true;
544 static bool get_index(int masterfd, int idxid,
545 struct index_entry *idx, bool use_ram)
547 bool localfd = false;
549 if (idxid < 0)
551 logf("Incorrect idxid: %d", idxid);
552 return false;
555 #ifdef HAVE_TC_RAMCACHE
556 if (tc_stat.ramcache && use_ram)
558 if (hdr->indices[idxid].flag & FLAG_DELETED)
559 return false;
561 # ifdef HAVE_DIRCACHE
562 if (!(hdr->indices[idxid].flag & FLAG_DIRCACHE)
563 || is_dircache_intact())
564 #endif
566 memcpy(idx, &hdr->indices[idxid], sizeof(struct index_entry));
567 return true;
570 #else
571 (void)use_ram;
572 #endif
574 if (masterfd < 0)
576 struct master_header tcmh;
578 localfd = true;
579 masterfd = open_master_fd(&tcmh, false);
580 if (masterfd < 0)
581 return false;
584 lseek(masterfd, idxid * sizeof(struct index_entry)
585 + sizeof(struct master_header), SEEK_SET);
586 if (ecread(masterfd, idx, 1, index_entry_ec, tc_stat.econ)
587 != sizeof(struct index_entry))
589 logf("read error #3");
590 if (localfd)
591 close(masterfd);
593 return false;
596 if (localfd)
597 close(masterfd);
599 if (idx->flag & FLAG_DELETED)
600 return false;
602 return true;
605 #ifndef __PCTOOL__
607 static bool write_index(int masterfd, int idxid, struct index_entry *idx)
609 /* We need to exclude all memory only flags & tags when writing to disk. */
610 if (idx->flag & FLAG_DIRCACHE)
612 logf("memory only flags!");
613 return false;
616 #ifdef HAVE_TC_RAMCACHE
617 /* Only update numeric data. Writing the whole index to RAM by memcpy
618 * destroys dircache pointers!
620 if (tc_stat.ramcache)
622 int tag;
623 struct index_entry *idx_ram = &hdr->indices[idxid];
625 for (tag = 0; tag < TAG_COUNT; tag++)
627 if (TAGCACHE_IS_NUMERIC(tag))
629 idx_ram->tag_seek[tag] = idx->tag_seek[tag];
633 /* Don't touch the dircache flag or attributes. */
634 idx_ram->flag = (idx->flag & 0x0000ffff)
635 | (idx_ram->flag & (0xffff0000 | FLAG_DIRCACHE));
637 #endif
639 lseek(masterfd, idxid * sizeof(struct index_entry)
640 + sizeof(struct master_header), SEEK_SET);
641 if (ecwrite(masterfd, idx, 1, index_entry_ec, tc_stat.econ)
642 != sizeof(struct index_entry))
644 logf("write error #3");
645 logf("idxid: %d", idxid);
646 return false;
649 return true;
652 #endif /* !__PCTOOL__ */
654 static bool open_files(struct tagcache_search *tcs, int tag)
656 if (tcs->idxfd[tag] < 0)
658 char fn[MAX_PATH];
660 snprintf(fn, sizeof fn, TAGCACHE_FILE_INDEX, tag);
661 tcs->idxfd[tag] = open(fn, O_RDONLY);
664 if (tcs->idxfd[tag] < 0)
666 logf("File not open!");
667 return false;
670 return true;
673 static bool retrieve(struct tagcache_search *tcs, struct index_entry *idx,
674 int tag, char *buf, long size)
676 struct tagfile_entry tfe;
677 long seek;
679 *buf = '\0';
681 if (TAGCACHE_IS_NUMERIC(tag))
682 return false;
684 seek = idx->tag_seek[tag];
685 if (seek < 0)
687 logf("Retrieve failed");
688 return false;
691 #ifdef HAVE_TC_RAMCACHE
692 if (tcs->ramsearch)
694 struct tagfile_entry *ep;
696 # ifdef HAVE_DIRCACHE
697 if (tag == tag_filename && (idx->flag & FLAG_DIRCACHE)
698 && is_dircache_intact())
700 dircache_copy_path((struct dirent *)seek,
701 buf, size);
702 return true;
704 else
705 # endif
706 if (tag != tag_filename)
708 ep = (struct tagfile_entry *)&hdr->tags[tag][seek];
709 strncpy(buf, ep->tag_data, size-1);
711 return true;
714 #endif
716 if (!open_files(tcs, tag))
717 return false;
719 lseek(tcs->idxfd[tag], seek, SEEK_SET);
720 if (ecread(tcs->idxfd[tag], &tfe, 1, tagfile_entry_ec, tc_stat.econ)
721 != sizeof(struct tagfile_entry))
723 logf("read error #5");
724 return false;
727 if (tfe.tag_length >= size)
729 logf("too small buffer");
730 return false;
733 if (read(tcs->idxfd[tag], buf, tfe.tag_length) !=
734 tfe.tag_length)
736 logf("read error #6");
737 return false;
740 buf[tfe.tag_length] = '\0';
742 return true;
745 static long check_virtual_tags(int tag, const struct index_entry *idx)
747 long data = 0;
749 switch (tag)
751 case tag_virt_length_sec:
752 data = (idx->tag_seek[tag_length]/1000) % 60;
753 break;
755 case tag_virt_length_min:
756 data = (idx->tag_seek[tag_length]/1000) / 60;
757 break;
759 case tag_virt_playtime_sec:
760 data = (idx->tag_seek[tag_playtime]/1000) % 60;
761 break;
763 case tag_virt_playtime_min:
764 data = (idx->tag_seek[tag_playtime]/1000) / 60;
765 break;
767 case tag_virt_autoscore:
768 if (idx->tag_seek[tag_length] == 0
769 || idx->tag_seek[tag_playcount] == 0)
771 data = 0;
773 else
775 data = 100 * idx->tag_seek[tag_playtime]
776 / idx->tag_seek[tag_length]
777 / idx->tag_seek[tag_playcount];
779 break;
781 /* How many commits before the file has been added to the DB. */
782 case tag_virt_entryage:
783 data = current_tcmh.commitid - idx->tag_seek[tag_commitid] - 1;
784 break;
786 default:
787 data = idx->tag_seek[tag];
790 return data;
793 long tagcache_get_numeric(const struct tagcache_search *tcs, int tag)
795 struct index_entry idx;
797 if (!tc_stat.ready)
798 return false;
800 if (!TAGCACHE_IS_NUMERIC(tag))
801 return -1;
803 if (!get_index(tcs->masterfd, tcs->idx_id, &idx, true))
804 return -2;
806 return check_virtual_tags(tag, &idx);
809 inline static bool str_ends_with(const char *str1, const char *str2)
811 int str_len = strlen(str1);
812 int clause_len = strlen(str2);
814 if (clause_len > str_len)
815 return false;
817 return !strcasecmp(&str1[str_len - clause_len], str2);
820 inline static bool str_oneof(const char *str, const char *list)
822 const char *sep;
823 int l, len = strlen(str);
825 while (*list)
827 sep = strchr(list, '|');
828 l = sep ? (long)sep - (long)list : (int)strlen(list);
829 if ((l==len) && !strncasecmp(str, list, len))
830 return true;
831 list += sep ? l + 1 : l;
834 return false;
837 static bool check_against_clause(long numeric, const char *str,
838 const struct tagcache_search_clause *clause)
840 if (clause->numeric)
842 switch (clause->type)
844 case clause_is:
845 return numeric == clause->numeric_data;
846 case clause_is_not:
847 return numeric != clause->numeric_data;
848 case clause_gt:
849 return numeric > clause->numeric_data;
850 case clause_gteq:
851 return numeric >= clause->numeric_data;
852 case clause_lt:
853 return numeric < clause->numeric_data;
854 case clause_lteq:
855 return numeric <= clause->numeric_data;
856 default:
857 logf("Incorrect numeric tag: %d", clause->type);
860 else
862 switch (clause->type)
864 case clause_is:
865 return !strcasecmp(clause->str, str);
866 case clause_is_not:
867 return strcasecmp(clause->str, str);
868 case clause_gt:
869 return 0>strcasecmp(clause->str, str);
870 case clause_gteq:
871 return 0>=strcasecmp(clause->str, str);
872 case clause_lt:
873 return 0<strcasecmp(clause->str, str);
874 case clause_lteq:
875 return 0<=strcasecmp(clause->str, str);
876 case clause_contains:
877 return (strcasestr(str, clause->str) != NULL);
878 case clause_not_contains:
879 return (strcasestr(str, clause->str) == NULL);
880 case clause_begins_with:
881 return (strcasestr(str, clause->str) == str);
882 case clause_not_begins_with:
883 return (strcasestr(str, clause->str) != str);
884 case clause_ends_with:
885 return str_ends_with(str, clause->str);
886 case clause_not_ends_with:
887 return !str_ends_with(str, clause->str);
888 case clause_oneof:
889 return str_oneof(str, clause->str);
891 default:
892 logf("Incorrect tag: %d", clause->type);
896 return false;
899 static bool check_clauses(struct tagcache_search *tcs,
900 struct index_entry *idx,
901 struct tagcache_search_clause **clause, int count)
903 int i;
905 #ifdef HAVE_TC_RAMCACHE
906 if (tcs->ramsearch)
908 /* Go through all conditional clauses. */
909 for (i = 0; i < count; i++)
911 struct tagfile_entry *tfe;
912 int seek;
913 char buf[256];
914 char *str = NULL;
916 seek = check_virtual_tags(clause[i]->tag, idx);
918 if (!TAGCACHE_IS_NUMERIC(clause[i]->tag))
920 if (clause[i]->tag == tag_filename)
922 retrieve(tcs, idx, tag_filename, buf, sizeof buf);
923 str = buf;
925 else
927 tfe = (struct tagfile_entry *)&hdr->tags[clause[i]->tag][seek];
928 str = tfe->tag_data;
932 if (!check_against_clause(seek, str, clause[i]))
933 return false;
936 else
937 #endif
939 /* Check for conditions. */
940 for (i = 0; i < count; i++)
942 struct tagfile_entry tfe;
943 int seek;
944 char str[256];
946 seek = check_virtual_tags(clause[i]->tag, idx);
948 memset(str, 0, sizeof str);
949 if (!TAGCACHE_IS_NUMERIC(clause[i]->tag))
951 int fd = tcs->idxfd[clause[i]->tag];
952 lseek(fd, seek, SEEK_SET);
953 ecread(fd, &tfe, 1, tagfile_entry_ec, tc_stat.econ);
954 if (tfe.tag_length >= (int)sizeof(str))
956 logf("Too long tag read!");
957 break ;
960 read(fd, str, tfe.tag_length);
962 /* Check if entry has been deleted. */
963 if (str[0] == '\0')
964 break;
967 if (!check_against_clause(seek, str, clause[i]))
968 return false;
972 return true;
975 bool tagcache_check_clauses(struct tagcache_search *tcs,
976 struct tagcache_search_clause **clause, int count)
978 struct index_entry idx;
980 if (count == 0)
981 return true;
983 if (!get_index(tcs->masterfd, tcs->idx_id, &idx, true))
984 return false;
986 return check_clauses(tcs, &idx, clause, count);
989 static bool add_uniqbuf(struct tagcache_search *tcs, unsigned long id)
991 int i;
993 /* If uniq buffer is not defined we must return true for search to work. */
994 if (tcs->unique_list == NULL || (!TAGCACHE_IS_UNIQUE(tcs->type)
995 && !TAGCACHE_IS_NUMERIC(tcs->type)))
997 return true;
1000 for (i = 0; i < tcs->unique_list_count; i++)
1002 /* Return false if entry is found. */
1003 if (tcs->unique_list[i] == id)
1004 return false;
1007 if (tcs->unique_list_count < tcs->unique_list_capacity)
1009 tcs->unique_list[i] = id;
1010 tcs->unique_list_count++;
1013 return true;
1016 static bool build_lookup_list(struct tagcache_search *tcs)
1018 struct index_entry entry;
1019 int i, j;
1021 tcs->seek_list_count = 0;
1023 #ifdef HAVE_TC_RAMCACHE
1024 if (tcs->ramsearch
1025 # ifdef HAVE_DIRCACHE
1026 && (tcs->type != tag_filename || is_dircache_intact())
1027 # endif
1030 for (i = tcs->seek_pos; i < hdr->h.tch.entry_count; i++)
1032 struct tagcache_seeklist_entry *seeklist;
1033 struct index_entry *idx = &hdr->indices[i];
1034 if (tcs->seek_list_count == SEEK_LIST_SIZE)
1035 break ;
1037 /* Skip deleted files. */
1038 if (idx->flag & FLAG_DELETED)
1039 continue;
1041 /* Go through all filters.. */
1042 for (j = 0; j < tcs->filter_count; j++)
1044 if (idx->tag_seek[tcs->filter_tag[j]] != tcs->filter_seek[j])
1046 break ;
1050 if (j < tcs->filter_count)
1051 continue ;
1053 /* Check for conditions. */
1054 if (!check_clauses(tcs, idx, tcs->clause, tcs->clause_count))
1055 continue;
1057 /* Add to the seek list if not already in uniq buffer. */
1058 if (!add_uniqbuf(tcs, idx->tag_seek[tcs->type]))
1059 continue;
1061 /* Lets add it. */
1062 seeklist = &tcs->seeklist[tcs->seek_list_count];
1063 seeklist->seek = idx->tag_seek[tcs->type];
1064 seeklist->flag = idx->flag;
1065 seeklist->idx_id = i;
1066 tcs->seek_list_count++;
1069 tcs->seek_pos = i;
1071 return tcs->seek_list_count > 0;
1073 #endif
1075 if (tcs->masterfd < 0)
1077 struct master_header tcmh;
1078 tcs->masterfd = open_master_fd(&tcmh, false);
1081 lseek(tcs->masterfd, tcs->seek_pos * sizeof(struct index_entry) +
1082 sizeof(struct master_header), SEEK_SET);
1084 while (ecread(tcs->masterfd, &entry, 1, index_entry_ec, tc_stat.econ)
1085 == sizeof(struct index_entry))
1087 struct tagcache_seeklist_entry *seeklist;
1089 if (tcs->seek_list_count == SEEK_LIST_SIZE)
1090 break ;
1092 i = tcs->seek_pos;
1093 tcs->seek_pos++;
1095 /* Check if entry has been deleted. */
1096 if (entry.flag & FLAG_DELETED)
1097 continue;
1099 /* Go through all filters.. */
1100 for (j = 0; j < tcs->filter_count; j++)
1102 if (entry.tag_seek[tcs->filter_tag[j]] != tcs->filter_seek[j])
1103 break ;
1106 if (j < tcs->filter_count)
1107 continue ;
1109 /* Check for conditions. */
1110 if (!check_clauses(tcs, &entry, tcs->clause, tcs->clause_count))
1111 continue;
1113 /* Add to the seek list if not already in uniq buffer. */
1114 if (!add_uniqbuf(tcs, entry.tag_seek[tcs->type]))
1115 continue;
1117 /* Lets add it. */
1118 seeklist = &tcs->seeklist[tcs->seek_list_count];
1119 seeklist->seek = entry.tag_seek[tcs->type];
1120 seeklist->flag = entry.flag;
1121 seeklist->idx_id = i;
1122 tcs->seek_list_count++;
1124 yield();
1127 return tcs->seek_list_count > 0;
1131 static void remove_files(void)
1133 int i;
1134 char buf[MAX_PATH];
1136 tc_stat.ready = false;
1137 tc_stat.ramcache = false;
1138 tc_stat.econ = false;
1139 remove(TAGCACHE_FILE_MASTER);
1140 for (i = 0; i < TAG_COUNT; i++)
1142 if (TAGCACHE_IS_NUMERIC(i))
1143 continue;
1145 snprintf(buf, sizeof buf, TAGCACHE_FILE_INDEX, i);
1146 remove(buf);
1151 static bool check_all_headers(void)
1153 struct master_header myhdr;
1154 struct tagcache_header tch;
1155 int tag;
1156 int fd;
1158 if ( (fd = open_master_fd(&myhdr, false)) < 0)
1159 return false;
1161 close(fd);
1162 if (myhdr.dirty)
1164 logf("tagcache is dirty!");
1165 return false;
1168 memcpy(&current_tcmh, &myhdr, sizeof(struct master_header));
1170 for (tag = 0; tag < TAG_COUNT; tag++)
1172 if (TAGCACHE_IS_NUMERIC(tag))
1173 continue;
1175 if ( (fd = open_tag_fd(&tch, tag, false)) < 0)
1176 return false;
1178 close(fd);
1181 return true;
1184 bool tagcache_is_busy(void)
1186 return read_lock || write_lock;
1189 bool tagcache_search(struct tagcache_search *tcs, int tag)
1191 struct tagcache_header tag_hdr;
1192 struct master_header master_hdr;
1193 int i;
1195 while (read_lock)
1196 sleep(1);
1198 memset(tcs, 0, sizeof(struct tagcache_search));
1199 if (tc_stat.commit_step > 0 || !tc_stat.ready)
1200 return false;
1202 tcs->position = sizeof(struct tagcache_header);
1203 tcs->type = tag;
1204 tcs->seek_pos = 0;
1205 tcs->list_position = 0;
1206 tcs->seek_list_count = 0;
1207 tcs->filter_count = 0;
1208 tcs->masterfd = -1;
1210 for (i = 0; i < TAG_COUNT; i++)
1211 tcs->idxfd[i] = -1;
1213 #ifndef HAVE_TC_RAMCACHE
1214 tcs->ramsearch = false;
1215 #else
1216 tcs->ramsearch = tc_stat.ramcache;
1217 if (tcs->ramsearch)
1219 tcs->entry_count = hdr->entry_count[tcs->type];
1221 else
1222 #endif
1224 /* Always open as R/W so we can pass tcs to functions that modify data also
1225 * without failing. */
1226 tcs->masterfd = open_master_fd(&master_hdr, true);
1227 if (tcs->masterfd < 0)
1228 return false;
1230 if (!TAGCACHE_IS_NUMERIC(tcs->type))
1232 tcs->idxfd[tcs->type] = open_tag_fd(&tag_hdr, tcs->type, false);
1233 if (tcs->idxfd[tcs->type] < 0)
1234 return false;
1236 tcs->entry_count = tag_hdr.entry_count;
1238 else
1240 tcs->entry_count = master_hdr.tch.entry_count;
1244 tcs->valid = true;
1245 tcs->initialized = true;
1246 write_lock++;
1248 return true;
1251 void tagcache_search_set_uniqbuf(struct tagcache_search *tcs,
1252 void *buffer, long length)
1254 tcs->unique_list = (unsigned long *)buffer;
1255 tcs->unique_list_capacity = length / sizeof(*tcs->unique_list);
1256 tcs->unique_list_count = 0;
1259 bool tagcache_search_add_filter(struct tagcache_search *tcs,
1260 int tag, int seek)
1262 if (tcs->filter_count == TAGCACHE_MAX_FILTERS)
1263 return false;
1265 if (TAGCACHE_IS_NUMERIC_OR_NONUNIQUE(tag))
1266 return false;
1268 tcs->filter_tag[tcs->filter_count] = tag;
1269 tcs->filter_seek[tcs->filter_count] = seek;
1270 tcs->filter_count++;
1272 return true;
1275 bool tagcache_search_add_clause(struct tagcache_search *tcs,
1276 struct tagcache_search_clause *clause)
1278 int i;
1280 if (tcs->clause_count >= TAGCACHE_MAX_CLAUSES)
1282 logf("Too many clauses");
1283 return false;
1286 /* Check if there is already a similar filter in present (filters are
1287 * much faster than clauses).
1289 for (i = 0; i < tcs->filter_count; i++)
1291 if (tcs->filter_tag[i] == clause->tag)
1292 return true;
1295 if (!TAGCACHE_IS_NUMERIC(clause->tag) && tcs->idxfd[clause->tag] < 0)
1297 char buf[MAX_PATH];
1299 snprintf(buf, sizeof buf, TAGCACHE_FILE_INDEX, clause->tag);
1300 tcs->idxfd[clause->tag] = open(buf, O_RDONLY);
1303 tcs->clause[tcs->clause_count] = clause;
1304 tcs->clause_count++;
1306 return true;
1309 static bool get_next(struct tagcache_search *tcs)
1311 static char buf[TAG_MAXLEN+32];
1312 struct tagfile_entry entry;
1313 long flag = 0;
1315 if (!tcs->valid || !tc_stat.ready)
1316 return false;
1318 if (tcs->idxfd[tcs->type] < 0 && !TAGCACHE_IS_NUMERIC(tcs->type)
1319 #ifdef HAVE_TC_RAMCACHE
1320 && !tcs->ramsearch
1321 #endif
1323 return false;
1325 /* Relative fetch. */
1326 if (tcs->filter_count > 0 || tcs->clause_count > 0
1327 || TAGCACHE_IS_NUMERIC(tcs->type)
1328 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1329 /* We need to retrieve flag status for dircache. */
1330 || (tcs->ramsearch && tcs->type == tag_filename)
1331 #endif
1334 struct tagcache_seeklist_entry *seeklist;
1336 /* Check for end of list. */
1337 if (tcs->list_position == tcs->seek_list_count)
1339 tcs->list_position = 0;
1341 /* Try to fetch more. */
1342 if (!build_lookup_list(tcs))
1344 tcs->valid = false;
1345 return false;
1349 seeklist = &tcs->seeklist[tcs->list_position];
1350 flag = seeklist->flag;
1351 tcs->position = seeklist->seek;
1352 tcs->idx_id = seeklist->idx_id;
1353 tcs->list_position++;
1355 else
1357 if (tcs->entry_count == 0)
1359 tcs->valid = false;
1360 return false;
1363 tcs->entry_count--;
1366 tcs->result_seek = tcs->position;
1368 if (TAGCACHE_IS_NUMERIC(tcs->type))
1370 snprintf(buf, sizeof(buf), "%d", tcs->position);
1371 tcs->result = buf;
1372 tcs->result_len = strlen(buf) + 1;
1373 return true;
1376 /* Direct fetch. */
1377 #ifdef HAVE_TC_RAMCACHE
1378 if (tcs->ramsearch)
1381 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1382 if (tcs->type == tag_filename && (flag & FLAG_DIRCACHE)
1383 && is_dircache_intact())
1385 dircache_copy_path((struct dirent *)tcs->position,
1386 buf, sizeof buf);
1387 tcs->result = buf;
1388 tcs->result_len = strlen(buf) + 1;
1389 tcs->ramresult = false;
1391 return true;
1393 else
1394 #endif
1395 if (tcs->type != tag_filename)
1397 struct tagfile_entry *ep;
1399 ep = (struct tagfile_entry *)&hdr->tags[tcs->type][tcs->position];
1400 tcs->result = ep->tag_data;
1401 tcs->result_len = strlen(tcs->result) + 1;
1402 tcs->idx_id = ep->idx_id;
1403 tcs->ramresult = true;
1405 /* Increase position for the next run. This may get overwritten. */
1406 tcs->position += sizeof(struct tagfile_entry) + ep->tag_length;
1408 return true;
1411 #endif
1413 if (!open_files(tcs, tcs->type))
1415 tcs->valid = false;
1416 return false;
1419 /* Seek stream to the correct position and continue to direct fetch. */
1420 lseek(tcs->idxfd[tcs->type], tcs->position, SEEK_SET);
1422 if (ecread(tcs->idxfd[tcs->type], &entry, 1,
1423 tagfile_entry_ec, tc_stat.econ) != sizeof(struct tagfile_entry))
1425 logf("read error #5");
1426 tcs->valid = false;
1427 return false;
1430 if (entry.tag_length > (long)sizeof(buf))
1432 tcs->valid = false;
1433 logf("too long tag #2");
1434 logf("P:%X/%X", tcs->position, entry.tag_length);
1435 return false;
1438 if (read(tcs->idxfd[tcs->type], buf, entry.tag_length) != entry.tag_length)
1440 tcs->valid = false;
1441 logf("read error #4");
1442 return false;
1446 Update the position for the next read (this may be overridden
1447 if filters or clauses are being used).
1449 tcs->position += sizeof(struct tagfile_entry) + entry.tag_length;
1450 tcs->result = buf;
1451 tcs->result_len = strlen(tcs->result) + 1;
1452 tcs->idx_id = entry.idx_id;
1453 tcs->ramresult = false;
1455 return true;
1458 bool tagcache_get_next(struct tagcache_search *tcs)
1460 while (get_next(tcs))
1462 if (tcs->result_len > 1)
1463 return true;
1466 return false;
1469 bool tagcache_retrieve(struct tagcache_search *tcs, int idxid,
1470 int tag, char *buf, long size)
1472 struct index_entry idx;
1474 *buf = '\0';
1475 if (!get_index(tcs->masterfd, idxid, &idx, true))
1476 return false;
1478 return retrieve(tcs, &idx, tag, buf, size);
1481 static bool update_master_header(void)
1483 struct master_header myhdr;
1484 int fd;
1486 if (!tc_stat.ready)
1487 return false;
1489 if ( (fd = open_master_fd(&myhdr, true)) < 0)
1490 return false;
1492 myhdr.serial = current_tcmh.serial;
1493 myhdr.commitid = current_tcmh.commitid;
1494 myhdr.dirty = current_tcmh.dirty;
1496 /* Write it back */
1497 lseek(fd, 0, SEEK_SET);
1498 ecwrite(fd, &myhdr, 1, master_header_ec, tc_stat.econ);
1499 close(fd);
1501 #ifdef HAVE_TC_RAMCACHE
1502 if (hdr)
1504 hdr->h.serial = current_tcmh.serial;
1505 hdr->h.commitid = current_tcmh.commitid;
1506 hdr->h.dirty = current_tcmh.dirty;
1508 #endif
1510 return true;
1513 #if 0
1515 void tagcache_modify(struct tagcache_search *tcs, int type, const char *text)
1517 struct tagentry *entry;
1519 if (tcs->type != tag_title)
1520 return ;
1522 /* We will need reserve buffer for this. */
1523 if (tcs->ramcache)
1525 struct tagfile_entry *ep;
1527 ep = (struct tagfile_entry *)&hdr->tags[tcs->type][tcs->result_seek];
1528 tcs->seek_list[tcs->seek_list_count];
1531 entry = find_entry_ram();
1534 #endif
1536 void tagcache_search_finish(struct tagcache_search *tcs)
1538 int i;
1540 if (!tcs->initialized)
1541 return;
1543 if (tcs->masterfd >= 0)
1545 close(tcs->masterfd);
1546 tcs->masterfd = -1;
1549 for (i = 0; i < TAG_COUNT; i++)
1551 if (tcs->idxfd[i] >= 0)
1553 close(tcs->idxfd[i]);
1554 tcs->idxfd[i] = -1;
1558 tcs->ramsearch = false;
1559 tcs->valid = false;
1560 tcs->initialized = 0;
1561 if (write_lock > 0)
1562 write_lock--;
1565 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1566 static struct tagfile_entry *get_tag(const struct index_entry *entry, int tag)
1568 return (struct tagfile_entry *)&hdr->tags[tag][entry->tag_seek[tag]];
1571 static long get_tag_numeric(const struct index_entry *entry, int tag)
1573 return check_virtual_tags(tag, entry);
1576 static char* get_tag_string(const struct index_entry *entry, int tag)
1578 char* s = get_tag(entry, tag)->tag_data;
1579 return strcmp(s, UNTAGGED) ? s : NULL;
1582 bool tagcache_fill_tags(struct mp3entry *id3, const char *filename)
1584 struct index_entry *entry;
1585 int idx_id;
1587 if (!tc_stat.ready || !tc_stat.ramcache)
1588 return false;
1590 /* Find the corresponding entry in tagcache. */
1591 idx_id = find_entry_ram(filename, NULL);
1592 if (idx_id < 0)
1593 return false;
1595 entry = &hdr->indices[idx_id];
1597 id3->title = get_tag_string(entry, tag_title);
1598 id3->artist = get_tag_string(entry, tag_artist);
1599 id3->album = get_tag_string(entry, tag_album);
1600 id3->genre_string = get_tag_string(entry, tag_genre);
1601 id3->composer = get_tag_string(entry, tag_composer);
1602 id3->comment = get_tag_string(entry, tag_comment);
1603 id3->albumartist = get_tag_string(entry, tag_albumartist);
1604 id3->grouping = get_tag_string(entry, tag_grouping);
1606 id3->playcount = get_tag_numeric(entry, tag_playcount);
1607 id3->rating = get_tag_numeric(entry, tag_rating);
1608 id3->lastplayed = get_tag_numeric(entry, tag_lastplayed);
1609 id3->score = get_tag_numeric(entry, tag_virt_autoscore) / 10;
1610 id3->year = get_tag_numeric(entry, tag_year);
1612 id3->discnum = get_tag_numeric(entry, tag_discnumber);
1613 id3->tracknum = get_tag_numeric(entry, tag_tracknumber);
1614 id3->bitrate = get_tag_numeric(entry, tag_bitrate);
1615 if (id3->bitrate == 0)
1616 id3->bitrate = 1;
1618 return true;
1620 #endif
1622 static inline void write_item(const char *item)
1624 int len = strlen(item) + 1;
1626 data_size += len;
1627 write(cachefd, item, len);
1630 static int check_if_empty(char **tag)
1632 int length;
1634 if (*tag == NULL || **tag == '\0')
1636 *tag = UNTAGGED;
1637 return sizeof(UNTAGGED); /* Tag length */
1640 length = strlen(*tag);
1641 if (length > TAG_MAXLEN)
1643 logf("over length tag: %s", *tag);
1644 length = TAG_MAXLEN;
1645 (*tag)[length] = '\0';
1648 return length + 1;
1651 #define ADD_TAG(entry,tag,data) \
1652 /* Adding tag */ \
1653 entry.tag_offset[tag] = offset; \
1654 entry.tag_length[tag] = check_if_empty(data); \
1655 offset += entry.tag_length[tag]
1656 /* GCC 3.4.6 for Coldfire can choose to inline this function. Not a good
1657 * idea, as it uses lots of stack and is called from a recursive function
1658 * (check_dir).
1660 static void __attribute__ ((noinline)) add_tagcache(char *path,
1661 unsigned long mtime
1662 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1663 ,const struct dirent *dc
1664 #endif
1667 struct mp3entry id3;
1668 struct temp_file_entry entry;
1669 bool ret;
1670 int fd;
1671 int idx_id = -1;
1672 char tracknumfix[3];
1673 int offset = 0;
1674 int path_length = strlen(path);
1675 bool has_albumartist;
1676 bool has_grouping;
1678 #ifdef SIMULATOR
1679 /* Crude logging for the sim - to aid in debugging */
1680 int logfd = open(ROCKBOX_DIR "/database.log",
1681 O_WRONLY | O_APPEND | O_CREAT);
1682 if (logfd >= 0) {
1683 write(logfd, path, strlen(path));
1684 write(logfd, "\n", 1);
1685 close(logfd);
1687 #endif
1689 if (cachefd < 0)
1690 return ;
1692 /* Check for overlength file path. */
1693 if (path_length > TAG_MAXLEN)
1695 /* Path can't be shortened. */
1696 logf("Too long path: %s", path);
1697 return ;
1700 /* Check if the file is supported. */
1701 if (probe_file_format(path) == AFMT_UNKNOWN)
1702 return ;
1704 /* Check if the file is already cached. */
1705 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1706 if (tc_stat.ramcache && is_dircache_intact())
1708 idx_id = find_entry_ram(path, dc);
1710 #endif
1712 /* Be sure the entry doesn't exist. */
1713 if (filenametag_fd >= 0 && idx_id < 0)
1714 idx_id = find_entry_disk(path, false);
1716 /* Check if file has been modified. */
1717 if (idx_id >= 0)
1719 struct index_entry idx;
1721 /* TODO: Mark that the index exists (for fast reverse scan) */
1722 //found_idx[idx_id/8] |= idx_id%8;
1724 if (!get_index(-1, idx_id, &idx, true))
1726 logf("failed to retrieve index entry");
1727 return ;
1730 if ((unsigned long)idx.tag_seek[tag_mtime] == mtime)
1732 /* No changes to file. */
1733 return ;
1736 /* Metadata might have been changed. Delete the entry. */
1737 logf("Re-adding: %s", path);
1738 if (!delete_entry(idx_id))
1740 logf("delete_entry failed: %d", idx_id);
1741 return ;
1745 fd = open(path, O_RDONLY);
1746 if (fd < 0)
1748 logf("open fail: %s", path);
1749 return ;
1752 memset(&id3, 0, sizeof(struct mp3entry));
1753 memset(&entry, 0, sizeof(struct temp_file_entry));
1754 memset(&tracknumfix, 0, sizeof(tracknumfix));
1755 ret = get_metadata(&id3, fd, path);
1756 close(fd);
1758 if (!ret)
1759 return ;
1761 logf("-> %s", path);
1763 /* Generate track number if missing. */
1764 if (id3.tracknum <= 0)
1766 const char *p = strrchr(path, '.');
1768 if (p == NULL)
1769 p = &path[strlen(path)-1];
1771 while (*p != '/')
1773 if (isdigit(*p) && isdigit(*(p-1)))
1775 tracknumfix[1] = *p--;
1776 tracknumfix[0] = *p;
1777 break;
1779 p--;
1782 if (tracknumfix[0] != '\0')
1784 id3.tracknum = atoi(tracknumfix);
1785 /* Set a flag to indicate track number has been generated. */
1786 entry.flag |= FLAG_TRKNUMGEN;
1788 else
1790 /* Unable to generate track number. */
1791 id3.tracknum = -1;
1795 /* Numeric tags */
1796 entry.tag_offset[tag_year] = id3.year;
1797 entry.tag_offset[tag_discnumber] = id3.discnum;
1798 entry.tag_offset[tag_tracknumber] = id3.tracknum;
1799 entry.tag_offset[tag_length] = id3.length;
1800 entry.tag_offset[tag_bitrate] = id3.bitrate;
1801 entry.tag_offset[tag_mtime] = mtime;
1803 /* String tags. */
1804 has_albumartist = id3.albumartist != NULL
1805 && strlen(id3.albumartist) > 0;
1806 has_grouping = id3.grouping != NULL
1807 && strlen(id3.grouping) > 0;
1809 ADD_TAG(entry, tag_filename, &path);
1810 ADD_TAG(entry, tag_title, &id3.title);
1811 ADD_TAG(entry, tag_artist, &id3.artist);
1812 ADD_TAG(entry, tag_album, &id3.album);
1813 ADD_TAG(entry, tag_genre, &id3.genre_string);
1814 ADD_TAG(entry, tag_composer, &id3.composer);
1815 ADD_TAG(entry, tag_comment, &id3.comment);
1816 if (has_albumartist)
1818 ADD_TAG(entry, tag_albumartist, &id3.albumartist);
1820 else
1822 ADD_TAG(entry, tag_albumartist, &id3.artist);
1824 if (has_grouping)
1826 ADD_TAG(entry, tag_grouping, &id3.grouping);
1828 else
1830 ADD_TAG(entry, tag_grouping, &id3.title);
1832 entry.data_length = offset;
1834 /* Write the header */
1835 write(cachefd, &entry, sizeof(struct temp_file_entry));
1837 /* And tags also... Correct order is critical */
1838 write_item(path);
1839 write_item(id3.title);
1840 write_item(id3.artist);
1841 write_item(id3.album);
1842 write_item(id3.genre_string);
1843 write_item(id3.composer);
1844 write_item(id3.comment);
1845 if (has_albumartist)
1847 write_item(id3.albumartist);
1849 else
1851 write_item(id3.artist);
1853 if (has_grouping)
1855 write_item(id3.grouping);
1857 else
1859 write_item(id3.title);
1861 total_entry_count++;
1864 static bool tempbuf_insert(char *str, int id, int idx_id, bool unique)
1866 struct tempbuf_searchidx *index = (struct tempbuf_searchidx *)tempbuf;
1867 int len = strlen(str)+1;
1868 int i;
1869 unsigned crc32;
1870 unsigned *crcbuf = (unsigned *)&tempbuf[tempbuf_size-4];
1871 char buf[TAG_MAXLEN+32];
1873 for (i = 0; str[i] != '\0' && i < (int)sizeof(buf)-1; i++)
1874 buf[i] = tolower(str[i]);
1875 buf[i] = '\0';
1877 crc32 = crc_32(buf, i, 0xffffffff);
1879 if (unique)
1881 /* Check if the crc does not exist -> entry does not exist for sure. */
1882 for (i = 0; i < tempbufidx; i++)
1884 if (crcbuf[-i] != crc32)
1885 continue;
1887 if (!strcasecmp(str, index[i].str))
1889 if (id < 0 || id >= lookup_buffer_depth)
1891 logf("lookup buf overf.: %d", id);
1892 return false;
1895 lookup[id] = &index[i];
1896 return true;
1901 /* Insert to CRC buffer. */
1902 crcbuf[-tempbufidx] = crc32;
1903 tempbuf_left -= 4;
1905 /* Insert it to the buffer. */
1906 tempbuf_left -= len;
1907 if (tempbuf_left - 4 < 0 || tempbufidx >= commit_entry_count-1)
1908 return false;
1910 if (id >= lookup_buffer_depth)
1912 logf("lookup buf overf. #2: %d", id);
1913 return false;
1916 if (id >= 0)
1918 lookup[id] = &index[tempbufidx];
1919 index[tempbufidx].idlist.id = id;
1921 else
1922 index[tempbufidx].idlist.id = -1;
1924 index[tempbufidx].idlist.next = NULL;
1925 index[tempbufidx].idx_id = idx_id;
1926 index[tempbufidx].seek = -1;
1927 index[tempbufidx].str = &tempbuf[tempbuf_pos];
1928 memcpy(index[tempbufidx].str, str, len);
1929 tempbuf_pos += len;
1930 tempbufidx++;
1932 return true;
1935 static int compare(const void *p1, const void *p2)
1937 do_timed_yield();
1939 struct tempbuf_searchidx *e1 = (struct tempbuf_searchidx *)p1;
1940 struct tempbuf_searchidx *e2 = (struct tempbuf_searchidx *)p2;
1942 if (strcmp(e1->str, UNTAGGED) == 0)
1944 if (strcmp(e2->str, UNTAGGED) == 0)
1945 return 0;
1946 return -1;
1948 else if (strcmp(e2->str, UNTAGGED) == 0)
1949 return 1;
1951 return strncasecmp(e1->str, e2->str, TAG_MAXLEN);
1954 static int tempbuf_sort(int fd)
1956 struct tempbuf_searchidx *index = (struct tempbuf_searchidx *)tempbuf;
1957 struct tagfile_entry fe;
1958 int i;
1959 int length;
1961 /* Generate reverse lookup entries. */
1962 for (i = 0; i < lookup_buffer_depth; i++)
1964 struct tempbuf_id_list *idlist;
1966 if (!lookup[i])
1967 continue;
1969 if (lookup[i]->idlist.id == i)
1970 continue;
1972 idlist = &lookup[i]->idlist;
1973 while (idlist->next != NULL)
1974 idlist = idlist->next;
1976 tempbuf_left -= sizeof(struct tempbuf_id_list);
1977 if (tempbuf_left - 4 < 0)
1978 return -1;
1980 idlist->next = (struct tempbuf_id_list *)&tempbuf[tempbuf_pos];
1981 if (tempbuf_pos & 0x03)
1983 tempbuf_pos = (tempbuf_pos & ~0x03) + 0x04;
1984 tempbuf_left -= 3;
1985 idlist->next = (struct tempbuf_id_list *)&tempbuf[tempbuf_pos];
1987 tempbuf_pos += sizeof(struct tempbuf_id_list);
1989 idlist = idlist->next;
1990 idlist->id = i;
1991 idlist->next = NULL;
1993 do_timed_yield();
1996 qsort(index, tempbufidx, sizeof(struct tempbuf_searchidx), compare);
1997 memset(lookup, 0, lookup_buffer_depth * sizeof(struct tempbuf_searchidx **));
1999 for (i = 0; i < tempbufidx; i++)
2001 struct tempbuf_id_list *idlist = &index[i].idlist;
2003 /* Fix the lookup list. */
2004 while (idlist != NULL)
2006 if (idlist->id >= 0)
2007 lookup[idlist->id] = &index[i];
2008 idlist = idlist->next;
2011 index[i].seek = lseek(fd, 0, SEEK_CUR);
2012 length = strlen(index[i].str) + 1;
2013 fe.tag_length = length;
2014 fe.idx_id = index[i].idx_id;
2016 /* Check the chunk alignment. */
2017 if ((fe.tag_length + sizeof(struct tagfile_entry))
2018 % TAGFILE_ENTRY_CHUNK_LENGTH)
2020 fe.tag_length += TAGFILE_ENTRY_CHUNK_LENGTH -
2021 ((fe.tag_length + sizeof(struct tagfile_entry))
2022 % TAGFILE_ENTRY_CHUNK_LENGTH);
2025 #ifdef TAGCACHE_STRICT_ALIGN
2026 /* Make sure the entry is long aligned. */
2027 if (index[i].seek & 0x03)
2029 logf("tempbuf_sort: alignment error!");
2030 return -3;
2032 #endif
2034 if (ecwrite(fd, &fe, 1, tagfile_entry_ec, tc_stat.econ) !=
2035 sizeof(struct tagfile_entry))
2037 logf("tempbuf_sort: write error #1");
2038 return -1;
2041 if (write(fd, index[i].str, length) != length)
2043 logf("tempbuf_sort: write error #2");
2044 return -2;
2047 /* Write some padding. */
2048 if (fe.tag_length - length > 0)
2049 write(fd, "XXXXXXXX", fe.tag_length - length);
2052 return i;
2055 inline static struct tempbuf_searchidx* tempbuf_locate(int id)
2057 if (id < 0 || id >= lookup_buffer_depth)
2058 return NULL;
2060 return lookup[id];
2064 inline static int tempbuf_find_location(int id)
2066 struct tempbuf_searchidx *entry;
2068 entry = tempbuf_locate(id);
2069 if (entry == NULL)
2070 return -1;
2072 return entry->seek;
2075 static bool build_numeric_indices(struct tagcache_header *h, int tmpfd)
2077 struct master_header tcmh;
2078 struct index_entry idx;
2079 int masterfd;
2080 int masterfd_pos;
2081 struct temp_file_entry *entrybuf = (struct temp_file_entry *)tempbuf;
2082 int max_entries;
2083 int entries_processed = 0;
2084 int i, j;
2085 char buf[TAG_MAXLEN];
2087 max_entries = tempbuf_size / sizeof(struct temp_file_entry) - 1;
2089 logf("Building numeric indices...");
2090 lseek(tmpfd, sizeof(struct tagcache_header), SEEK_SET);
2092 if ( (masterfd = open_master_fd(&tcmh, true)) < 0)
2093 return false;
2095 masterfd_pos = lseek(masterfd, tcmh.tch.entry_count * sizeof(struct index_entry),
2096 SEEK_CUR);
2097 if (masterfd_pos == filesize(masterfd))
2099 logf("we can't append!");
2100 close(masterfd);
2101 return false;
2104 while (entries_processed < h->entry_count)
2106 int count = MIN(h->entry_count - entries_processed, max_entries);
2108 /* Read in as many entries as possible. */
2109 for (i = 0; i < count; i++)
2111 struct temp_file_entry *tfe = &entrybuf[i];
2112 int datastart;
2114 /* Read in numeric data. */
2115 if (read(tmpfd, tfe, sizeof(struct temp_file_entry)) !=
2116 sizeof(struct temp_file_entry))
2118 logf("read fail #1");
2119 close(masterfd);
2120 return false;
2123 datastart = lseek(tmpfd, 0, SEEK_CUR);
2126 * Read string data from the following tags:
2127 * - tag_filename
2128 * - tag_artist
2129 * - tag_album
2130 * - tag_title
2132 * A crc32 hash is calculated from the read data
2133 * and stored back to the data offset field kept in memory.
2135 #define tmpdb_read_string_tag(tag) \
2136 lseek(tmpfd, tfe->tag_offset[tag], SEEK_CUR); \
2137 if ((unsigned long)tfe->tag_length[tag] > sizeof buf) \
2139 logf("read fail: buffer overflow"); \
2140 close(masterfd); \
2141 return false; \
2144 if (read(tmpfd, buf, tfe->tag_length[tag]) != \
2145 tfe->tag_length[tag]) \
2147 logf("read fail #2"); \
2148 close(masterfd); \
2149 return false; \
2152 tfe->tag_offset[tag] = crc_32(buf, strlen(buf), 0xffffffff); \
2153 lseek(tmpfd, datastart, SEEK_SET)
2155 tmpdb_read_string_tag(tag_filename);
2156 tmpdb_read_string_tag(tag_artist);
2157 tmpdb_read_string_tag(tag_album);
2158 tmpdb_read_string_tag(tag_title);
2160 /* Seek to the end of the string data. */
2161 lseek(tmpfd, tfe->data_length, SEEK_CUR);
2164 /* Backup the master index position. */
2165 masterfd_pos = lseek(masterfd, 0, SEEK_CUR);
2166 lseek(masterfd, sizeof(struct master_header), SEEK_SET);
2168 /* Check if we can resurrect some deleted runtime statistics data. */
2169 for (i = 0; i < tcmh.tch.entry_count; i++)
2171 /* Read the index entry. */
2172 if (ecread(masterfd, &idx, 1, index_entry_ec, tc_stat.econ)
2173 != sizeof(struct index_entry))
2175 logf("read fail #3");
2176 close(masterfd);
2177 return false;
2181 * Skip unless the entry is marked as being deleted
2182 * or the data has already been resurrected.
2184 if (!(idx.flag & FLAG_DELETED) || idx.flag & FLAG_RESURRECTED)
2185 continue;
2187 /* Now try to match the entry. */
2189 * To succesfully match a song, the following conditions
2190 * must apply:
2192 * For numeric fields: tag_length
2193 * - Full identical match is required
2195 * If tag_filename matches, no further checking necessary.
2197 * For string hashes: tag_artist, tag_album, tag_title
2198 * - Two of these must match
2200 for (j = 0; j < count; j++)
2202 struct temp_file_entry *tfe = &entrybuf[j];
2204 /* Try to match numeric fields first. */
2205 if (tfe->tag_offset[tag_length] != idx.tag_seek[tag_length])
2206 continue;
2208 /* Now it's time to do the hash matching. */
2209 if (tfe->tag_offset[tag_filename] != idx.tag_seek[tag_filename])
2211 int match_count = 0;
2213 /* No filename match, check if we can match two other tags. */
2214 #define tmpdb_match(tag) \
2215 if (tfe->tag_offset[tag] == idx.tag_seek[tag]) \
2216 match_count++
2218 tmpdb_match(tag_artist);
2219 tmpdb_match(tag_album);
2220 tmpdb_match(tag_title);
2222 if (match_count < 2)
2224 /* Still no match found, give up. */
2225 continue;
2229 /* A match found, now copy & resurrect the statistical data. */
2230 #define tmpdb_copy_tag(tag) \
2231 tfe->tag_offset[tag] = idx.tag_seek[tag]
2233 tmpdb_copy_tag(tag_playcount);
2234 tmpdb_copy_tag(tag_rating);
2235 tmpdb_copy_tag(tag_playtime);
2236 tmpdb_copy_tag(tag_lastplayed);
2237 tmpdb_copy_tag(tag_commitid);
2239 /* Avoid processing this entry again. */
2240 idx.flag |= FLAG_RESURRECTED;
2242 lseek(masterfd, -sizeof(struct index_entry), SEEK_CUR);
2243 if (ecwrite(masterfd, &idx, 1, index_entry_ec, tc_stat.econ)
2244 != sizeof(struct index_entry))
2246 logf("masterfd writeback fail #1");
2247 close(masterfd);
2248 return false;
2251 logf("Entry resurrected");
2256 /* Restore the master index position. */
2257 lseek(masterfd, masterfd_pos, SEEK_SET);
2259 /* Commit the data to the index. */
2260 for (i = 0; i < count; i++)
2262 int loc = lseek(masterfd, 0, SEEK_CUR);
2264 if (ecread(masterfd, &idx, 1, index_entry_ec, tc_stat.econ)
2265 != sizeof(struct index_entry))
2267 logf("read fail #3");
2268 close(masterfd);
2269 return false;
2272 for (j = 0; j < TAG_COUNT; j++)
2274 if (!TAGCACHE_IS_NUMERIC(j))
2275 continue;
2277 idx.tag_seek[j] = entrybuf[i].tag_offset[j];
2279 idx.flag = entrybuf[i].flag;
2281 if (idx.tag_seek[tag_commitid])
2283 /* Data has been resurrected. */
2284 idx.flag |= FLAG_DIRTYNUM;
2286 else if (tc_stat.ready && current_tcmh.commitid > 0)
2288 idx.tag_seek[tag_commitid] = current_tcmh.commitid;
2289 idx.flag |= FLAG_DIRTYNUM;
2292 /* Write back the updated index. */
2293 lseek(masterfd, loc, SEEK_SET);
2294 if (ecwrite(masterfd, &idx, 1, index_entry_ec, tc_stat.econ)
2295 != sizeof(struct index_entry))
2297 logf("write fail");
2298 close(masterfd);
2299 return false;
2303 entries_processed += count;
2304 logf("%d/%ld entries processed", entries_processed, h->entry_count);
2307 close(masterfd);
2309 return true;
2313 * Return values:
2314 * > 0 success
2315 * == 0 temporary failure
2316 * < 0 fatal error
2318 static int build_index(int index_type, struct tagcache_header *h, int tmpfd)
2320 int i;
2321 struct tagcache_header tch;
2322 struct master_header tcmh;
2323 struct index_entry idxbuf[IDX_BUF_DEPTH];
2324 int idxbuf_pos;
2325 char buf[TAG_MAXLEN+32];
2326 int fd = -1, masterfd;
2327 bool error = false;
2328 int init;
2329 int masterfd_pos;
2331 logf("Building index: %d", index_type);
2333 /* Check the number of entries we need to allocate ram for. */
2334 commit_entry_count = h->entry_count + 1;
2336 masterfd = open_master_fd(&tcmh, false);
2337 if (masterfd >= 0)
2339 commit_entry_count += tcmh.tch.entry_count;
2340 close(masterfd);
2342 else
2343 remove_files(); /* Just to be sure we are clean. */
2345 /* Open the index file, which contains the tag names. */
2346 fd = open_tag_fd(&tch, index_type, true);
2347 if (fd >= 0)
2349 logf("tch.datasize=%ld", tch.datasize);
2350 lookup_buffer_depth = 1 +
2351 /* First part */ commit_entry_count +
2352 /* Second part */ (tch.datasize / TAGFILE_ENTRY_CHUNK_LENGTH);
2354 else
2356 lookup_buffer_depth = 1 +
2357 /* First part */ commit_entry_count +
2358 /* Second part */ 0;
2361 logf("lookup_buffer_depth=%ld", lookup_buffer_depth);
2362 logf("commit_entry_count=%ld", commit_entry_count);
2364 /* Allocate buffer for all index entries from both old and new
2365 * tag files. */
2366 tempbufidx = 0;
2367 tempbuf_pos = commit_entry_count * sizeof(struct tempbuf_searchidx);
2369 /* Allocate lookup buffer. The first portion of commit_entry_count
2370 * contains the new tags in the temporary file and the second
2371 * part for locating entries already in the db.
2373 * New tags Old tags
2374 * +---------+---------------------------+
2375 * | index | position/ENTRY_CHUNK_SIZE | lookup buffer
2376 * +---------+---------------------------+
2378 * Old tags are inserted to a temporary buffer with position:
2379 * tempbuf_insert(position/ENTRY_CHUNK_SIZE, ...);
2380 * And new tags with index:
2381 * tempbuf_insert(idx, ...);
2383 * The buffer is sorted and written into tag file:
2384 * tempbuf_sort(...);
2385 * leaving master index locations messed up.
2387 * That is fixed using the lookup buffer for old tags:
2388 * new_seek = tempbuf_find_location(old_seek, ...);
2389 * and for new tags:
2390 * new_seek = tempbuf_find_location(idx);
2392 lookup = (struct tempbuf_searchidx **)&tempbuf[tempbuf_pos];
2393 tempbuf_pos += lookup_buffer_depth * sizeof(void **);
2394 memset(lookup, 0, lookup_buffer_depth * sizeof(void **));
2396 /* And calculate the remaining data space used mainly for storing
2397 * tag data (strings). */
2398 tempbuf_left = tempbuf_size - tempbuf_pos - 8;
2399 if (tempbuf_left - TAGFILE_ENTRY_AVG_LENGTH * commit_entry_count < 0)
2401 logf("Buffer way too small!");
2402 return 0;
2405 if (fd >= 0)
2408 * If tag file contains unique tags (sorted index), we will load
2409 * it entirely into memory so we can resort it later for use with
2410 * chunked browsing.
2412 if (TAGCACHE_IS_SORTED(index_type))
2414 logf("loading tags...");
2415 for (i = 0; i < tch.entry_count; i++)
2417 struct tagfile_entry entry;
2418 int loc = lseek(fd, 0, SEEK_CUR);
2419 bool ret;
2421 if (ecread(fd, &entry, 1, tagfile_entry_ec, tc_stat.econ)
2422 != sizeof(struct tagfile_entry))
2424 logf("read error #7");
2425 close(fd);
2426 return -2;
2429 if (entry.tag_length >= (int)sizeof(buf))
2431 logf("too long tag #3");
2432 close(fd);
2433 return -2;
2436 if (read(fd, buf, entry.tag_length) != entry.tag_length)
2438 logf("read error #8");
2439 close(fd);
2440 return -2;
2443 /* Skip deleted entries. */
2444 if (buf[0] == '\0')
2445 continue;
2448 * Save the tag and tag id in the memory buffer. Tag id
2449 * is saved so we can later reindex the master lookup
2450 * table when the index gets resorted.
2452 ret = tempbuf_insert(buf, loc/TAGFILE_ENTRY_CHUNK_LENGTH
2453 + commit_entry_count, entry.idx_id,
2454 TAGCACHE_IS_UNIQUE(index_type));
2455 if (!ret)
2457 close(fd);
2458 return -3;
2460 do_timed_yield();
2462 logf("done");
2464 else
2465 tempbufidx = tch.entry_count;
2467 else
2470 * Creating new index file to store the tags. No need to preload
2471 * anything whether the index type is sorted or not.
2473 snprintf(buf, sizeof buf, TAGCACHE_FILE_INDEX, index_type);
2474 fd = open(buf, O_WRONLY | O_CREAT | O_TRUNC);
2475 if (fd < 0)
2477 logf("%s open fail", buf);
2478 return -2;
2481 tch.magic = TAGCACHE_MAGIC;
2482 tch.entry_count = 0;
2483 tch.datasize = 0;
2485 if (ecwrite(fd, &tch, 1, tagcache_header_ec, tc_stat.econ)
2486 != sizeof(struct tagcache_header))
2488 logf("header write failed");
2489 close(fd);
2490 return -2;
2494 /* Loading the tag lookup file as "master file". */
2495 logf("Loading index file");
2496 masterfd = open(TAGCACHE_FILE_MASTER, O_RDWR);
2498 if (masterfd < 0)
2500 logf("Creating new DB");
2501 masterfd = open(TAGCACHE_FILE_MASTER, O_WRONLY | O_CREAT | O_TRUNC);
2503 if (masterfd < 0)
2505 logf("Failure to create index file (%s)", TAGCACHE_FILE_MASTER);
2506 close(fd);
2507 return -2;
2510 /* Write the header (write real values later). */
2511 memset(&tcmh, 0, sizeof(struct master_header));
2512 tcmh.tch = *h;
2513 tcmh.tch.entry_count = 0;
2514 tcmh.tch.datasize = 0;
2515 tcmh.dirty = true;
2516 ecwrite(masterfd, &tcmh, 1, master_header_ec, tc_stat.econ);
2517 init = true;
2518 masterfd_pos = lseek(masterfd, 0, SEEK_CUR);
2520 else
2523 * Master file already exists so we need to process the current
2524 * file first.
2526 init = false;
2528 if (ecread(masterfd, &tcmh, 1, master_header_ec, tc_stat.econ) !=
2529 sizeof(struct master_header) || tcmh.tch.magic != TAGCACHE_MAGIC)
2531 logf("header error");
2532 close(fd);
2533 close(masterfd);
2534 return -2;
2538 * If we reach end of the master file, we need to expand it to
2539 * hold new tags. If the current index is not sorted, we can
2540 * simply append new data to end of the file.
2541 * However, if the index is sorted, we need to update all tag
2542 * pointers in the master file for the current index.
2544 masterfd_pos = lseek(masterfd, tcmh.tch.entry_count * sizeof(struct index_entry),
2545 SEEK_CUR);
2546 if (masterfd_pos == filesize(masterfd))
2548 logf("appending...");
2549 init = true;
2554 * Load new unique tags in memory to be sorted later and added
2555 * to the master lookup file.
2557 if (TAGCACHE_IS_SORTED(index_type))
2559 lseek(tmpfd, sizeof(struct tagcache_header), SEEK_SET);
2560 /* h is the header of the temporary file containing new tags. */
2561 logf("inserting new tags...");
2562 for (i = 0; i < h->entry_count; i++)
2564 struct temp_file_entry entry;
2566 if (read(tmpfd, &entry, sizeof(struct temp_file_entry)) !=
2567 sizeof(struct temp_file_entry))
2569 logf("read fail #3");
2570 error = true;
2571 goto error_exit;
2574 /* Read data. */
2575 if (entry.tag_length[index_type] >= (long)sizeof(buf))
2577 logf("too long entry!");
2578 error = true;
2579 goto error_exit;
2582 lseek(tmpfd, entry.tag_offset[index_type], SEEK_CUR);
2583 if (read(tmpfd, buf, entry.tag_length[index_type]) !=
2584 entry.tag_length[index_type])
2586 logf("read fail #4");
2587 error = true;
2588 goto error_exit;
2591 if (TAGCACHE_IS_UNIQUE(index_type))
2592 error = !tempbuf_insert(buf, i, -1, true);
2593 else
2594 error = !tempbuf_insert(buf, i, tcmh.tch.entry_count + i, false);
2596 if (error)
2598 logf("insert error");
2599 goto error_exit;
2602 /* Skip to next. */
2603 lseek(tmpfd, entry.data_length - entry.tag_offset[index_type] -
2604 entry.tag_length[index_type], SEEK_CUR);
2605 do_timed_yield();
2607 logf("done");
2609 /* Sort the buffer data and write it to the index file. */
2610 lseek(fd, sizeof(struct tagcache_header), SEEK_SET);
2612 * We need to truncate the index file now. There can be junk left
2613 * at the end of file (however, we _should_ always follow the
2614 * entry_count and don't crash with that).
2616 ftruncate(fd, lseek(fd, 0, SEEK_CUR));
2618 i = tempbuf_sort(fd);
2619 if (i < 0)
2620 goto error_exit;
2621 logf("sorted %d tags", i);
2624 * Now update all indexes in the master lookup file.
2626 logf("updating indices...");
2627 lseek(masterfd, sizeof(struct master_header), SEEK_SET);
2628 for (i = 0; i < tcmh.tch.entry_count; i += idxbuf_pos)
2630 int j;
2631 int loc = lseek(masterfd, 0, SEEK_CUR);
2633 idxbuf_pos = MIN(tcmh.tch.entry_count - i, IDX_BUF_DEPTH);
2635 if (ecread(masterfd, idxbuf, idxbuf_pos, index_entry_ec, tc_stat.econ)
2636 != (int)sizeof(struct index_entry)*idxbuf_pos)
2638 logf("read fail #5");
2639 error = true;
2640 goto error_exit ;
2642 lseek(masterfd, loc, SEEK_SET);
2644 for (j = 0; j < idxbuf_pos; j++)
2646 if (idxbuf[j].flag & FLAG_DELETED)
2648 /* We can just ignore deleted entries. */
2649 // idxbuf[j].tag_seek[index_type] = 0;
2650 continue;
2653 idxbuf[j].tag_seek[index_type] = tempbuf_find_location(
2654 idxbuf[j].tag_seek[index_type]/TAGFILE_ENTRY_CHUNK_LENGTH
2655 + commit_entry_count);
2657 if (idxbuf[j].tag_seek[index_type] < 0)
2659 logf("update error: %d/%d/%d",
2660 idxbuf[j].flag, i+j, tcmh.tch.entry_count);
2661 error = true;
2662 goto error_exit;
2665 do_timed_yield();
2668 /* Write back the updated index. */
2669 if (ecwrite(masterfd, idxbuf, idxbuf_pos,
2670 index_entry_ec, tc_stat.econ) !=
2671 (int)sizeof(struct index_entry)*idxbuf_pos)
2673 logf("write fail");
2674 error = true;
2675 goto error_exit;
2678 logf("done");
2682 * Walk through the temporary file containing the new tags.
2684 // build_normal_index(h, tmpfd, masterfd, idx);
2685 logf("updating new indices...");
2686 lseek(masterfd, masterfd_pos, SEEK_SET);
2687 lseek(tmpfd, sizeof(struct tagcache_header), SEEK_SET);
2688 lseek(fd, 0, SEEK_END);
2689 for (i = 0; i < h->entry_count; i += idxbuf_pos)
2691 int j;
2693 idxbuf_pos = MIN(h->entry_count - i, IDX_BUF_DEPTH);
2694 if (init)
2696 memset(idxbuf, 0, sizeof(struct index_entry)*IDX_BUF_DEPTH);
2698 else
2700 int loc = lseek(masterfd, 0, SEEK_CUR);
2702 if (ecread(masterfd, idxbuf, idxbuf_pos, index_entry_ec, tc_stat.econ)
2703 != (int)sizeof(struct index_entry)*idxbuf_pos)
2705 logf("read fail #6");
2706 error = true;
2707 break ;
2709 lseek(masterfd, loc, SEEK_SET);
2712 /* Read entry headers. */
2713 for (j = 0; j < idxbuf_pos; j++)
2715 if (!TAGCACHE_IS_SORTED(index_type))
2717 struct temp_file_entry entry;
2718 struct tagfile_entry fe;
2720 if (read(tmpfd, &entry, sizeof(struct temp_file_entry)) !=
2721 sizeof(struct temp_file_entry))
2723 logf("read fail #7");
2724 error = true;
2725 break ;
2728 /* Read data. */
2729 if (entry.tag_length[index_type] >= (int)sizeof(buf))
2731 logf("too long entry!");
2732 logf("length=%d", entry.tag_length[index_type]);
2733 logf("pos=0x%02lx", lseek(tmpfd, 0, SEEK_CUR));
2734 error = true;
2735 break ;
2738 lseek(tmpfd, entry.tag_offset[index_type], SEEK_CUR);
2739 if (read(tmpfd, buf, entry.tag_length[index_type]) !=
2740 entry.tag_length[index_type])
2742 logf("read fail #8");
2743 logf("offset=0x%02lx", entry.tag_offset[index_type]);
2744 logf("length=0x%02x", entry.tag_length[index_type]);
2745 error = true;
2746 break ;
2749 /* Write to index file. */
2750 idxbuf[j].tag_seek[index_type] = lseek(fd, 0, SEEK_CUR);
2751 fe.tag_length = entry.tag_length[index_type];
2752 fe.idx_id = tcmh.tch.entry_count + i + j;
2753 ecwrite(fd, &fe, 1, tagfile_entry_ec, tc_stat.econ);
2754 write(fd, buf, fe.tag_length);
2755 tempbufidx++;
2757 /* Skip to next. */
2758 lseek(tmpfd, entry.data_length - entry.tag_offset[index_type] -
2759 entry.tag_length[index_type], SEEK_CUR);
2761 else
2763 /* Locate the correct entry from the sorted array. */
2764 idxbuf[j].tag_seek[index_type] = tempbuf_find_location(i + j);
2765 if (idxbuf[j].tag_seek[index_type] < 0)
2767 logf("entry not found (%d)", j);
2768 error = true;
2769 break ;
2774 /* Write index. */
2775 if (ecwrite(masterfd, idxbuf, idxbuf_pos,
2776 index_entry_ec, tc_stat.econ) !=
2777 (int)sizeof(struct index_entry)*idxbuf_pos)
2779 logf("tagcache: write fail #4");
2780 error = true;
2781 break ;
2784 do_timed_yield();
2786 logf("done");
2788 /* Finally write the header. */
2789 tch.magic = TAGCACHE_MAGIC;
2790 tch.entry_count = tempbufidx;
2791 tch.datasize = lseek(fd, 0, SEEK_END) - sizeof(struct tagcache_header);
2792 lseek(fd, 0, SEEK_SET);
2793 ecwrite(fd, &tch, 1, tagcache_header_ec, tc_stat.econ);
2795 if (index_type != tag_filename)
2796 h->datasize += tch.datasize;
2797 logf("s:%d/%ld/%ld", index_type, tch.datasize, h->datasize);
2798 error_exit:
2800 close(fd);
2801 close(masterfd);
2803 if (error)
2804 return -2;
2806 return 1;
2809 static bool commit(void)
2811 struct tagcache_header tch;
2812 struct master_header tcmh;
2813 int i, len, rc;
2814 int tmpfd;
2815 int masterfd;
2816 #ifdef HAVE_DIRCACHE
2817 bool dircache_buffer_stolen = false;
2818 #endif
2819 bool local_allocation = false;
2821 logf("committing tagcache");
2823 while (write_lock)
2824 sleep(1);
2826 tmpfd = open(TAGCACHE_FILE_TEMP, O_RDONLY);
2827 if (tmpfd < 0)
2829 logf("nothing to commit");
2830 return true;
2834 /* Load the header. */
2835 len = sizeof(struct tagcache_header);
2836 rc = read(tmpfd, &tch, len);
2838 if (tch.magic != TAGCACHE_MAGIC || rc != len)
2840 logf("incorrect header");
2841 close(tmpfd);
2842 remove(TAGCACHE_FILE_TEMP);
2843 return false;
2846 if (tch.entry_count == 0)
2848 logf("nothing to commit");
2849 close(tmpfd);
2850 remove(TAGCACHE_FILE_TEMP);
2851 return true;
2854 #ifdef HAVE_EEPROM_SETTINGS
2855 remove(TAGCACHE_STATEFILE);
2856 #endif
2858 /* At first be sure to unload the ramcache! */
2859 #ifdef HAVE_TC_RAMCACHE
2860 tc_stat.ramcache = false;
2861 #endif
2863 read_lock++;
2865 /* Try to steal every buffer we can :) */
2866 if (tempbuf_size == 0)
2867 local_allocation = true;
2869 #ifdef HAVE_DIRCACHE
2870 if (tempbuf_size == 0)
2872 /* Try to steal the dircache buffer. */
2873 tempbuf = dircache_steal_buffer(&tempbuf_size);
2874 tempbuf_size &= ~0x03;
2876 if (tempbuf_size > 0)
2878 dircache_buffer_stolen = true;
2881 #endif
2883 #ifdef HAVE_TC_RAMCACHE
2884 if (tempbuf_size == 0 && tc_stat.ramcache_allocated > 0)
2886 tempbuf = (char *)(hdr + 1);
2887 tempbuf_size = tc_stat.ramcache_allocated - sizeof(struct ramcache_header) - 128;
2888 tempbuf_size &= ~0x03;
2890 #endif
2892 /* And finally fail if there are no buffers available. */
2893 if (tempbuf_size == 0)
2895 logf("delaying commit until next boot");
2896 tc_stat.commit_delayed = true;
2897 close(tmpfd);
2898 read_lock--;
2899 return false;
2902 logf("commit %ld entries...", tch.entry_count);
2904 /* Mark DB dirty so it will stay disabled if commit fails. */
2905 current_tcmh.dirty = true;
2906 update_master_header();
2908 /* Now create the index files. */
2909 tc_stat.commit_step = 0;
2910 tch.datasize = 0;
2911 tc_stat.commit_delayed = false;
2913 for (i = 0; i < TAG_COUNT; i++)
2915 int ret;
2917 if (TAGCACHE_IS_NUMERIC(i))
2918 continue;
2920 tc_stat.commit_step++;
2921 ret = build_index(i, &tch, tmpfd);
2922 if (ret <= 0)
2924 close(tmpfd);
2925 logf("tagcache failed init");
2926 if (ret == 0)
2927 tc_stat.commit_delayed = true;
2929 tc_stat.commit_step = 0;
2930 read_lock--;
2931 return false;
2935 if (!build_numeric_indices(&tch, tmpfd))
2937 logf("Failure to commit numeric indices");
2938 close(tmpfd);
2939 tc_stat.commit_step = 0;
2940 read_lock--;
2941 return false;
2944 close(tmpfd);
2945 remove(TAGCACHE_FILE_TEMP);
2947 tc_stat.commit_step = 0;
2949 /* Update the master index headers. */
2950 if ( (masterfd = open_master_fd(&tcmh, true)) < 0)
2952 read_lock--;
2953 return false;
2956 tcmh.tch.entry_count += tch.entry_count;
2957 tcmh.tch.datasize = sizeof(struct master_header)
2958 + sizeof(struct index_entry) * tcmh.tch.entry_count
2959 + tch.datasize;
2960 tcmh.dirty = false;
2961 tcmh.commitid++;
2963 lseek(masterfd, 0, SEEK_SET);
2964 ecwrite(masterfd, &tcmh, 1, master_header_ec, tc_stat.econ);
2965 close(masterfd);
2967 logf("tagcache committed");
2968 tc_stat.ready = check_all_headers();
2969 tc_stat.readyvalid = true;
2971 if (local_allocation)
2973 tempbuf = NULL;
2974 tempbuf_size = 0;
2977 #ifdef HAVE_DIRCACHE
2978 /* Rebuild the dircache, if we stole the buffer. */
2979 if (dircache_buffer_stolen)
2980 dircache_build(0);
2981 #endif
2983 #ifdef HAVE_TC_RAMCACHE
2984 /* Reload tagcache. */
2985 if (tc_stat.ramcache_allocated > 0)
2986 tagcache_start_scan();
2987 #endif
2989 read_lock--;
2991 return true;
2994 static void allocate_tempbuf(void)
2996 /* Yeah, malloc would be really nice now :) */
2997 #ifdef __PCTOOL__
2998 tempbuf_size = 32*1024*1024;
2999 tempbuf = malloc(tempbuf_size);
3000 #else
3001 tempbuf = (char *)(((long)audiobuf & ~0x03) + 0x04);
3002 tempbuf_size = (long)audiobufend - (long)audiobuf - 4;
3003 audiobuf += tempbuf_size;
3004 #endif
3007 static void free_tempbuf(void)
3009 if (tempbuf_size == 0)
3010 return ;
3012 #ifdef __PCTOOL__
3013 free(tempbuf);
3014 #else
3015 audiobuf -= tempbuf_size;
3016 #endif
3017 tempbuf = NULL;
3018 tempbuf_size = 0;
3021 #ifndef __PCTOOL__
3023 static bool modify_numeric_entry(int masterfd, int idx_id, int tag, long data)
3025 struct index_entry idx;
3027 if (!tc_stat.ready)
3028 return false;
3030 if (!TAGCACHE_IS_NUMERIC(tag))
3031 return false;
3033 if (!get_index(masterfd, idx_id, &idx, false))
3034 return false;
3036 idx.tag_seek[tag] = data;
3037 idx.flag |= FLAG_DIRTYNUM;
3039 return write_index(masterfd, idx_id, &idx);
3042 #if 0
3043 bool tagcache_modify_numeric_entry(struct tagcache_search *tcs,
3044 int tag, long data)
3046 struct master_header myhdr;
3048 if (tcs->masterfd < 0)
3050 if ( (tcs->masterfd = open_master_fd(&myhdr, true)) < 0)
3051 return false;
3054 return modify_numeric_entry(tcs->masterfd, tcs->idx_id, tag, data);
3056 #endif
3058 #define COMMAND_QUEUE_IS_EMPTY (command_queue_ridx == command_queue_widx)
3060 static bool command_queue_is_full(void)
3062 int next;
3064 next = command_queue_widx + 1;
3065 if (next >= TAGCACHE_COMMAND_QUEUE_LENGTH)
3066 next = 0;
3068 return (next == command_queue_ridx);
3071 static bool command_queue_sync_callback(void)
3074 struct master_header myhdr;
3075 int masterfd;
3077 mutex_lock(&command_queue_mutex);
3079 if ( (masterfd = open_master_fd(&myhdr, true)) < 0)
3080 return false;
3082 while (command_queue_ridx != command_queue_widx)
3084 struct tagcache_command_entry *ce = &command_queue[command_queue_ridx];
3086 switch (ce->command)
3088 case CMD_UPDATE_MASTER_HEADER:
3090 close(masterfd);
3091 update_master_header();
3093 /* Re-open the masterfd. */
3094 if ( (masterfd = open_master_fd(&myhdr, true)) < 0)
3095 return true;
3097 break;
3099 case CMD_UPDATE_NUMERIC:
3101 modify_numeric_entry(masterfd, ce->idx_id, ce->tag, ce->data);
3102 break;
3106 if (++command_queue_ridx >= TAGCACHE_COMMAND_QUEUE_LENGTH)
3107 command_queue_ridx = 0;
3110 close(masterfd);
3112 tc_stat.queue_length = 0;
3113 mutex_unlock(&command_queue_mutex);
3114 return true;
3117 static void run_command_queue(bool force)
3119 if (COMMAND_QUEUE_IS_EMPTY)
3120 return;
3122 if (force || command_queue_is_full())
3123 command_queue_sync_callback();
3124 else
3125 register_storage_idle_func(command_queue_sync_callback);
3128 static void queue_command(int cmd, long idx_id, int tag, long data)
3130 while (1)
3132 int next;
3134 mutex_lock(&command_queue_mutex);
3135 next = command_queue_widx + 1;
3136 if (next >= TAGCACHE_COMMAND_QUEUE_LENGTH)
3137 next = 0;
3139 /* Make sure queue is not full. */
3140 if (next != command_queue_ridx)
3142 struct tagcache_command_entry *ce = &command_queue[command_queue_widx];
3144 ce->command = cmd;
3145 ce->idx_id = idx_id;
3146 ce->tag = tag;
3147 ce->data = data;
3149 command_queue_widx = next;
3151 tc_stat.queue_length++;
3153 mutex_unlock(&command_queue_mutex);
3154 break;
3157 /* Queue is full, try again later... */
3158 mutex_unlock(&command_queue_mutex);
3159 sleep(1);
3163 long tagcache_increase_serial(void)
3165 long old;
3167 if (!tc_stat.ready)
3168 return -2;
3170 while (read_lock)
3171 sleep(1);
3173 old = current_tcmh.serial++;
3174 queue_command(CMD_UPDATE_MASTER_HEADER, 0, 0, 0);
3176 return old;
3179 void tagcache_update_numeric(int idx_id, int tag, long data)
3181 queue_command(CMD_UPDATE_NUMERIC, idx_id, tag, data);
3183 #endif /* !__PCTOOL__ */
3185 long tagcache_get_serial(void)
3187 return current_tcmh.serial;
3190 long tagcache_get_commitid(void)
3192 return current_tcmh.commitid;
3195 static bool write_tag(int fd, const char *tagstr, const char *datastr)
3197 char buf[512];
3198 int i;
3200 snprintf(buf, sizeof buf, "%s=\"", tagstr);
3201 for (i = strlen(buf); i < (long)sizeof(buf)-4; i++)
3203 if (*datastr == '\0')
3204 break;
3206 if (*datastr == '"' || *datastr == '\\')
3207 buf[i++] = '\\';
3209 buf[i] = *(datastr++);
3212 strcpy(&buf[i], "\" ");
3214 write(fd, buf, i + 2);
3216 return true;
3219 #ifndef __PCTOOL__
3221 static bool read_tag(char *dest, long size,
3222 const char *src, const char *tagstr)
3224 int pos;
3225 char current_tag[32];
3227 while (*src != '\0')
3229 /* Skip all whitespace */
3230 while (*src == ' ')
3231 src++;
3233 if (*src == '\0')
3234 break;
3236 pos = 0;
3237 /* Read in tag name */
3238 while (*src != '=' && *src != ' ')
3240 current_tag[pos] = *src;
3241 src++;
3242 pos++;
3244 if (*src == '\0' || pos >= (long)sizeof(current_tag))
3245 return false;
3247 current_tag[pos] = '\0';
3249 /* Read in tag data */
3251 /* Find the start. */
3252 while (*src != '"' && *src != '\0')
3253 src++;
3255 if (*src == '\0' || *(++src) == '\0')
3256 return false;
3258 /* Read the data. */
3259 for (pos = 0; pos < size; pos++)
3261 if (*src == '\0')
3262 break;
3264 if (*src == '\\')
3266 dest[pos] = *(src+1);
3267 src += 2;
3268 continue;
3271 dest[pos] = *src;
3273 if (*src == '"')
3275 src++;
3276 break;
3279 if (*src == '\0')
3280 break;
3282 src++;
3284 dest[pos] = '\0';
3286 if (!strcasecmp(tagstr, current_tag))
3287 return true;
3290 return false;
3293 static int parse_changelog_line(int line_n, const char *buf, void *parameters)
3295 struct index_entry idx;
3296 char tag_data[TAG_MAXLEN+32];
3297 int idx_id;
3298 long masterfd = (long)parameters;
3299 const int import_tags[] = { tag_playcount, tag_rating, tag_playtime, tag_lastplayed,
3300 tag_commitid };
3301 int i;
3302 (void)line_n;
3304 if (*buf == '#')
3305 return 0;
3307 logf("%d/%s", line_n, buf);
3308 if (!read_tag(tag_data, sizeof tag_data, buf, "filename"))
3310 logf("filename missing");
3311 logf("-> %s", buf);
3312 return 0;
3315 idx_id = find_index(tag_data);
3316 if (idx_id < 0)
3318 logf("entry not found");
3319 return 0;
3322 if (!get_index(masterfd, idx_id, &idx, false))
3324 logf("failed to retrieve index entry");
3325 return 0;
3328 /* Stop if tag has already been modified. */
3329 if (idx.flag & FLAG_DIRTYNUM)
3330 return 0;
3332 logf("import: %s", tag_data);
3334 idx.flag |= FLAG_DIRTYNUM;
3335 for (i = 0; i < (long)(sizeof(import_tags)/sizeof(import_tags[0])); i++)
3337 int data;
3339 if (!read_tag(tag_data, sizeof tag_data, buf,
3340 tagcache_tag_to_str(import_tags[i])))
3342 continue;
3345 data = atoi(tag_data);
3346 if (data < 0)
3347 continue;
3349 idx.tag_seek[import_tags[i]] = data;
3351 if (import_tags[i] == tag_lastplayed && data >= current_tcmh.serial)
3352 current_tcmh.serial = data + 1;
3353 else if (import_tags[i] == tag_commitid && data >= current_tcmh.commitid)
3354 current_tcmh.commitid = data + 1;
3357 return write_index(masterfd, idx_id, &idx) ? 0 : -5;
3360 bool tagcache_import_changelog(void)
3362 struct master_header myhdr;
3363 struct tagcache_header tch;
3364 int clfd;
3365 long masterfd;
3366 char buf[2048];
3368 if (!tc_stat.ready)
3369 return false;
3371 while (read_lock)
3372 sleep(1);
3374 clfd = open(TAGCACHE_FILE_CHANGELOG, O_RDONLY);
3375 if (clfd < 0)
3377 logf("failure to open changelog");
3378 return false;
3381 if ( (masterfd = open_master_fd(&myhdr, true)) < 0)
3383 close(clfd);
3384 return false;
3387 write_lock++;
3389 filenametag_fd = open_tag_fd(&tch, tag_filename, false);
3391 fast_readline(clfd, buf, sizeof buf, (long *)masterfd,
3392 parse_changelog_line);
3394 close(clfd);
3395 close(masterfd);
3397 if (filenametag_fd >= 0)
3399 close(filenametag_fd);
3400 filenametag_fd = -1;
3403 write_lock--;
3405 update_master_header();
3407 return true;
3410 #endif /* !__PCTOOL__ */
3412 bool tagcache_create_changelog(struct tagcache_search *tcs)
3414 struct master_header myhdr;
3415 struct index_entry idx;
3416 char buf[TAG_MAXLEN+32];
3417 char temp[32];
3418 int clfd;
3419 int i, j;
3421 if (!tc_stat.ready)
3422 return false;
3424 if (!tagcache_search(tcs, tag_filename))
3425 return false;
3427 /* Initialize the changelog */
3428 clfd = open(TAGCACHE_FILE_CHANGELOG, O_WRONLY | O_CREAT | O_TRUNC);
3429 if (clfd < 0)
3431 logf("failure to open changelog");
3432 return false;
3435 if (tcs->masterfd < 0)
3437 if ( (tcs->masterfd = open_master_fd(&myhdr, false)) < 0)
3438 return false;
3440 else
3442 lseek(tcs->masterfd, 0, SEEK_SET);
3443 ecread(tcs->masterfd, &myhdr, 1, master_header_ec, tc_stat.econ);
3446 write(clfd, "## Changelog version 1\n", 23);
3448 for (i = 0; i < myhdr.tch.entry_count; i++)
3450 if (ecread(tcs->masterfd, &idx, 1, index_entry_ec, tc_stat.econ)
3451 != sizeof(struct index_entry))
3453 logf("read error #9");
3454 tagcache_search_finish(tcs);
3455 close(clfd);
3456 return false;
3459 /* Skip until the entry found has been modified. */
3460 if (! (idx.flag & FLAG_DIRTYNUM) )
3461 continue;
3463 /* Skip deleted entries too. */
3464 if (idx.flag & FLAG_DELETED)
3465 continue;
3467 /* Now retrieve all tags. */
3468 for (j = 0; j < TAG_COUNT; j++)
3470 if (TAGCACHE_IS_NUMERIC(j))
3472 snprintf(temp, sizeof temp, "%d", idx.tag_seek[j]);
3473 write_tag(clfd, tagcache_tag_to_str(j), temp);
3474 continue;
3477 tcs->type = j;
3478 tagcache_retrieve(tcs, i, tcs->type, buf, sizeof buf);
3479 write_tag(clfd, tagcache_tag_to_str(j), buf);
3482 write(clfd, "\n", 1);
3483 do_timed_yield();
3486 close(clfd);
3488 tagcache_search_finish(tcs);
3490 return true;
3493 static bool delete_entry(long idx_id)
3495 int fd = -1;
3496 int masterfd = -1;
3497 int tag, i;
3498 struct index_entry idx, myidx;
3499 struct master_header myhdr;
3500 char buf[TAG_MAXLEN+32];
3501 int in_use[TAG_COUNT];
3503 logf("delete_entry(): %ld", idx_id);
3505 #ifdef HAVE_TC_RAMCACHE
3506 /* At first mark the entry removed from ram cache. */
3507 if (tc_stat.ramcache)
3508 hdr->indices[idx_id].flag |= FLAG_DELETED;
3509 #endif
3511 if ( (masterfd = open_master_fd(&myhdr, true) ) < 0)
3512 return false;
3514 lseek(masterfd, idx_id * sizeof(struct index_entry), SEEK_CUR);
3515 if (ecread(masterfd, &myidx, 1, index_entry_ec, tc_stat.econ)
3516 != sizeof(struct index_entry))
3518 logf("delete_entry(): read error");
3519 goto cleanup;
3522 if (myidx.flag & FLAG_DELETED)
3524 logf("delete_entry(): already deleted!");
3525 goto cleanup;
3528 myidx.flag |= FLAG_DELETED;
3529 lseek(masterfd, -sizeof(struct index_entry), SEEK_CUR);
3530 if (ecwrite(masterfd, &myidx, 1, index_entry_ec, tc_stat.econ)
3531 != sizeof(struct index_entry))
3533 logf("delete_entry(): write_error #1");
3534 goto cleanup;
3537 /* Now check which tags are no longer in use (if any) */
3538 for (tag = 0; tag < TAG_COUNT; tag++)
3539 in_use[tag] = 0;
3541 lseek(masterfd, sizeof(struct master_header), SEEK_SET);
3542 for (i = 0; i < myhdr.tch.entry_count; i++)
3544 struct index_entry *idxp;
3546 #ifdef HAVE_TC_RAMCACHE
3547 /* Use RAM DB if available for greater speed */
3548 if (tc_stat.ramcache)
3549 idxp = &hdr->indices[i];
3550 else
3551 #endif
3553 if (ecread(masterfd, &idx, 1, index_entry_ec, tc_stat.econ)
3554 != sizeof(struct index_entry))
3556 logf("delete_entry(): read error #2");
3557 goto cleanup;
3559 idxp = &idx;
3562 if (idxp->flag & FLAG_DELETED)
3563 continue;
3565 for (tag = 0; tag < TAG_COUNT; tag++)
3567 if (TAGCACHE_IS_NUMERIC(tag))
3568 continue;
3570 if (idxp->tag_seek[tag] == myidx.tag_seek[tag])
3571 in_use[tag]++;
3575 /* Now delete all tags no longer in use. */
3576 for (tag = 0; tag < TAG_COUNT; tag++)
3578 struct tagcache_header tch;
3579 int oldseek = myidx.tag_seek[tag];
3581 if (TAGCACHE_IS_NUMERIC(tag))
3582 continue;
3584 /**
3585 * Replace tag seek with a hash value of the field string data.
3586 * That way runtime statistics of moved or altered files can be
3587 * resurrected.
3589 #ifdef HAVE_TC_RAMCACHE
3590 if (tc_stat.ramcache && tag != tag_filename)
3592 struct tagfile_entry *tfe;
3593 int32_t *seek = &hdr->indices[idx_id].tag_seek[tag];
3595 tfe = (struct tagfile_entry *)&hdr->tags[tag][*seek];
3596 *seek = crc_32(tfe->tag_data, strlen(tfe->tag_data), 0xffffffff);
3597 myidx.tag_seek[tag] = *seek;
3599 else
3600 #endif
3602 struct tagfile_entry tfe;
3604 /* Open the index file, which contains the tag names. */
3605 if ((fd = open_tag_fd(&tch, tag, true)) < 0)
3606 goto cleanup;
3608 /* Skip the header block */
3609 lseek(fd, myidx.tag_seek[tag], SEEK_SET);
3610 if (ecread(fd, &tfe, 1, tagfile_entry_ec, tc_stat.econ)
3611 != sizeof(struct tagfile_entry))
3613 logf("delete_entry(): read error #3");
3614 goto cleanup;
3617 if (read(fd, buf, tfe.tag_length) != tfe.tag_length)
3619 logf("delete_entry(): read error #4");
3620 goto cleanup;
3623 myidx.tag_seek[tag] = crc_32(buf, strlen(buf), 0xffffffff);
3626 if (in_use[tag])
3628 logf("in use: %d/%d", tag, in_use[tag]);
3629 if (fd >= 0)
3631 close(fd);
3632 fd = -1;
3634 continue;
3637 #ifdef HAVE_TC_RAMCACHE
3638 /* Delete from ram. */
3639 if (tc_stat.ramcache && tag != tag_filename)
3641 struct tagfile_entry *tagentry = (struct tagfile_entry *)&hdr->tags[tag][oldseek];
3642 tagentry->tag_data[0] = '\0';
3644 #endif
3646 /* Open the index file, which contains the tag names. */
3647 if (fd < 0)
3649 if ((fd = open_tag_fd(&tch, tag, true)) < 0)
3650 goto cleanup;
3653 /* Skip the header block */
3654 lseek(fd, oldseek + sizeof(struct tagfile_entry), SEEK_SET);
3656 /* Debug, print 10 first characters of the tag
3657 read(fd, buf, 10);
3658 buf[10]='\0';
3659 logf("TAG:%s", buf);
3660 lseek(fd, -10, SEEK_CUR);
3663 /* Write first data byte in tag as \0 */
3664 write(fd, "", 1);
3666 /* Now tag data has been removed */
3667 close(fd);
3668 fd = -1;
3671 /* Write index entry back into master index. */
3672 lseek(masterfd, sizeof(struct master_header) +
3673 (idx_id * sizeof(struct index_entry)), SEEK_SET);
3674 if (ecwrite(masterfd, &myidx, 1, index_entry_ec, tc_stat.econ)
3675 != sizeof(struct index_entry))
3677 logf("delete_entry(): write_error #2");
3678 goto cleanup;
3681 close(masterfd);
3683 return true;
3685 cleanup:
3686 if (fd >= 0)
3687 close(fd);
3688 if (masterfd >= 0)
3689 close(masterfd);
3691 return false;
3694 #ifndef __PCTOOL__
3696 * Returns true if there is an event waiting in the queue
3697 * that requires the current operation to be aborted.
3699 static bool check_event_queue(void)
3701 struct queue_event ev;
3703 queue_wait_w_tmo(&tagcache_queue, &ev, 0);
3704 switch (ev.id)
3706 case Q_STOP_SCAN:
3707 case SYS_POWEROFF:
3708 case SYS_USB_CONNECTED:
3709 /* Put the event back into the queue. */
3710 queue_post(&tagcache_queue, ev.id, ev.data);
3711 return true;
3714 return false;
3716 #endif
3718 #ifdef HAVE_TC_RAMCACHE
3719 static bool allocate_tagcache(void)
3721 struct master_header tcmh;
3722 int fd;
3724 /* Load the header. */
3725 if ( (fd = open_master_fd(&tcmh, false)) < 0)
3727 hdr = NULL;
3728 return false;
3731 close(fd);
3733 /**
3734 * Now calculate the required cache size plus
3735 * some extra space for alignment fixes.
3737 tc_stat.ramcache_allocated = tcmh.tch.datasize + 128 + TAGCACHE_RESERVE +
3738 sizeof(struct ramcache_header) + TAG_COUNT*sizeof(void *);
3739 hdr = buffer_alloc(tc_stat.ramcache_allocated + 128);
3740 memset(hdr, 0, sizeof(struct ramcache_header));
3741 memcpy(&hdr->h, &tcmh, sizeof(struct master_header));
3742 hdr->indices = (struct index_entry *)(hdr + 1);
3743 logf("tagcache: %d bytes allocated.", tc_stat.ramcache_allocated);
3745 return true;
3748 # ifdef HAVE_EEPROM_SETTINGS
3749 static bool tagcache_dumpload(void)
3751 struct statefile_header shdr;
3752 int fd, rc;
3753 long offpos;
3754 int i;
3756 fd = open(TAGCACHE_STATEFILE, O_RDONLY);
3757 if (fd < 0)
3759 logf("no tagcache statedump");
3760 return false;
3763 /* Check the statefile memory placement */
3764 hdr = buffer_alloc(0);
3765 rc = read(fd, &shdr, sizeof(struct statefile_header));
3766 if (rc != sizeof(struct statefile_header)
3767 /* || (long)hdr != (long)shdr.hdr */)
3769 logf("incorrect statefile");
3770 hdr = NULL;
3771 close(fd);
3772 return false;
3775 offpos = (long)hdr - (long)shdr.hdr;
3777 /* Lets allocate real memory and load it */
3778 hdr = buffer_alloc(shdr.tc_stat.ramcache_allocated);
3779 rc = read(fd, hdr, shdr.tc_stat.ramcache_allocated);
3780 close(fd);
3782 if (rc != shdr.tc_stat.ramcache_allocated)
3784 logf("read failure!");
3785 hdr = NULL;
3786 return false;
3789 memcpy(&tc_stat, &shdr.tc_stat, sizeof(struct tagcache_stat));
3791 /* Now fix the pointers */
3792 hdr->indices = (struct index_entry *)((long)hdr->indices + offpos);
3793 for (i = 0; i < TAG_COUNT; i++)
3794 hdr->tags[i] += offpos;
3796 return true;
3799 static bool tagcache_dumpsave(void)
3801 struct statefile_header shdr;
3802 int fd;
3804 if (!tc_stat.ramcache)
3805 return false;
3807 fd = open(TAGCACHE_STATEFILE, O_WRONLY | O_CREAT | O_TRUNC);
3808 if (fd < 0)
3810 logf("failed to create a statedump");
3811 return false;
3814 /* Create the header */
3815 shdr.hdr = hdr;
3816 memcpy(&shdr.tc_stat, &tc_stat, sizeof(struct tagcache_stat));
3817 write(fd, &shdr, sizeof(struct statefile_header));
3819 /* And dump the data too */
3820 write(fd, hdr, tc_stat.ramcache_allocated);
3821 close(fd);
3823 return true;
3825 # endif
3827 static bool load_tagcache(void)
3829 struct tagcache_header *tch;
3830 long bytesleft = tc_stat.ramcache_allocated;
3831 struct index_entry *idx;
3832 int rc, fd;
3833 char *p;
3834 int i, tag;
3836 # ifdef HAVE_DIRCACHE
3837 while (dircache_is_initializing())
3838 sleep(1);
3840 dircache_set_appflag(DIRCACHE_APPFLAG_TAGCACHE);
3841 # endif
3843 logf("loading tagcache to ram...");
3845 fd = open(TAGCACHE_FILE_MASTER, O_RDONLY);
3846 if (fd < 0)
3848 logf("tagcache open failed");
3849 return false;
3852 if (ecread(fd, &hdr->h, 1, master_header_ec, tc_stat.econ)
3853 != sizeof(struct master_header)
3854 || hdr->h.tch.magic != TAGCACHE_MAGIC)
3856 logf("incorrect header");
3857 return false;
3860 idx = hdr->indices;
3862 /* Load the master index table. */
3863 for (i = 0; i < hdr->h.tch.entry_count; i++)
3865 rc = ecread(fd, idx, 1, index_entry_ec, tc_stat.econ);
3866 if (rc != sizeof(struct index_entry))
3868 logf("read error #10");
3869 close(fd);
3870 return false;
3873 bytesleft -= sizeof(struct index_entry);
3874 if (bytesleft < 0 || ((long)idx - (long)hdr->indices) >= tc_stat.ramcache_allocated)
3876 logf("too big tagcache.");
3877 close(fd);
3878 return false;
3881 idx++;
3884 close(fd);
3886 /* Load the tags. */
3887 p = (char *)idx;
3888 for (tag = 0; tag < TAG_COUNT; tag++)
3890 struct tagfile_entry *fe;
3891 char buf[TAG_MAXLEN+32];
3893 if (TAGCACHE_IS_NUMERIC(tag))
3894 continue ;
3896 //p = ((void *)p+1);
3897 p = (char *)((long)p & ~0x03) + 0x04;
3898 hdr->tags[tag] = p;
3900 /* Check the header. */
3901 tch = (struct tagcache_header *)p;
3902 p += sizeof(struct tagcache_header);
3904 if ( (fd = open_tag_fd(tch, tag, false)) < 0)
3905 return false;
3907 for (hdr->entry_count[tag] = 0;
3908 hdr->entry_count[tag] < tch->entry_count;
3909 hdr->entry_count[tag]++)
3911 long pos;
3913 if (do_timed_yield())
3915 /* Abort if we got a critical event in queue */
3916 if (check_event_queue())
3917 return false;
3920 fe = (struct tagfile_entry *)p;
3921 pos = lseek(fd, 0, SEEK_CUR);
3922 rc = ecread(fd, fe, 1, tagfile_entry_ec, tc_stat.econ);
3923 if (rc != sizeof(struct tagfile_entry))
3925 /* End of lookup table. */
3926 logf("read error #11");
3927 close(fd);
3928 return false;
3931 /* We have a special handling for the filename tags. */
3932 if (tag == tag_filename)
3934 # ifdef HAVE_DIRCACHE
3935 const struct dirent *dc;
3936 # endif
3938 // FIXME: This is wrong!
3939 // idx = &hdr->indices[hdr->entry_count[i]];
3940 idx = &hdr->indices[fe->idx_id];
3942 if (fe->tag_length >= (long)sizeof(buf)-1)
3944 read(fd, buf, 10);
3945 buf[10] = '\0';
3946 logf("TAG:%s", buf);
3947 logf("too long filename");
3948 close(fd);
3949 return false;
3952 rc = read(fd, buf, fe->tag_length);
3953 if (rc != fe->tag_length)
3955 logf("read error #12");
3956 close(fd);
3957 return false;
3960 /* Check if the entry has already been removed */
3961 if (idx->flag & FLAG_DELETED)
3962 continue;
3964 /* This flag must not be used yet. */
3965 if (idx->flag & FLAG_DIRCACHE)
3967 logf("internal error!");
3968 close(fd);
3969 return false;
3972 if (idx->tag_seek[tag] != pos)
3974 logf("corrupt data structures!");
3975 close(fd);
3976 return false;
3979 # ifdef HAVE_DIRCACHE
3980 if (dircache_is_enabled())
3982 dc = dircache_get_entry_ptr(buf);
3983 if (dc == NULL)
3985 logf("Entry no longer valid.");
3986 logf("-> %s", buf);
3987 if (global_settings.tagcache_autoupdate)
3988 delete_entry(fe->idx_id);
3989 continue ;
3992 idx->flag |= FLAG_DIRCACHE;
3993 idx->tag_seek[tag_filename] = (long)dc;
3995 else
3996 # endif
3998 /* This will be very slow unless dircache is enabled
3999 or target is flash based, but do it anyway for
4000 consistency. */
4001 /* Check if entry has been removed. */
4002 if (global_settings.tagcache_autoupdate)
4004 if (!file_exists(buf))
4006 logf("Entry no longer valid.");
4007 logf("-> %s", buf);
4008 delete_entry(fe->idx_id);
4009 continue;
4014 continue ;
4017 bytesleft -= sizeof(struct tagfile_entry) + fe->tag_length;
4018 if (bytesleft < 0)
4020 logf("too big tagcache #2");
4021 logf("tl: %d", fe->tag_length);
4022 logf("bl: %ld", bytesleft);
4023 close(fd);
4024 return false;
4027 p = fe->tag_data;
4028 rc = read(fd, fe->tag_data, fe->tag_length);
4029 p += rc;
4031 if (rc != fe->tag_length)
4033 logf("read error #13");
4034 logf("rc=0x%04x", rc); // 0x431
4035 logf("len=0x%04x", fe->tag_length); // 0x4000
4036 logf("pos=0x%04lx", lseek(fd, 0, SEEK_CUR)); // 0x433
4037 logf("tag=0x%02x", tag); // 0x00
4038 close(fd);
4039 return false;
4042 close(fd);
4045 tc_stat.ramcache_used = tc_stat.ramcache_allocated - bytesleft;
4046 logf("tagcache loaded into ram!");
4048 return true;
4050 #endif /* HAVE_TC_RAMCACHE */
4052 static bool check_deleted_files(void)
4054 int fd;
4055 char buf[TAG_MAXLEN+32];
4056 struct tagfile_entry tfe;
4058 logf("reverse scan...");
4059 snprintf(buf, sizeof buf, TAGCACHE_FILE_INDEX, tag_filename);
4060 fd = open(buf, O_RDONLY);
4062 if (fd < 0)
4064 logf("%s open fail", buf);
4065 return false;
4068 lseek(fd, sizeof(struct tagcache_header), SEEK_SET);
4069 while (ecread(fd, &tfe, 1, tagfile_entry_ec, tc_stat.econ)
4070 == sizeof(struct tagfile_entry)
4071 #ifndef __PCTOOL__
4072 && !check_event_queue()
4073 #endif
4076 if (tfe.tag_length >= (long)sizeof(buf)-1)
4078 logf("too long tag");
4079 close(fd);
4080 return false;
4083 if (read(fd, buf, tfe.tag_length) != tfe.tag_length)
4085 logf("read error #14");
4086 close(fd);
4087 return false;
4090 /* Check if the file has already deleted from the db. */
4091 if (*buf == '\0')
4092 continue;
4094 /* Now check if the file exists. */
4095 if (!file_exists(buf))
4097 logf("Entry no longer valid.");
4098 logf("-> %s / %d", buf, tfe.tag_length);
4099 delete_entry(tfe.idx_id);
4103 close(fd);
4105 logf("done");
4107 return true;
4111 /* Note that this function must not be inlined, otherwise the whole point
4112 * of having the code in a separate function is lost.
4114 static void __attribute__ ((noinline)) check_ignore(const char *dirname,
4115 int *ignore, int *unignore)
4117 char newpath[MAX_PATH];
4119 /* check for a database.ignore file */
4120 snprintf(newpath, MAX_PATH, "%s/database.ignore", dirname);
4121 *ignore = file_exists(newpath);
4122 /* check for a database.unignore file */
4123 snprintf(newpath, MAX_PATH, "%s/database.unignore", dirname);
4124 *unignore = file_exists(newpath);
4128 static bool check_dir(const char *dirname, int add_files)
4130 DIR *dir;
4131 int len;
4132 int success = false;
4133 int ignore, unignore;
4135 dir = opendir(dirname);
4136 if (!dir)
4138 logf("tagcache: opendir() failed");
4139 return false;
4142 /* check for a database.ignore and database.unignore */
4143 check_ignore(dirname, &ignore, &unignore);
4145 /* don't do anything if both ignore and unignore are there */
4146 if (ignore != unignore)
4147 add_files = unignore;
4149 /* Recursively scan the dir. */
4150 #ifdef __PCTOOL__
4151 while (1)
4152 #else
4153 while (!check_event_queue())
4154 #endif
4156 struct dirent *entry;
4158 entry = readdir(dir);
4160 if (entry == NULL)
4162 success = true;
4163 break ;
4166 if (!strcmp((char *)entry->d_name, ".") ||
4167 !strcmp((char *)entry->d_name, ".."))
4168 continue;
4170 yield();
4172 len = strlen(curpath);
4173 snprintf(&curpath[len], sizeof(curpath) - len, "/%s",
4174 entry->d_name);
4176 processed_dir_count++;
4177 if (entry->attribute & ATTR_DIRECTORY)
4178 check_dir(curpath, add_files);
4179 else if (add_files)
4181 tc_stat.curentry = curpath;
4183 /* Add a new entry to the temporary db file. */
4184 add_tagcache(curpath, (entry->wrtdate << 16) | entry->wrttime
4185 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
4186 , dir->internal_entry
4187 #endif
4190 /* Wait until current path for debug screen is read and unset. */
4191 while (tc_stat.syncscreen && tc_stat.curentry != NULL)
4192 yield();
4194 tc_stat.curentry = NULL;
4197 curpath[len] = '\0';
4200 closedir(dir);
4202 return success;
4205 void tagcache_screensync_event(void)
4207 tc_stat.curentry = NULL;
4210 void tagcache_screensync_enable(bool state)
4212 tc_stat.syncscreen = state;
4215 void tagcache_build(const char *path)
4217 struct tagcache_header header;
4218 bool ret;
4220 curpath[0] = '\0';
4221 data_size = 0;
4222 total_entry_count = 0;
4223 processed_dir_count = 0;
4225 #ifdef HAVE_DIRCACHE
4226 while (dircache_is_initializing())
4227 sleep(1);
4228 #endif
4230 logf("updating tagcache");
4232 cachefd = open(TAGCACHE_FILE_TEMP, O_RDONLY);
4233 if (cachefd >= 0)
4235 logf("skipping, cache already waiting for commit");
4236 close(cachefd);
4237 return ;
4240 cachefd = open(TAGCACHE_FILE_TEMP, O_RDWR | O_CREAT | O_TRUNC);
4241 if (cachefd < 0)
4243 logf("master file open failed: %s", TAGCACHE_FILE_TEMP);
4244 return ;
4247 filenametag_fd = open_tag_fd(&header, tag_filename, false);
4249 cpu_boost(true);
4251 logf("Scanning files...");
4252 /* Scan for new files. */
4253 memset(&header, 0, sizeof(struct tagcache_header));
4254 write(cachefd, &header, sizeof(struct tagcache_header));
4256 if (strcmp("/", path) != 0)
4257 strcpy(curpath, path);
4258 ret = check_dir(path, true);
4260 /* Write the header. */
4261 header.magic = TAGCACHE_MAGIC;
4262 header.datasize = data_size;
4263 header.entry_count = total_entry_count;
4264 lseek(cachefd, 0, SEEK_SET);
4265 write(cachefd, &header, sizeof(struct tagcache_header));
4266 close(cachefd);
4268 if (filenametag_fd >= 0)
4270 close(filenametag_fd);
4271 filenametag_fd = -1;
4274 if (!ret)
4276 logf("Aborted.");
4277 cpu_boost(false);
4278 return ;
4281 /* Commit changes to the database. */
4282 #ifdef __PCTOOL__
4283 allocate_tempbuf();
4284 #endif
4285 if (commit())
4287 remove(TAGCACHE_FILE_TEMP);
4288 logf("tagcache built!");
4290 #ifdef __PCTOOL__
4291 free_tempbuf();
4292 #endif
4294 #ifdef HAVE_TC_RAMCACHE
4295 if (hdr)
4297 /* Import runtime statistics if we just initialized the db. */
4298 if (hdr->h.serial == 0)
4299 queue_post(&tagcache_queue, Q_IMPORT_CHANGELOG, 0);
4301 #endif
4303 cpu_boost(false);
4306 #ifdef HAVE_TC_RAMCACHE
4307 static void load_ramcache(void)
4309 if (!hdr)
4310 return ;
4312 cpu_boost(true);
4314 /* At first we should load the cache (if exists). */
4315 tc_stat.ramcache = load_tagcache();
4317 if (!tc_stat.ramcache)
4319 /* If loading failed, it must indicate some problem with the db
4320 * so disable it entirely to prevent further issues. */
4321 tc_stat.ready = false;
4322 hdr = NULL;
4325 cpu_boost(false);
4328 void tagcache_unload_ramcache(void)
4330 tc_stat.ramcache = false;
4331 /* Just to make sure there is no statefile present. */
4332 // remove(TAGCACHE_STATEFILE);
4334 #endif
4336 #ifndef __PCTOOL__
4337 static void tagcache_thread(void)
4339 struct queue_event ev;
4340 bool check_done = false;
4342 /* If the previous cache build/update was interrupted, commit
4343 * the changes first in foreground. */
4344 cpu_boost(true);
4345 allocate_tempbuf();
4346 commit();
4347 free_tempbuf();
4349 #ifdef HAVE_TC_RAMCACHE
4350 # ifdef HAVE_EEPROM_SETTINGS
4351 if (firmware_settings.initialized && firmware_settings.disk_clean)
4352 check_done = tagcache_dumpload();
4354 remove(TAGCACHE_STATEFILE);
4355 # endif
4357 /* Allocate space for the tagcache if found on disk. */
4358 if (global_settings.tagcache_ram && !tc_stat.ramcache)
4359 allocate_tagcache();
4360 #endif
4362 cpu_boost(false);
4363 tc_stat.initialized = true;
4365 /* Don't delay bootup with the header check but do it on background. */
4366 sleep(HZ);
4367 tc_stat.ready = check_all_headers();
4368 tc_stat.readyvalid = true;
4370 while (1)
4372 run_command_queue(false);
4374 queue_wait_w_tmo(&tagcache_queue, &ev, HZ);
4376 switch (ev.id)
4378 case Q_IMPORT_CHANGELOG:
4379 tagcache_import_changelog();
4380 break;
4382 case Q_REBUILD:
4383 remove_files();
4384 remove(TAGCACHE_FILE_TEMP);
4385 tagcache_build("/");
4386 break;
4388 case Q_UPDATE:
4389 tagcache_build("/");
4390 #ifdef HAVE_TC_RAMCACHE
4391 load_ramcache();
4392 #endif
4393 check_deleted_files();
4394 break ;
4396 case Q_START_SCAN:
4397 check_done = false;
4398 case SYS_TIMEOUT:
4399 if (check_done || !tc_stat.ready)
4400 break ;
4402 #ifdef HAVE_TC_RAMCACHE
4403 if (!tc_stat.ramcache && global_settings.tagcache_ram)
4405 load_ramcache();
4406 if (tc_stat.ramcache && global_settings.tagcache_autoupdate)
4407 tagcache_build("/");
4409 else
4410 #endif
4411 if (global_settings.tagcache_autoupdate)
4413 tagcache_build("/");
4415 /* This will be very slow unless dircache is enabled
4416 or target is flash based, but do it anyway for
4417 consistency. */
4418 check_deleted_files();
4421 logf("tagcache check done");
4423 check_done = true;
4424 break ;
4426 case Q_STOP_SCAN:
4427 break ;
4429 case SYS_POWEROFF:
4430 break ;
4432 #ifndef SIMULATOR
4433 case SYS_USB_CONNECTED:
4434 logf("USB: TagCache");
4435 usb_acknowledge(SYS_USB_CONNECTED_ACK);
4436 usb_wait_for_disconnect(&tagcache_queue);
4437 break ;
4438 #endif
4443 bool tagcache_prepare_shutdown(void)
4445 if (tagcache_get_commit_step() > 0)
4446 return false;
4448 tagcache_stop_scan();
4449 while (read_lock || write_lock)
4450 sleep(1);
4452 return true;
4455 void tagcache_shutdown(void)
4457 /* Flush the command queue. */
4458 run_command_queue(true);
4460 #ifdef HAVE_EEPROM_SETTINGS
4461 if (tc_stat.ramcache)
4462 tagcache_dumpsave();
4463 #endif
4466 static int get_progress(void)
4468 int total_count = -1;
4470 #ifdef HAVE_DIRCACHE
4471 if (dircache_is_enabled())
4473 total_count = dircache_get_entry_count();
4475 else
4476 #endif
4477 #ifdef HAVE_TC_RAMCACHE
4479 if (hdr && tc_stat.ramcache)
4480 total_count = hdr->h.tch.entry_count;
4482 #endif
4484 if (total_count < 0)
4485 return -1;
4487 return processed_dir_count * 100 / total_count;
4490 struct tagcache_stat* tagcache_get_stat(void)
4492 tc_stat.progress = get_progress();
4493 tc_stat.processed_entries = processed_dir_count;
4495 return &tc_stat;
4498 void tagcache_start_scan(void)
4500 queue_post(&tagcache_queue, Q_START_SCAN, 0);
4503 bool tagcache_update(void)
4505 if (!tc_stat.ready)
4506 return false;
4508 queue_post(&tagcache_queue, Q_UPDATE, 0);
4509 return false;
4512 bool tagcache_rebuild()
4514 queue_post(&tagcache_queue, Q_REBUILD, 0);
4515 return false;
4518 void tagcache_stop_scan(void)
4520 queue_post(&tagcache_queue, Q_STOP_SCAN, 0);
4523 #ifdef HAVE_TC_RAMCACHE
4524 bool tagcache_is_ramcache(void)
4526 return tc_stat.ramcache;
4528 #endif
4530 #endif /* !__PCTOOL__ */
4533 void tagcache_init(void)
4535 memset(&tc_stat, 0, sizeof(struct tagcache_stat));
4536 memset(&current_tcmh, 0, sizeof(struct master_header));
4537 filenametag_fd = -1;
4538 write_lock = read_lock = 0;
4540 #ifndef __PCTOOL__
4541 mutex_init(&command_queue_mutex);
4542 queue_init(&tagcache_queue, true);
4543 create_thread(tagcache_thread, tagcache_stack,
4544 sizeof(tagcache_stack), 0, tagcache_thread_name
4545 IF_PRIO(, PRIORITY_BACKGROUND)
4546 IF_COP(, CPU));
4547 #else
4548 tc_stat.initialized = true;
4549 allocate_tempbuf();
4550 commit();
4551 free_tempbuf();
4552 tc_stat.ready = check_all_headers();
4553 #endif
4556 #ifdef __PCTOOL__
4557 void tagcache_reverse_scan(void)
4559 logf("Checking for deleted files");
4560 check_deleted_files();
4562 #endif
4564 bool tagcache_is_initialized(void)
4566 return tc_stat.initialized;
4568 bool tagcache_is_usable(void)
4570 return tc_stat.initialized && tc_stat.ready;
4572 int tagcache_get_commit_step(void)
4574 return tc_stat.commit_step;
4576 int tagcache_get_max_commit_step(void)
4578 return (int)(SORTED_TAGS_COUNT)+1;