1 /***************************************************************************
3 * Open \______ \ ____ ____ | | _\_ |__ _______ ___
4 * Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
5 * Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
6 * Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
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 ****************************************************************************/
25 * ----------x---------x------------------x-----
27 * +---------------x-------+ | TagCache | Libraries
28 * | Modification routines | | Core |
29 * +-x---------x-----------+ | |
31 * | +------x-------------x-+ +-------------x-----+ |
32 * | | x==x Filters & clauses | |
33 * | | Search routines | +-------------------+ |
34 * | | x============================x DirCache
35 * | +-x--------------------+ | (optional)
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*/
64 #include <unistd.h> /* readlink() */
65 #include <limits.h> /* PATH_MAX */
68 #include "ata_idle_notify.h"
73 #include "string-extra.h"
82 #include "filefuncs.h"
88 #include "eeprom_settings.h"
92 #define yield() do { } while(0)
93 #define sim_sleep(timeout) do { } while(0)
94 #define do_timed_yield() do { } while(0)
98 /* Tag Cache thread. */
99 static struct event_queue tagcache_queue
;
100 static long tagcache_stack
[(DEFAULT_STACK_SIZE
+ 0x4000)/sizeof(long)];
101 static const char tagcache_thread_name
[] = "tagcache";
104 /* Previous path when scanning directory tree recursively. */
105 static char curpath
[TAG_MAXLEN
+32];
107 /* Used when removing duplicates. */
108 static char *tempbuf
; /* Allocated when needed. */
109 static long tempbufidx
; /* Current location in buffer. */
110 static long tempbuf_size
; /* Buffer size (TEMPBUF_SIZE). */
111 static long tempbuf_left
; /* Buffer space left. */
112 static long tempbuf_pos
;
114 #define SORTED_TAGS_COUNT 8
115 #define TAGCACHE_IS_UNIQUE(tag) (BIT_N(tag) & TAGCACHE_UNIQUE_TAGS)
116 #define TAGCACHE_IS_SORTED(tag) (BIT_N(tag) & TAGCACHE_SORTED_TAGS)
117 #define TAGCACHE_IS_NUMERIC_OR_NONUNIQUE(tag) \
118 (BIT_N(tag) & (TAGCACHE_NUMERIC_TAGS | ~TAGCACHE_UNIQUE_TAGS))
119 /* Tags we want to get sorted (loaded to the tempbuf). */
120 #define TAGCACHE_SORTED_TAGS ((1LU << tag_artist) | (1LU << tag_album) | \
121 (1LU << tag_genre) | (1LU << tag_composer) | (1LU << tag_comment) | \
122 (1LU << tag_albumartist) | (1LU << tag_grouping) | (1LU << tag_title))
124 /* Uniqued tags (we can use these tags with filters and conditional clauses). */
125 #define TAGCACHE_UNIQUE_TAGS ((1LU << tag_artist) | (1LU << tag_album) | \
126 (1LU << tag_genre) | (1LU << tag_composer) | (1LU << tag_comment) | \
127 (1LU << tag_albumartist) | (1LU << tag_grouping))
129 /* String presentation of the tags defined in tagcache.h. Must be in correct order! */
130 static const char *tags_str
[] = { "artist", "album", "genre", "title",
131 "filename", "composer", "comment", "albumartist", "grouping", "year",
132 "discnumber", "tracknumber", "bitrate", "length", "playcount", "rating",
133 "playtime", "lastplayed", "commitid", "mtime" };
135 /* Status information of the tagcache. */
136 static struct tagcache_stat tc_stat
;
138 /* Queue commands. */
139 enum tagcache_queue
{
146 /* Internal tagcache command queue. */
147 CMD_UPDATE_MASTER_HEADER
,
151 struct tagcache_command_entry
{
159 static struct tagcache_command_entry command_queue
[TAGCACHE_COMMAND_QUEUE_LENGTH
];
160 static volatile int command_queue_widx
= 0;
161 static volatile int command_queue_ridx
= 0;
162 static struct mutex command_queue_mutex
;
165 /* Tag database structures. */
167 /* Variable-length tag entry in tag files. */
168 struct tagfile_entry
{
169 int32_t tag_length
; /* Length of the data in bytes including '\0' */
170 int32_t idx_id
; /* Corresponding entry location in index file of not unique tags */
171 char tag_data
[0]; /* Begin of the tag data */
174 /* Fixed-size tag entry in master db index. */
176 int32_t tag_seek
[TAG_COUNT
]; /* Location of tag data or numeric tag data */
177 int32_t flag
; /* Status flags */
180 /* Header is the same in every file. */
181 struct tagcache_header
{
182 int32_t magic
; /* Header version number */
183 int32_t datasize
; /* Data size in bytes */
184 int32_t entry_count
; /* Number of entries in this file */
187 struct master_header
{
188 struct tagcache_header tch
;
189 int32_t serial
; /* Increasing counting number */
190 int32_t commitid
; /* Number of commits so far */
194 /* For the endianess correction */
195 static const char *tagfile_entry_ec
= "ll";
197 Note: This should be (1 + TAG_COUNT) amount of l's.
199 static const char *index_entry_ec
= "llllllllllllllllllllll";
201 static const char *tagcache_header_ec
= "lll";
202 static const char *master_header_ec
= "llllll";
204 static struct master_header current_tcmh
;
206 #ifdef HAVE_TC_RAMCACHE
207 /* Header is created when loading database to ram. */
208 struct ramcache_header
{
209 struct master_header h
; /* Header from the master index */
210 struct index_entry
*indices
; /* Master index file content */
211 char *tags
[TAG_COUNT
]; /* Tag file content (not including filename tag) */
212 int entry_count
[TAG_COUNT
]; /* Number of entries in the indices. */
215 # ifdef HAVE_EEPROM_SETTINGS
216 struct statefile_header
{
217 struct ramcache_header
*hdr
;
218 struct tagcache_stat tc_stat
;
222 /* Pointer to allocated ramcache_header */
223 static struct ramcache_header
*hdr
;
227 * Full tag entries stored in a temporary file waiting
228 * for commit to the cache. */
229 struct temp_file_entry
{
230 long tag_offset
[TAG_COUNT
];
231 short tag_length
[TAG_COUNT
];
237 struct tempbuf_id_list
{
239 struct tempbuf_id_list
*next
;
242 struct tempbuf_searchidx
{
246 struct tempbuf_id_list idlist
;
249 /* Lookup buffer for fixing messed up index while after sorting. */
250 static long commit_entry_count
;
251 static long lookup_buffer_depth
;
252 static struct tempbuf_searchidx
**lookup
;
254 /* Used when building the temporary file. */
255 static int cachefd
= -1, filenametag_fd
;
256 static int total_entry_count
= 0;
257 static int data_size
= 0;
258 static int processed_dir_count
;
260 /* Thread safe locking */
261 static volatile int write_lock
;
262 static volatile int read_lock
;
264 static bool delete_entry(long idx_id
);
266 const char* tagcache_tag_to_str(int tag
)
268 return tags_str
[tag
];
271 /* Helper functions for the two most read/write data structure: tagfile_entry and index_entry */
272 static ssize_t
ecread_tagfile_entry(int fd
, struct tagfile_entry
*buf
)
274 return ecread(fd
, buf
, 1, tagfile_entry_ec
, tc_stat
.econ
);
277 static ssize_t
ecread_index_entry(int fd
, struct index_entry
*buf
)
279 return ecread(fd
, buf
, 1, index_entry_ec
, tc_stat
.econ
);
282 static ssize_t
ecwrite_index_entry(int fd
, struct index_entry
*buf
)
284 return ecwrite(fd
, buf
, 1, index_entry_ec
, tc_stat
.econ
);
289 * Returns true if specified flag is still present, i.e., dircache
290 * has not been reloaded.
292 static bool is_dircache_intact(void)
294 return dircache_get_appflag(DIRCACHE_APPFLAG_TAGCACHE
);
298 static int open_tag_fd(struct tagcache_header
*hdr
, int tag
, bool write
)
304 if (TAGCACHE_IS_NUMERIC(tag
) || tag
< 0 || tag
>= TAG_COUNT
)
307 snprintf(buf
, sizeof buf
, TAGCACHE_FILE_INDEX
, tag
);
309 fd
= open(buf
, write
? O_RDWR
: O_RDONLY
);
312 logf("tag file open failed: tag=%d write=%d file=%s", tag
, write
, buf
);
313 tc_stat
.ready
= false;
317 /* Check the header. */
318 rc
= ecread(fd
, hdr
, 1, tagcache_header_ec
, tc_stat
.econ
);
319 if (hdr
->magic
!= TAGCACHE_MAGIC
|| rc
!= sizeof(struct tagcache_header
))
321 logf("header error");
322 tc_stat
.ready
= false;
330 static int open_master_fd(struct master_header
*hdr
, bool write
)
335 fd
= open(TAGCACHE_FILE_MASTER
, write
? O_RDWR
: O_RDONLY
);
338 logf("master file open failed for R/W");
339 tc_stat
.ready
= false;
343 tc_stat
.econ
= false;
345 /* Check the header. */
346 rc
= read(fd
, hdr
, sizeof(struct master_header
));
347 if (hdr
->tch
.magic
== TAGCACHE_MAGIC
&& rc
== sizeof(struct master_header
))
353 /* Trying to read again, this time with endianess correction enabled. */
354 lseek(fd
, 0, SEEK_SET
);
356 rc
= ecread(fd
, hdr
, 1, master_header_ec
, true);
357 if (hdr
->tch
.magic
!= TAGCACHE_MAGIC
|| rc
!= sizeof(struct master_header
))
359 logf("header error");
360 tc_stat
.ready
= false;
371 static bool do_timed_yield(void)
373 /* Sorting can lock up for quite a while, so yield occasionally */
374 static long wakeup_tick
= 0;
375 if (TIME_AFTER(current_tick
, wakeup_tick
))
377 wakeup_tick
= current_tick
+ (HZ
/4);
385 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
386 static long find_entry_ram(const char *filename
,
387 const struct dircache_entry
*dc
)
389 static long last_pos
= 0;
392 /* Check if tagcache is loaded into ram. */
393 if (!tc_stat
.ramcache
)
397 dc
= dircache_get_entry_ptr(filename
);
401 logf("tagcache: file not found.");
412 for (; i
< hdr
->h
.tch
.entry_count
; i
++)
414 if (hdr
->indices
[i
].tag_seek
[tag_filename
] == (long)dc
)
416 last_pos
= MAX(0, i
- 3);
433 static long find_entry_disk(const char *filename
, bool localfd
)
435 struct tagcache_header tch
;
436 static long last_pos
= -1;
437 long pos_history
[POS_HISTORY_COUNT
];
438 long pos_history_idx
= 0;
440 struct tagfile_entry tfe
;
442 char buf
[TAG_MAXLEN
+32];
450 if (fd
< 0 || localfd
)
453 if ( (fd
= open_tag_fd(&tch
, tag_filename
, false)) < 0)
460 lseek(fd
, last_pos
, SEEK_SET
);
462 lseek(fd
, sizeof(struct tagcache_header
), SEEK_SET
);
466 pos
= lseek(fd
, 0, SEEK_CUR
);
467 for (i
= pos_history_idx
-1; i
>= 0; i
--)
468 pos_history
[i
+1] = pos_history
[i
];
469 pos_history
[0] = pos
;
471 if (ecread_tagfile_entry(fd
, &tfe
)
472 != sizeof(struct tagfile_entry
))
477 if (tfe
.tag_length
>= (long)sizeof(buf
))
479 logf("too long tag #1");
487 if (read(fd
, buf
, tfe
.tag_length
) != tfe
.tag_length
)
489 logf("read error #2");
497 if (!strcasecmp(filename
, buf
))
499 last_pos
= pos_history
[pos_history_idx
];
504 if (pos_history_idx
< POS_HISTORY_COUNT
- 1)
518 if (fd
!= filenametag_fd
|| localfd
)
523 if (fd
!= filenametag_fd
|| localfd
)
529 static int find_index(const char *filename
)
533 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
534 if (tc_stat
.ramcache
&& is_dircache_intact())
535 idx_id
= find_entry_ram(filename
, NULL
);
539 idx_id
= find_entry_disk(filename
, true);
544 bool tagcache_find_index(struct tagcache_search
*tcs
, const char *filename
)
551 idx_id
= find_index(filename
);
555 if (!tagcache_search(tcs
, tag_filename
))
558 tcs
->entry_count
= 0;
559 tcs
->idx_id
= idx_id
;
564 static bool get_index(int masterfd
, int idxid
,
565 struct index_entry
*idx
, bool use_ram
)
567 bool localfd
= false;
571 logf("Incorrect idxid: %d", idxid
);
575 #ifdef HAVE_TC_RAMCACHE
576 if (tc_stat
.ramcache
&& use_ram
)
578 if (hdr
->indices
[idxid
].flag
& FLAG_DELETED
)
581 # ifdef HAVE_DIRCACHE
582 if (!(hdr
->indices
[idxid
].flag
& FLAG_DIRCACHE
)
583 || is_dircache_intact())
586 memcpy(idx
, &hdr
->indices
[idxid
], sizeof(struct index_entry
));
596 struct master_header tcmh
;
599 masterfd
= open_master_fd(&tcmh
, false);
604 lseek(masterfd
, idxid
* sizeof(struct index_entry
)
605 + sizeof(struct master_header
), SEEK_SET
);
606 if (ecread_index_entry(masterfd
, idx
)
607 != sizeof(struct index_entry
))
609 logf("read error #3");
619 if (idx
->flag
& FLAG_DELETED
)
627 static bool write_index(int masterfd
, int idxid
, struct index_entry
*idx
)
629 /* We need to exclude all memory only flags & tags when writing to disk. */
630 if (idx
->flag
& FLAG_DIRCACHE
)
632 logf("memory only flags!");
636 #ifdef HAVE_TC_RAMCACHE
637 /* Only update numeric data. Writing the whole index to RAM by memcpy
638 * destroys dircache pointers!
640 if (tc_stat
.ramcache
)
643 struct index_entry
*idx_ram
= &hdr
->indices
[idxid
];
645 for (tag
= 0; tag
< TAG_COUNT
; tag
++)
647 if (TAGCACHE_IS_NUMERIC(tag
))
649 idx_ram
->tag_seek
[tag
] = idx
->tag_seek
[tag
];
653 /* Don't touch the dircache flag or attributes. */
654 idx_ram
->flag
= (idx
->flag
& 0x0000ffff)
655 | (idx_ram
->flag
& (0xffff0000 | FLAG_DIRCACHE
));
659 lseek(masterfd
, idxid
* sizeof(struct index_entry
)
660 + sizeof(struct master_header
), SEEK_SET
);
661 if (ecwrite_index_entry(masterfd
, idx
) != sizeof(struct index_entry
))
663 logf("write error #3");
664 logf("idxid: %d", idxid
);
671 #endif /* !__PCTOOL__ */
673 static bool open_files(struct tagcache_search
*tcs
, int tag
)
675 if (tcs
->idxfd
[tag
] < 0)
679 snprintf(fn
, sizeof fn
, TAGCACHE_FILE_INDEX
, tag
);
680 tcs
->idxfd
[tag
] = open(fn
, O_RDONLY
);
683 if (tcs
->idxfd
[tag
] < 0)
685 logf("File not open!");
692 static bool retrieve(struct tagcache_search
*tcs
, struct index_entry
*idx
,
693 int tag
, char *buf
, long size
)
695 struct tagfile_entry tfe
;
700 if (TAGCACHE_IS_NUMERIC(tag
))
703 seek
= idx
->tag_seek
[tag
];
706 logf("Retrieve failed");
710 #ifdef HAVE_TC_RAMCACHE
713 struct tagfile_entry
*ep
;
715 # ifdef HAVE_DIRCACHE
716 if (tag
== tag_filename
&& (idx
->flag
& FLAG_DIRCACHE
)
717 && is_dircache_intact())
719 dircache_copy_path((struct dircache_entry
*)seek
,
725 if (tag
!= tag_filename
)
727 ep
= (struct tagfile_entry
*)&hdr
->tags
[tag
][seek
];
728 strlcpy(buf
, ep
->tag_data
, size
);
735 if (!open_files(tcs
, tag
))
738 lseek(tcs
->idxfd
[tag
], seek
, SEEK_SET
);
739 if (ecread_tagfile_entry(tcs
->idxfd
[tag
], &tfe
)
740 != sizeof(struct tagfile_entry
))
742 logf("read error #5");
746 if (tfe
.tag_length
>= size
)
748 logf("too small buffer");
752 if (read(tcs
->idxfd
[tag
], buf
, tfe
.tag_length
) !=
755 logf("read error #6");
759 buf
[tfe
.tag_length
] = '\0';
764 #define COMMAND_QUEUE_IS_EMPTY (command_queue_ridx == command_queue_widx)
766 static long read_numeric_tag(int tag
, int idx_id
, const struct index_entry
*idx
)
769 if (! COMMAND_QUEUE_IS_EMPTY
)
771 /* Attempt to find tag data through store-to-load forwarding in
775 mutex_lock(&command_queue_mutex
);
777 int ridx
= command_queue_widx
;
779 while (ridx
!= command_queue_ridx
)
782 ridx
= TAGCACHE_COMMAND_QUEUE_LENGTH
- 1;
784 if (command_queue
[ridx
].command
== CMD_UPDATE_NUMERIC
785 && command_queue
[ridx
].idx_id
== idx_id
786 && command_queue
[ridx
].tag
== tag
)
788 result
= command_queue
[ridx
].data
;
793 mutex_unlock(&command_queue_mutex
);
797 logf("read_numeric_tag: "
798 "Recovered tag %d value %lX from write queue",
805 return idx
->tag_seek
[tag
];
809 static long check_virtual_tags(int tag
, int idx_id
,
810 const struct index_entry
*idx
)
816 case tag_virt_length_sec
:
817 data
= (read_numeric_tag(tag_length
, idx_id
, idx
)/1000) % 60;
820 case tag_virt_length_min
:
821 data
= (read_numeric_tag(tag_length
, idx_id
, idx
)/1000) / 60;
824 case tag_virt_playtime_sec
:
825 data
= (read_numeric_tag(tag_playtime
, idx_id
, idx
)/1000) % 60;
828 case tag_virt_playtime_min
:
829 data
= (read_numeric_tag(tag_playtime
, idx_id
, idx
)/1000) / 60;
832 case tag_virt_autoscore
:
833 if (read_numeric_tag(tag_length
, idx_id
, idx
) == 0
834 || read_numeric_tag(tag_playcount
, idx_id
, idx
) == 0)
840 /* A straight calculus gives:
841 autoscore = 100 * playtime / length / playcout (1)
842 Now, consider the euclidian division of playtime by length:
843 playtime = alpha * length + beta
847 autoscore = 100 * (alpha / playcout + beta / length / playcount)
848 Both terms should be small enough to avoid any overflow
850 data
= 100 * (read_numeric_tag(tag_playtime
, idx_id
, idx
)
851 / read_numeric_tag(tag_length
, idx_id
, idx
))
852 + (100 * (read_numeric_tag(tag_playtime
, idx_id
, idx
)
853 % read_numeric_tag(tag_length
, idx_id
, idx
)))
854 / read_numeric_tag(tag_length
, idx_id
, idx
);
855 data
/= read_numeric_tag(tag_playcount
, idx_id
, idx
);
859 /* How many commits before the file has been added to the DB. */
860 case tag_virt_entryage
:
861 data
= current_tcmh
.commitid
862 - read_numeric_tag(tag_commitid
, idx_id
, idx
) - 1;
866 data
= read_numeric_tag(tag
, idx_id
, idx
);
872 long tagcache_get_numeric(const struct tagcache_search
*tcs
, int tag
)
874 struct index_entry idx
;
879 if (!TAGCACHE_IS_NUMERIC(tag
))
882 if (!get_index(tcs
->masterfd
, tcs
->idx_id
, &idx
, true))
885 return check_virtual_tags(tag
, tcs
->idx_id
, &idx
);
888 inline static bool str_ends_with(const char *str1
, const char *str2
)
890 int str_len
= strlen(str1
);
891 int clause_len
= strlen(str2
);
893 if (clause_len
> str_len
)
896 return !strcasecmp(&str1
[str_len
- clause_len
], str2
);
899 inline static bool str_oneof(const char *str
, const char *list
)
902 int l
, len
= strlen(str
);
906 sep
= strchr(list
, '|');
907 l
= sep
? (long)sep
- (long)list
: (int)strlen(list
);
908 if ((l
==len
) && !strncasecmp(str
, list
, len
))
910 list
+= sep
? l
+ 1 : l
;
916 static bool check_against_clause(long numeric
, const char *str
,
917 const struct tagcache_search_clause
*clause
)
921 switch (clause
->type
)
924 return numeric
== clause
->numeric_data
;
926 return numeric
!= clause
->numeric_data
;
928 return numeric
> clause
->numeric_data
;
930 return numeric
>= clause
->numeric_data
;
932 return numeric
< clause
->numeric_data
;
934 return numeric
<= clause
->numeric_data
;
936 logf("Incorrect numeric tag: %d", clause
->type
);
941 switch (clause
->type
)
944 return !strcasecmp(clause
->str
, str
);
946 return strcasecmp(clause
->str
, str
);
948 return 0>strcasecmp(clause
->str
, str
);
950 return 0>=strcasecmp(clause
->str
, str
);
952 return 0<strcasecmp(clause
->str
, str
);
954 return 0<=strcasecmp(clause
->str
, str
);
955 case clause_contains
:
956 return (strcasestr(str
, clause
->str
) != NULL
);
957 case clause_not_contains
:
958 return (strcasestr(str
, clause
->str
) == NULL
);
959 case clause_begins_with
:
960 return (strcasestr(str
, clause
->str
) == str
);
961 case clause_not_begins_with
:
962 return (strcasestr(str
, clause
->str
) != str
);
963 case clause_ends_with
:
964 return str_ends_with(str
, clause
->str
);
965 case clause_not_ends_with
:
966 return !str_ends_with(str
, clause
->str
);
968 return str_oneof(str
, clause
->str
);
971 logf("Incorrect tag: %d", clause
->type
);
978 static bool check_clauses(struct tagcache_search
*tcs
,
979 struct index_entry
*idx
,
980 struct tagcache_search_clause
**clause
, int count
)
984 #ifdef HAVE_TC_RAMCACHE
987 /* Go through all conditional clauses. */
988 for (i
= 0; i
< count
; i
++)
990 struct tagfile_entry
*tfe
;
995 seek
= check_virtual_tags(clause
[i
]->tag
, tcs
->idx_id
, idx
);
997 if (!TAGCACHE_IS_NUMERIC(clause
[i
]->tag
))
999 if (clause
[i
]->tag
== tag_filename
)
1001 retrieve(tcs
, idx
, tag_filename
, buf
, sizeof buf
);
1006 tfe
= (struct tagfile_entry
*)&hdr
->tags
[clause
[i
]->tag
][seek
];
1007 str
= tfe
->tag_data
;
1011 if (!check_against_clause(seek
, str
, clause
[i
]))
1018 /* Check for conditions. */
1019 for (i
= 0; i
< count
; i
++)
1021 struct tagfile_entry tfe
;
1025 seek
= check_virtual_tags(clause
[i
]->tag
, tcs
->idx_id
, idx
);
1027 memset(str
, 0, sizeof str
);
1028 if (!TAGCACHE_IS_NUMERIC(clause
[i
]->tag
))
1030 int fd
= tcs
->idxfd
[clause
[i
]->tag
];
1031 lseek(fd
, seek
, SEEK_SET
);
1032 ecread_tagfile_entry(fd
, &tfe
);
1033 if (tfe
.tag_length
>= (int)sizeof(str
))
1035 logf("Too long tag read!");
1039 read(fd
, str
, tfe
.tag_length
);
1041 /* Check if entry has been deleted. */
1046 if (!check_against_clause(seek
, str
, clause
[i
]))
1054 bool tagcache_check_clauses(struct tagcache_search
*tcs
,
1055 struct tagcache_search_clause
**clause
, int count
)
1057 struct index_entry idx
;
1062 if (!get_index(tcs
->masterfd
, tcs
->idx_id
, &idx
, true))
1065 return check_clauses(tcs
, &idx
, clause
, count
);
1068 static bool add_uniqbuf(struct tagcache_search
*tcs
, unsigned long id
)
1072 /* If uniq buffer is not defined we must return true for search to work. */
1073 if (tcs
->unique_list
== NULL
|| (!TAGCACHE_IS_UNIQUE(tcs
->type
)
1074 && !TAGCACHE_IS_NUMERIC(tcs
->type
)))
1079 for (i
= 0; i
< tcs
->unique_list_count
; i
++)
1081 /* Return false if entry is found. */
1082 if (tcs
->unique_list
[i
] == id
)
1086 if (tcs
->unique_list_count
< tcs
->unique_list_capacity
)
1088 tcs
->unique_list
[i
] = id
;
1089 tcs
->unique_list_count
++;
1095 static bool build_lookup_list(struct tagcache_search
*tcs
)
1097 struct index_entry entry
;
1100 tcs
->seek_list_count
= 0;
1102 #ifdef HAVE_TC_RAMCACHE
1104 # ifdef HAVE_DIRCACHE
1105 && (tcs
->type
!= tag_filename
|| is_dircache_intact())
1109 for (i
= tcs
->seek_pos
; i
< hdr
->h
.tch
.entry_count
; i
++)
1111 struct tagcache_seeklist_entry
*seeklist
;
1112 struct index_entry
*idx
= &hdr
->indices
[i
];
1113 if (tcs
->seek_list_count
== SEEK_LIST_SIZE
)
1116 /* Skip deleted files. */
1117 if (idx
->flag
& FLAG_DELETED
)
1120 /* Go through all filters.. */
1121 for (j
= 0; j
< tcs
->filter_count
; j
++)
1123 if (idx
->tag_seek
[tcs
->filter_tag
[j
]] != tcs
->filter_seek
[j
])
1129 if (j
< tcs
->filter_count
)
1132 /* Check for conditions. */
1133 if (!check_clauses(tcs
, idx
, tcs
->clause
, tcs
->clause_count
))
1136 /* Add to the seek list if not already in uniq buffer. */
1137 if (!add_uniqbuf(tcs
, idx
->tag_seek
[tcs
->type
]))
1141 seeklist
= &tcs
->seeklist
[tcs
->seek_list_count
];
1142 seeklist
->seek
= idx
->tag_seek
[tcs
->type
];
1143 seeklist
->flag
= idx
->flag
;
1144 seeklist
->idx_id
= i
;
1145 tcs
->seek_list_count
++;
1150 return tcs
->seek_list_count
> 0;
1154 if (tcs
->masterfd
< 0)
1156 struct master_header tcmh
;
1157 tcs
->masterfd
= open_master_fd(&tcmh
, false);
1160 lseek(tcs
->masterfd
, tcs
->seek_pos
* sizeof(struct index_entry
) +
1161 sizeof(struct master_header
), SEEK_SET
);
1163 while (ecread_index_entry(tcs
->masterfd
, &entry
)
1164 == sizeof(struct index_entry
))
1166 struct tagcache_seeklist_entry
*seeklist
;
1168 if (tcs
->seek_list_count
== SEEK_LIST_SIZE
)
1174 /* Check if entry has been deleted. */
1175 if (entry
.flag
& FLAG_DELETED
)
1178 /* Go through all filters.. */
1179 for (j
= 0; j
< tcs
->filter_count
; j
++)
1181 if (entry
.tag_seek
[tcs
->filter_tag
[j
]] != tcs
->filter_seek
[j
])
1185 if (j
< tcs
->filter_count
)
1188 /* Check for conditions. */
1189 if (!check_clauses(tcs
, &entry
, tcs
->clause
, tcs
->clause_count
))
1192 /* Add to the seek list if not already in uniq buffer. */
1193 if (!add_uniqbuf(tcs
, entry
.tag_seek
[tcs
->type
]))
1197 seeklist
= &tcs
->seeklist
[tcs
->seek_list_count
];
1198 seeklist
->seek
= entry
.tag_seek
[tcs
->type
];
1199 seeklist
->flag
= entry
.flag
;
1200 seeklist
->idx_id
= i
;
1201 tcs
->seek_list_count
++;
1206 return tcs
->seek_list_count
> 0;
1210 static void remove_files(void)
1215 tc_stat
.ready
= false;
1216 tc_stat
.ramcache
= false;
1217 tc_stat
.econ
= false;
1218 remove(TAGCACHE_FILE_MASTER
);
1219 for (i
= 0; i
< TAG_COUNT
; i
++)
1221 if (TAGCACHE_IS_NUMERIC(i
))
1224 snprintf(buf
, sizeof buf
, TAGCACHE_FILE_INDEX
, i
);
1230 static bool check_all_headers(void)
1232 struct master_header myhdr
;
1233 struct tagcache_header tch
;
1237 if ( (fd
= open_master_fd(&myhdr
, false)) < 0)
1243 logf("tagcache is dirty!");
1247 memcpy(¤t_tcmh
, &myhdr
, sizeof(struct master_header
));
1249 for (tag
= 0; tag
< TAG_COUNT
; tag
++)
1251 if (TAGCACHE_IS_NUMERIC(tag
))
1254 if ( (fd
= open_tag_fd(&tch
, tag
, false)) < 0)
1263 bool tagcache_is_busy(void)
1265 return read_lock
|| write_lock
;
1268 bool tagcache_search(struct tagcache_search
*tcs
, int tag
)
1270 struct tagcache_header tag_hdr
;
1271 struct master_header master_hdr
;
1277 memset(tcs
, 0, sizeof(struct tagcache_search
));
1278 if (tc_stat
.commit_step
> 0 || !tc_stat
.ready
)
1281 tcs
->position
= sizeof(struct tagcache_header
);
1284 tcs
->list_position
= 0;
1285 tcs
->seek_list_count
= 0;
1286 tcs
->filter_count
= 0;
1289 for (i
= 0; i
< TAG_COUNT
; i
++)
1292 #ifndef HAVE_TC_RAMCACHE
1293 tcs
->ramsearch
= false;
1295 tcs
->ramsearch
= tc_stat
.ramcache
;
1298 tcs
->entry_count
= hdr
->entry_count
[tcs
->type
];
1303 /* Always open as R/W so we can pass tcs to functions that modify data also
1304 * without failing. */
1305 tcs
->masterfd
= open_master_fd(&master_hdr
, true);
1306 if (tcs
->masterfd
< 0)
1309 if (!TAGCACHE_IS_NUMERIC(tcs
->type
))
1311 tcs
->idxfd
[tcs
->type
] = open_tag_fd(&tag_hdr
, tcs
->type
, false);
1312 if (tcs
->idxfd
[tcs
->type
] < 0)
1315 tcs
->entry_count
= tag_hdr
.entry_count
;
1319 tcs
->entry_count
= master_hdr
.tch
.entry_count
;
1324 tcs
->initialized
= true;
1330 void tagcache_search_set_uniqbuf(struct tagcache_search
*tcs
,
1331 void *buffer
, long length
)
1333 tcs
->unique_list
= (unsigned long *)buffer
;
1334 tcs
->unique_list_capacity
= length
/ sizeof(*tcs
->unique_list
);
1335 tcs
->unique_list_count
= 0;
1338 bool tagcache_search_add_filter(struct tagcache_search
*tcs
,
1341 if (tcs
->filter_count
== TAGCACHE_MAX_FILTERS
)
1344 if (TAGCACHE_IS_NUMERIC_OR_NONUNIQUE(tag
))
1347 tcs
->filter_tag
[tcs
->filter_count
] = tag
;
1348 tcs
->filter_seek
[tcs
->filter_count
] = seek
;
1349 tcs
->filter_count
++;
1354 bool tagcache_search_add_clause(struct tagcache_search
*tcs
,
1355 struct tagcache_search_clause
*clause
)
1359 if (tcs
->clause_count
>= TAGCACHE_MAX_CLAUSES
)
1361 logf("Too many clauses");
1365 /* Check if there is already a similar filter in present (filters are
1366 * much faster than clauses).
1368 for (i
= 0; i
< tcs
->filter_count
; i
++)
1370 if (tcs
->filter_tag
[i
] == clause
->tag
)
1374 if (!TAGCACHE_IS_NUMERIC(clause
->tag
) && tcs
->idxfd
[clause
->tag
] < 0)
1378 snprintf(buf
, sizeof buf
, TAGCACHE_FILE_INDEX
, clause
->tag
);
1379 tcs
->idxfd
[clause
->tag
] = open(buf
, O_RDONLY
);
1382 tcs
->clause
[tcs
->clause_count
] = clause
;
1383 tcs
->clause_count
++;
1388 static bool get_next(struct tagcache_search
*tcs
)
1390 static char buf
[TAG_MAXLEN
+32];
1391 struct tagfile_entry entry
;
1394 if (!tcs
->valid
|| !tc_stat
.ready
)
1397 if (tcs
->idxfd
[tcs
->type
] < 0 && !TAGCACHE_IS_NUMERIC(tcs
->type
)
1398 #ifdef HAVE_TC_RAMCACHE
1404 /* Relative fetch. */
1405 if (tcs
->filter_count
> 0 || tcs
->clause_count
> 0
1406 || TAGCACHE_IS_NUMERIC(tcs
->type
)
1407 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1408 /* We need to retrieve flag status for dircache. */
1409 || (tcs
->ramsearch
&& tcs
->type
== tag_filename
)
1413 struct tagcache_seeklist_entry
*seeklist
;
1415 /* Check for end of list. */
1416 if (tcs
->list_position
== tcs
->seek_list_count
)
1418 tcs
->list_position
= 0;
1420 /* Try to fetch more. */
1421 if (!build_lookup_list(tcs
))
1428 seeklist
= &tcs
->seeklist
[tcs
->list_position
];
1429 flag
= seeklist
->flag
;
1430 tcs
->position
= seeklist
->seek
;
1431 tcs
->idx_id
= seeklist
->idx_id
;
1432 tcs
->list_position
++;
1436 if (tcs
->entry_count
== 0)
1445 tcs
->result_seek
= tcs
->position
;
1447 if (TAGCACHE_IS_NUMERIC(tcs
->type
))
1449 snprintf(buf
, sizeof(buf
), "%ld", tcs
->position
);
1451 tcs
->result_len
= strlen(buf
) + 1;
1456 #ifdef HAVE_TC_RAMCACHE
1460 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1461 if (tcs
->type
== tag_filename
&& (flag
& FLAG_DIRCACHE
)
1462 && is_dircache_intact())
1464 dircache_copy_path((struct dircache_entry
*)tcs
->position
,
1467 tcs
->result_len
= strlen(buf
) + 1;
1468 tcs
->ramresult
= false;
1474 if (tcs
->type
!= tag_filename
)
1476 struct tagfile_entry
*ep
;
1478 ep
= (struct tagfile_entry
*)&hdr
->tags
[tcs
->type
][tcs
->position
];
1479 tcs
->result
= ep
->tag_data
;
1480 tcs
->result_len
= strlen(tcs
->result
) + 1;
1481 tcs
->idx_id
= ep
->idx_id
;
1482 tcs
->ramresult
= true;
1484 /* Increase position for the next run. This may get overwritten. */
1485 tcs
->position
+= sizeof(struct tagfile_entry
) + ep
->tag_length
;
1492 if (!open_files(tcs
, tcs
->type
))
1498 /* Seek stream to the correct position and continue to direct fetch. */
1499 lseek(tcs
->idxfd
[tcs
->type
], tcs
->position
, SEEK_SET
);
1501 if (ecread_tagfile_entry(tcs
->idxfd
[tcs
->type
], &entry
) != sizeof(struct tagfile_entry
))
1503 logf("read error #5");
1508 if (entry
.tag_length
> (long)sizeof(buf
))
1511 logf("too long tag #2");
1512 logf("P:%lX/%lX", tcs
->position
, entry
.tag_length
);
1516 if (read(tcs
->idxfd
[tcs
->type
], buf
, entry
.tag_length
) != entry
.tag_length
)
1519 logf("read error #4");
1524 Update the position for the next read (this may be overridden
1525 if filters or clauses are being used).
1527 tcs
->position
+= sizeof(struct tagfile_entry
) + entry
.tag_length
;
1529 tcs
->result_len
= strlen(tcs
->result
) + 1;
1530 tcs
->idx_id
= entry
.idx_id
;
1531 tcs
->ramresult
= false;
1536 bool tagcache_get_next(struct tagcache_search
*tcs
)
1538 while (get_next(tcs
))
1540 if (tcs
->result_len
> 1)
1547 bool tagcache_retrieve(struct tagcache_search
*tcs
, int idxid
,
1548 int tag
, char *buf
, long size
)
1550 struct index_entry idx
;
1553 if (!get_index(tcs
->masterfd
, idxid
, &idx
, true))
1556 return retrieve(tcs
, &idx
, tag
, buf
, size
);
1559 static bool update_master_header(void)
1561 struct master_header myhdr
;
1567 if ( (fd
= open_master_fd(&myhdr
, true)) < 0)
1570 myhdr
.serial
= current_tcmh
.serial
;
1571 myhdr
.commitid
= current_tcmh
.commitid
;
1572 myhdr
.dirty
= current_tcmh
.dirty
;
1575 lseek(fd
, 0, SEEK_SET
);
1576 ecwrite(fd
, &myhdr
, 1, master_header_ec
, tc_stat
.econ
);
1579 #ifdef HAVE_TC_RAMCACHE
1582 hdr
->h
.serial
= current_tcmh
.serial
;
1583 hdr
->h
.commitid
= current_tcmh
.commitid
;
1584 hdr
->h
.dirty
= current_tcmh
.dirty
;
1593 void tagcache_modify(struct tagcache_search
*tcs
, int type
, const char *text
)
1595 struct tagentry
*entry
;
1597 if (tcs
->type
!= tag_title
)
1600 /* We will need reserve buffer for this. */
1603 struct tagfile_entry
*ep
;
1605 ep
= (struct tagfile_entry
*)&hdr
->tags
[tcs
->type
][tcs
->result_seek
];
1606 tcs
->seek_list
[tcs
->seek_list_count
];
1609 entry
= find_entry_ram();
1614 void tagcache_search_finish(struct tagcache_search
*tcs
)
1618 if (!tcs
->initialized
)
1621 if (tcs
->masterfd
>= 0)
1623 close(tcs
->masterfd
);
1627 for (i
= 0; i
< TAG_COUNT
; i
++)
1629 if (tcs
->idxfd
[i
] >= 0)
1631 close(tcs
->idxfd
[i
]);
1636 tcs
->ramsearch
= false;
1638 tcs
->initialized
= 0;
1643 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1644 static struct tagfile_entry
*get_tag(const struct index_entry
*entry
, int tag
)
1646 return (struct tagfile_entry
*)&hdr
->tags
[tag
][entry
->tag_seek
[tag
]];
1649 static long get_tag_numeric(const struct index_entry
*entry
, int tag
, int idx_id
)
1651 return check_virtual_tags(tag
, idx_id
, entry
);
1654 static char* get_tag_string(const struct index_entry
*entry
, int tag
)
1656 char* s
= get_tag(entry
, tag
)->tag_data
;
1657 return strcmp(s
, UNTAGGED
) ? s
: NULL
;
1660 bool tagcache_fill_tags(struct mp3entry
*id3
, const char *filename
)
1662 struct index_entry
*entry
;
1665 if (!tc_stat
.ready
|| !tc_stat
.ramcache
)
1668 /* Find the corresponding entry in tagcache. */
1669 idx_id
= find_entry_ram(filename
, NULL
);
1673 entry
= &hdr
->indices
[idx_id
];
1675 memset(id3
, 0, sizeof(struct mp3entry
));
1677 id3
->title
= get_tag_string(entry
, tag_title
);
1678 id3
->artist
= get_tag_string(entry
, tag_artist
);
1679 id3
->album
= get_tag_string(entry
, tag_album
);
1680 id3
->genre_string
= get_tag_string(entry
, tag_genre
);
1681 id3
->composer
= get_tag_string(entry
, tag_composer
);
1682 id3
->comment
= get_tag_string(entry
, tag_comment
);
1683 id3
->albumartist
= get_tag_string(entry
, tag_albumartist
);
1684 id3
->grouping
= get_tag_string(entry
, tag_grouping
);
1686 id3
->length
= get_tag_numeric(entry
, tag_length
, idx_id
);
1687 id3
->playcount
= get_tag_numeric(entry
, tag_playcount
, idx_id
);
1688 id3
->rating
= get_tag_numeric(entry
, tag_rating
, idx_id
);
1689 id3
->lastplayed
= get_tag_numeric(entry
, tag_lastplayed
, idx_id
);
1690 id3
->score
= get_tag_numeric(entry
, tag_virt_autoscore
, idx_id
) / 10;
1691 id3
->year
= get_tag_numeric(entry
, tag_year
, idx_id
);
1693 id3
->discnum
= get_tag_numeric(entry
, tag_discnumber
, idx_id
);
1694 id3
->tracknum
= get_tag_numeric(entry
, tag_tracknumber
, idx_id
);
1695 id3
->bitrate
= get_tag_numeric(entry
, tag_bitrate
, idx_id
);
1696 if (id3
->bitrate
== 0)
1699 #if CONFIG_CODEC == SWCODEC
1700 if (global_settings
.autoresume_enable
)
1702 id3
->offset
= get_tag_numeric(entry
, tag_lastoffset
, idx_id
);
1703 logf("tagcache_fill_tags: Set offset for %s to %lX\n",
1704 id3
->title
, id3
->offset
);
1712 static inline void write_item(const char *item
)
1714 int len
= strlen(item
) + 1;
1717 write(cachefd
, item
, len
);
1720 static int check_if_empty(char **tag
)
1724 if (*tag
== NULL
|| **tag
== '\0')
1727 return sizeof(UNTAGGED
); /* Tag length */
1730 length
= strlen(*tag
);
1731 if (length
> TAG_MAXLEN
)
1733 logf("over length tag: %s", *tag
);
1734 length
= TAG_MAXLEN
;
1735 (*tag
)[length
] = '\0';
1741 #define ADD_TAG(entry,tag,data) \
1743 entry.tag_offset[tag] = offset; \
1744 entry.tag_length[tag] = check_if_empty(data); \
1745 offset += entry.tag_length[tag]
1746 /* GCC 3.4.6 for Coldfire can choose to inline this function. Not a good
1747 * idea, as it uses lots of stack and is called from a recursive function
1750 static void __attribute__ ((noinline
)) add_tagcache(char *path
,
1752 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1753 ,const struct dircache_entry
*dc
1757 struct mp3entry id3
;
1758 struct temp_file_entry entry
;
1762 char tracknumfix
[3];
1764 int path_length
= strlen(path
);
1765 bool has_albumartist
;
1769 /* Crude logging for the sim - to aid in debugging */
1770 int logfd
= open(ROCKBOX_DIR
"/database.log",
1771 O_WRONLY
| O_APPEND
| O_CREAT
, 0666);
1773 write(logfd
, path
, strlen(path
));
1774 write(logfd
, "\n", 1);
1782 /* Check for overlength file path. */
1783 if (path_length
> TAG_MAXLEN
)
1785 /* Path can't be shortened. */
1786 logf("Too long path: %s", path
);
1790 /* Check if the file is supported. */
1791 if (probe_file_format(path
) == AFMT_UNKNOWN
)
1794 /* Check if the file is already cached. */
1795 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
1796 if (tc_stat
.ramcache
&& is_dircache_intact())
1798 idx_id
= find_entry_ram(path
, dc
);
1802 /* Be sure the entry doesn't exist. */
1803 if (filenametag_fd
>= 0 && idx_id
< 0)
1804 idx_id
= find_entry_disk(path
, false);
1806 /* Check if file has been modified. */
1809 struct index_entry idx
;
1811 /* TODO: Mark that the index exists (for fast reverse scan) */
1812 //found_idx[idx_id/8] |= idx_id%8;
1814 if (!get_index(-1, idx_id
, &idx
, true))
1816 logf("failed to retrieve index entry");
1820 if ((unsigned long)idx
.tag_seek
[tag_mtime
] == mtime
)
1822 /* No changes to file. */
1826 /* Metadata might have been changed. Delete the entry. */
1827 logf("Re-adding: %s", path
);
1828 if (!delete_entry(idx_id
))
1830 logf("delete_entry failed: %d", idx_id
);
1835 fd
= open(path
, O_RDONLY
);
1838 logf("open fail: %s", path
);
1842 memset(&id3
, 0, sizeof(struct mp3entry
));
1843 memset(&entry
, 0, sizeof(struct temp_file_entry
));
1844 memset(&tracknumfix
, 0, sizeof(tracknumfix
));
1845 ret
= get_metadata(&id3
, fd
, path
);
1851 logf("-> %s", path
);
1853 /* Generate track number if missing. */
1854 if (id3
.tracknum
<= 0)
1856 const char *p
= strrchr(path
, '.');
1859 p
= &path
[strlen(path
)-1];
1863 if (isdigit(*p
) && isdigit(*(p
-1)))
1865 tracknumfix
[1] = *p
--;
1866 tracknumfix
[0] = *p
;
1872 if (tracknumfix
[0] != '\0')
1874 id3
.tracknum
= atoi(tracknumfix
);
1875 /* Set a flag to indicate track number has been generated. */
1876 entry
.flag
|= FLAG_TRKNUMGEN
;
1880 /* Unable to generate track number. */
1886 entry
.tag_offset
[tag_year
] = id3
.year
;
1887 entry
.tag_offset
[tag_discnumber
] = id3
.discnum
;
1888 entry
.tag_offset
[tag_tracknumber
] = id3
.tracknum
;
1889 entry
.tag_offset
[tag_length
] = id3
.length
;
1890 entry
.tag_offset
[tag_bitrate
] = id3
.bitrate
;
1891 entry
.tag_offset
[tag_mtime
] = mtime
;
1894 has_albumartist
= id3
.albumartist
!= NULL
1895 && strlen(id3
.albumartist
) > 0;
1896 has_grouping
= id3
.grouping
!= NULL
1897 && strlen(id3
.grouping
) > 0;
1899 ADD_TAG(entry
, tag_filename
, &path
);
1900 ADD_TAG(entry
, tag_title
, &id3
.title
);
1901 ADD_TAG(entry
, tag_artist
, &id3
.artist
);
1902 ADD_TAG(entry
, tag_album
, &id3
.album
);
1903 ADD_TAG(entry
, tag_genre
, &id3
.genre_string
);
1904 ADD_TAG(entry
, tag_composer
, &id3
.composer
);
1905 ADD_TAG(entry
, tag_comment
, &id3
.comment
);
1906 if (has_albumartist
)
1908 ADD_TAG(entry
, tag_albumartist
, &id3
.albumartist
);
1912 ADD_TAG(entry
, tag_albumartist
, &id3
.artist
);
1916 ADD_TAG(entry
, tag_grouping
, &id3
.grouping
);
1920 ADD_TAG(entry
, tag_grouping
, &id3
.title
);
1922 entry
.data_length
= offset
;
1924 /* Write the header */
1925 write(cachefd
, &entry
, sizeof(struct temp_file_entry
));
1927 /* And tags also... Correct order is critical */
1929 write_item(id3
.title
);
1930 write_item(id3
.artist
);
1931 write_item(id3
.album
);
1932 write_item(id3
.genre_string
);
1933 write_item(id3
.composer
);
1934 write_item(id3
.comment
);
1935 if (has_albumartist
)
1937 write_item(id3
.albumartist
);
1941 write_item(id3
.artist
);
1945 write_item(id3
.grouping
);
1949 write_item(id3
.title
);
1951 total_entry_count
++;
1954 static bool tempbuf_insert(char *str
, int id
, int idx_id
, bool unique
)
1956 struct tempbuf_searchidx
*index
= (struct tempbuf_searchidx
*)tempbuf
;
1957 int len
= strlen(str
)+1;
1960 unsigned *crcbuf
= (unsigned *)&tempbuf
[tempbuf_size
-4];
1961 char buf
[TAG_MAXLEN
+32];
1963 for (i
= 0; str
[i
] != '\0' && i
< (int)sizeof(buf
)-1; i
++)
1964 buf
[i
] = tolower(str
[i
]);
1967 crc32
= crc_32(buf
, i
, 0xffffffff);
1971 /* Check if the crc does not exist -> entry does not exist for sure. */
1972 for (i
= 0; i
< tempbufidx
; i
++)
1974 if (crcbuf
[-i
] != crc32
)
1977 if (!strcasecmp(str
, index
[i
].str
))
1979 if (id
< 0 || id
>= lookup_buffer_depth
)
1981 logf("lookup buf overf.: %d", id
);
1985 lookup
[id
] = &index
[i
];
1991 /* Insert to CRC buffer. */
1992 crcbuf
[-tempbufidx
] = crc32
;
1995 /* Insert it to the buffer. */
1996 tempbuf_left
-= len
;
1997 if (tempbuf_left
- 4 < 0 || tempbufidx
>= commit_entry_count
-1)
2000 if (id
>= lookup_buffer_depth
)
2002 logf("lookup buf overf. #2: %d", id
);
2008 lookup
[id
] = &index
[tempbufidx
];
2009 index
[tempbufidx
].idlist
.id
= id
;
2012 index
[tempbufidx
].idlist
.id
= -1;
2014 index
[tempbufidx
].idlist
.next
= NULL
;
2015 index
[tempbufidx
].idx_id
= idx_id
;
2016 index
[tempbufidx
].seek
= -1;
2017 index
[tempbufidx
].str
= &tempbuf
[tempbuf_pos
];
2018 memcpy(index
[tempbufidx
].str
, str
, len
);
2025 static int compare(const void *p1
, const void *p2
)
2029 struct tempbuf_searchidx
*e1
= (struct tempbuf_searchidx
*)p1
;
2030 struct tempbuf_searchidx
*e2
= (struct tempbuf_searchidx
*)p2
;
2032 if (strcmp(e1
->str
, UNTAGGED
) == 0)
2034 if (strcmp(e2
->str
, UNTAGGED
) == 0)
2038 else if (strcmp(e2
->str
, UNTAGGED
) == 0)
2041 return strncasecmp(e1
->str
, e2
->str
, TAG_MAXLEN
);
2044 static int tempbuf_sort(int fd
)
2046 struct tempbuf_searchidx
*index
= (struct tempbuf_searchidx
*)tempbuf
;
2047 struct tagfile_entry fe
;
2051 /* Generate reverse lookup entries. */
2052 for (i
= 0; i
< lookup_buffer_depth
; i
++)
2054 struct tempbuf_id_list
*idlist
;
2059 if (lookup
[i
]->idlist
.id
== i
)
2062 idlist
= &lookup
[i
]->idlist
;
2063 while (idlist
->next
!= NULL
)
2064 idlist
= idlist
->next
;
2066 tempbuf_left
-= sizeof(struct tempbuf_id_list
);
2067 if (tempbuf_left
- 4 < 0)
2070 idlist
->next
= (struct tempbuf_id_list
*)&tempbuf
[tempbuf_pos
];
2071 if (tempbuf_pos
& 0x03)
2073 tempbuf_pos
= (tempbuf_pos
& ~0x03) + 0x04;
2075 idlist
->next
= (struct tempbuf_id_list
*)&tempbuf
[tempbuf_pos
];
2077 tempbuf_pos
+= sizeof(struct tempbuf_id_list
);
2079 idlist
= idlist
->next
;
2081 idlist
->next
= NULL
;
2086 qsort(index
, tempbufidx
, sizeof(struct tempbuf_searchidx
), compare
);
2087 memset(lookup
, 0, lookup_buffer_depth
* sizeof(struct tempbuf_searchidx
**));
2089 for (i
= 0; i
< tempbufidx
; i
++)
2091 struct tempbuf_id_list
*idlist
= &index
[i
].idlist
;
2093 /* Fix the lookup list. */
2094 while (idlist
!= NULL
)
2096 if (idlist
->id
>= 0)
2097 lookup
[idlist
->id
] = &index
[i
];
2098 idlist
= idlist
->next
;
2101 index
[i
].seek
= lseek(fd
, 0, SEEK_CUR
);
2102 length
= strlen(index
[i
].str
) + 1;
2103 fe
.tag_length
= length
;
2104 fe
.idx_id
= index
[i
].idx_id
;
2106 /* Check the chunk alignment. */
2107 if ((fe
.tag_length
+ sizeof(struct tagfile_entry
))
2108 % TAGFILE_ENTRY_CHUNK_LENGTH
)
2110 fe
.tag_length
+= TAGFILE_ENTRY_CHUNK_LENGTH
-
2111 ((fe
.tag_length
+ sizeof(struct tagfile_entry
))
2112 % TAGFILE_ENTRY_CHUNK_LENGTH
);
2115 #ifdef TAGCACHE_STRICT_ALIGN
2116 /* Make sure the entry is long aligned. */
2117 if (index
[i
].seek
& 0x03)
2119 logf("tempbuf_sort: alignment error!");
2124 if (ecwrite(fd
, &fe
, 1, tagfile_entry_ec
, tc_stat
.econ
) !=
2125 sizeof(struct tagfile_entry
))
2127 logf("tempbuf_sort: write error #1");
2131 if (write(fd
, index
[i
].str
, length
) != length
)
2133 logf("tempbuf_sort: write error #2");
2137 /* Write some padding. */
2138 if (fe
.tag_length
- length
> 0)
2139 write(fd
, "XXXXXXXX", fe
.tag_length
- length
);
2145 inline static struct tempbuf_searchidx
* tempbuf_locate(int id
)
2147 if (id
< 0 || id
>= lookup_buffer_depth
)
2154 inline static int tempbuf_find_location(int id
)
2156 struct tempbuf_searchidx
*entry
;
2158 entry
= tempbuf_locate(id
);
2165 static bool build_numeric_indices(struct tagcache_header
*h
, int tmpfd
)
2167 struct master_header tcmh
;
2168 struct index_entry idx
;
2171 struct temp_file_entry
*entrybuf
= (struct temp_file_entry
*)tempbuf
;
2173 int entries_processed
= 0;
2175 char buf
[TAG_MAXLEN
];
2177 max_entries
= tempbuf_size
/ sizeof(struct temp_file_entry
) - 1;
2179 logf("Building numeric indices...");
2180 lseek(tmpfd
, sizeof(struct tagcache_header
), SEEK_SET
);
2182 if ( (masterfd
= open_master_fd(&tcmh
, true)) < 0)
2185 masterfd_pos
= lseek(masterfd
, tcmh
.tch
.entry_count
* sizeof(struct index_entry
),
2187 if (masterfd_pos
== filesize(masterfd
))
2189 logf("we can't append!");
2194 while (entries_processed
< h
->entry_count
)
2196 int count
= MIN(h
->entry_count
- entries_processed
, max_entries
);
2198 /* Read in as many entries as possible. */
2199 for (i
= 0; i
< count
; i
++)
2201 struct temp_file_entry
*tfe
= &entrybuf
[i
];
2204 /* Read in numeric data. */
2205 if (read(tmpfd
, tfe
, sizeof(struct temp_file_entry
)) !=
2206 sizeof(struct temp_file_entry
))
2208 logf("read fail #1");
2213 datastart
= lseek(tmpfd
, 0, SEEK_CUR
);
2216 * Read string data from the following tags:
2222 * A crc32 hash is calculated from the read data
2223 * and stored back to the data offset field kept in memory.
2225 #define tmpdb_read_string_tag(tag) \
2226 lseek(tmpfd, tfe->tag_offset[tag], SEEK_CUR); \
2227 if ((unsigned long)tfe->tag_length[tag] > sizeof buf) \
2229 logf("read fail: buffer overflow"); \
2234 if (read(tmpfd, buf, tfe->tag_length[tag]) != \
2235 tfe->tag_length[tag]) \
2237 logf("read fail #2"); \
2242 tfe->tag_offset[tag] = crc_32(buf, strlen(buf), 0xffffffff); \
2243 lseek(tmpfd, datastart, SEEK_SET)
2245 tmpdb_read_string_tag(tag_filename
);
2246 tmpdb_read_string_tag(tag_artist
);
2247 tmpdb_read_string_tag(tag_album
);
2248 tmpdb_read_string_tag(tag_title
);
2250 /* Seek to the end of the string data. */
2251 lseek(tmpfd
, tfe
->data_length
, SEEK_CUR
);
2254 /* Backup the master index position. */
2255 masterfd_pos
= lseek(masterfd
, 0, SEEK_CUR
);
2256 lseek(masterfd
, sizeof(struct master_header
), SEEK_SET
);
2258 /* Check if we can resurrect some deleted runtime statistics data. */
2259 for (i
= 0; i
< tcmh
.tch
.entry_count
; i
++)
2261 /* Read the index entry. */
2262 if (ecread_index_entry(masterfd
, &idx
)
2263 != sizeof(struct index_entry
))
2265 logf("read fail #3");
2271 * Skip unless the entry is marked as being deleted
2272 * or the data has already been resurrected.
2274 if (!(idx
.flag
& FLAG_DELETED
) || idx
.flag
& FLAG_RESURRECTED
)
2277 /* Now try to match the entry. */
2279 * To succesfully match a song, the following conditions
2282 * For numeric fields: tag_length
2283 * - Full identical match is required
2285 * If tag_filename matches, no further checking necessary.
2287 * For string hashes: tag_artist, tag_album, tag_title
2288 * - Two of these must match
2290 for (j
= 0; j
< count
; j
++)
2292 struct temp_file_entry
*tfe
= &entrybuf
[j
];
2294 /* Try to match numeric fields first. */
2295 if (tfe
->tag_offset
[tag_length
] != idx
.tag_seek
[tag_length
])
2298 /* Now it's time to do the hash matching. */
2299 if (tfe
->tag_offset
[tag_filename
] != idx
.tag_seek
[tag_filename
])
2301 int match_count
= 0;
2303 /* No filename match, check if we can match two other tags. */
2304 #define tmpdb_match(tag) \
2305 if (tfe->tag_offset[tag] == idx.tag_seek[tag]) \
2308 tmpdb_match(tag_artist
);
2309 tmpdb_match(tag_album
);
2310 tmpdb_match(tag_title
);
2312 if (match_count
< 2)
2314 /* Still no match found, give up. */
2319 /* A match found, now copy & resurrect the statistical data. */
2320 #define tmpdb_copy_tag(tag) \
2321 tfe->tag_offset[tag] = idx.tag_seek[tag]
2323 tmpdb_copy_tag(tag_playcount
);
2324 tmpdb_copy_tag(tag_rating
);
2325 tmpdb_copy_tag(tag_playtime
);
2326 tmpdb_copy_tag(tag_lastplayed
);
2327 tmpdb_copy_tag(tag_commitid
);
2328 tmpdb_copy_tag(tag_lastoffset
);
2330 /* Avoid processing this entry again. */
2331 idx
.flag
|= FLAG_RESURRECTED
;
2333 lseek(masterfd
, -sizeof(struct index_entry
), SEEK_CUR
);
2334 if (ecwrite_index_entry(masterfd
, &idx
) != sizeof(struct index_entry
))
2336 logf("masterfd writeback fail #1");
2341 logf("Entry resurrected");
2346 /* Restore the master index position. */
2347 lseek(masterfd
, masterfd_pos
, SEEK_SET
);
2349 /* Commit the data to the index. */
2350 for (i
= 0; i
< count
; i
++)
2352 int loc
= lseek(masterfd
, 0, SEEK_CUR
);
2354 if (ecread_index_entry(masterfd
, &idx
) != sizeof(struct index_entry
))
2356 logf("read fail #3");
2361 for (j
= 0; j
< TAG_COUNT
; j
++)
2363 if (!TAGCACHE_IS_NUMERIC(j
))
2366 idx
.tag_seek
[j
] = entrybuf
[i
].tag_offset
[j
];
2368 idx
.flag
= entrybuf
[i
].flag
;
2370 if (idx
.tag_seek
[tag_commitid
])
2372 /* Data has been resurrected. */
2373 idx
.flag
|= FLAG_DIRTYNUM
;
2375 else if (tc_stat
.ready
&& current_tcmh
.commitid
> 0)
2377 idx
.tag_seek
[tag_commitid
] = current_tcmh
.commitid
;
2378 idx
.flag
|= FLAG_DIRTYNUM
;
2381 /* Write back the updated index. */
2382 lseek(masterfd
, loc
, SEEK_SET
);
2383 if (ecwrite_index_entry(masterfd
, &idx
) != sizeof(struct index_entry
))
2391 entries_processed
+= count
;
2392 logf("%d/%ld entries processed", entries_processed
, h
->entry_count
);
2403 * == 0 temporary failure
2406 static int build_index(int index_type
, struct tagcache_header
*h
, int tmpfd
)
2409 struct tagcache_header tch
;
2410 struct master_header tcmh
;
2411 struct index_entry idxbuf
[IDX_BUF_DEPTH
];
2413 char buf
[TAG_MAXLEN
+32];
2414 int fd
= -1, masterfd
;
2419 logf("Building index: %d", index_type
);
2421 /* Check the number of entries we need to allocate ram for. */
2422 commit_entry_count
= h
->entry_count
+ 1;
2424 masterfd
= open_master_fd(&tcmh
, false);
2427 commit_entry_count
+= tcmh
.tch
.entry_count
;
2431 remove_files(); /* Just to be sure we are clean. */
2433 /* Open the index file, which contains the tag names. */
2434 fd
= open_tag_fd(&tch
, index_type
, true);
2437 logf("tch.datasize=%ld", tch
.datasize
);
2438 lookup_buffer_depth
= 1 +
2439 /* First part */ commit_entry_count
+
2440 /* Second part */ (tch
.datasize
/ TAGFILE_ENTRY_CHUNK_LENGTH
);
2444 lookup_buffer_depth
= 1 +
2445 /* First part */ commit_entry_count
+
2446 /* Second part */ 0;
2449 logf("lookup_buffer_depth=%ld", lookup_buffer_depth
);
2450 logf("commit_entry_count=%ld", commit_entry_count
);
2452 /* Allocate buffer for all index entries from both old and new
2455 tempbuf_pos
= commit_entry_count
* sizeof(struct tempbuf_searchidx
);
2457 /* Allocate lookup buffer. The first portion of commit_entry_count
2458 * contains the new tags in the temporary file and the second
2459 * part for locating entries already in the db.
2462 * +---------+---------------------------+
2463 * | index | position/ENTRY_CHUNK_SIZE | lookup buffer
2464 * +---------+---------------------------+
2466 * Old tags are inserted to a temporary buffer with position:
2467 * tempbuf_insert(position/ENTRY_CHUNK_SIZE, ...);
2468 * And new tags with index:
2469 * tempbuf_insert(idx, ...);
2471 * The buffer is sorted and written into tag file:
2472 * tempbuf_sort(...);
2473 * leaving master index locations messed up.
2475 * That is fixed using the lookup buffer for old tags:
2476 * new_seek = tempbuf_find_location(old_seek, ...);
2478 * new_seek = tempbuf_find_location(idx);
2480 lookup
= (struct tempbuf_searchidx
**)&tempbuf
[tempbuf_pos
];
2481 tempbuf_pos
+= lookup_buffer_depth
* sizeof(void **);
2482 memset(lookup
, 0, lookup_buffer_depth
* sizeof(void **));
2484 /* And calculate the remaining data space used mainly for storing
2485 * tag data (strings). */
2486 tempbuf_left
= tempbuf_size
- tempbuf_pos
- 8;
2487 if (tempbuf_left
- TAGFILE_ENTRY_AVG_LENGTH
* commit_entry_count
< 0)
2489 logf("Buffer way too small!");
2496 * If tag file contains unique tags (sorted index), we will load
2497 * it entirely into memory so we can resort it later for use with
2500 if (TAGCACHE_IS_SORTED(index_type
))
2502 logf("loading tags...");
2503 for (i
= 0; i
< tch
.entry_count
; i
++)
2505 struct tagfile_entry entry
;
2506 int loc
= lseek(fd
, 0, SEEK_CUR
);
2509 if (ecread_tagfile_entry(fd
, &entry
) != sizeof(struct tagfile_entry
))
2511 logf("read error #7");
2516 if (entry
.tag_length
>= (int)sizeof(buf
))
2518 logf("too long tag #3");
2523 if (read(fd
, buf
, entry
.tag_length
) != entry
.tag_length
)
2525 logf("read error #8");
2530 /* Skip deleted entries. */
2535 * Save the tag and tag id in the memory buffer. Tag id
2536 * is saved so we can later reindex the master lookup
2537 * table when the index gets resorted.
2539 ret
= tempbuf_insert(buf
, loc
/TAGFILE_ENTRY_CHUNK_LENGTH
2540 + commit_entry_count
, entry
.idx_id
,
2541 TAGCACHE_IS_UNIQUE(index_type
));
2552 tempbufidx
= tch
.entry_count
;
2557 * Creating new index file to store the tags. No need to preload
2558 * anything whether the index type is sorted or not.
2560 snprintf(buf
, sizeof buf
, TAGCACHE_FILE_INDEX
, index_type
);
2561 fd
= open(buf
, O_WRONLY
| O_CREAT
| O_TRUNC
, 0666);
2564 logf("%s open fail", buf
);
2568 tch
.magic
= TAGCACHE_MAGIC
;
2569 tch
.entry_count
= 0;
2572 if (ecwrite(fd
, &tch
, 1, tagcache_header_ec
, tc_stat
.econ
)
2573 != sizeof(struct tagcache_header
))
2575 logf("header write failed");
2581 /* Loading the tag lookup file as "master file". */
2582 logf("Loading index file");
2583 masterfd
= open(TAGCACHE_FILE_MASTER
, O_RDWR
);
2587 logf("Creating new DB");
2588 masterfd
= open(TAGCACHE_FILE_MASTER
, O_WRONLY
| O_CREAT
| O_TRUNC
, 0666);
2592 logf("Failure to create index file (%s)", TAGCACHE_FILE_MASTER
);
2597 /* Write the header (write real values later). */
2598 memset(&tcmh
, 0, sizeof(struct master_header
));
2600 tcmh
.tch
.entry_count
= 0;
2601 tcmh
.tch
.datasize
= 0;
2603 ecwrite(masterfd
, &tcmh
, 1, master_header_ec
, tc_stat
.econ
);
2605 masterfd_pos
= lseek(masterfd
, 0, SEEK_CUR
);
2610 * Master file already exists so we need to process the current
2615 if (ecread(masterfd
, &tcmh
, 1, master_header_ec
, tc_stat
.econ
) !=
2616 sizeof(struct master_header
) || tcmh
.tch
.magic
!= TAGCACHE_MAGIC
)
2618 logf("header error");
2625 * If we reach end of the master file, we need to expand it to
2626 * hold new tags. If the current index is not sorted, we can
2627 * simply append new data to end of the file.
2628 * However, if the index is sorted, we need to update all tag
2629 * pointers in the master file for the current index.
2631 masterfd_pos
= lseek(masterfd
, tcmh
.tch
.entry_count
* sizeof(struct index_entry
),
2633 if (masterfd_pos
== filesize(masterfd
))
2635 logf("appending...");
2641 * Load new unique tags in memory to be sorted later and added
2642 * to the master lookup file.
2644 if (TAGCACHE_IS_SORTED(index_type
))
2646 lseek(tmpfd
, sizeof(struct tagcache_header
), SEEK_SET
);
2647 /* h is the header of the temporary file containing new tags. */
2648 logf("inserting new tags...");
2649 for (i
= 0; i
< h
->entry_count
; i
++)
2651 struct temp_file_entry entry
;
2653 if (read(tmpfd
, &entry
, sizeof(struct temp_file_entry
)) !=
2654 sizeof(struct temp_file_entry
))
2656 logf("read fail #3");
2662 if (entry
.tag_length
[index_type
] >= (long)sizeof(buf
))
2664 logf("too long entry!");
2669 lseek(tmpfd
, entry
.tag_offset
[index_type
], SEEK_CUR
);
2670 if (read(tmpfd
, buf
, entry
.tag_length
[index_type
]) !=
2671 entry
.tag_length
[index_type
])
2673 logf("read fail #4");
2678 if (TAGCACHE_IS_UNIQUE(index_type
))
2679 error
= !tempbuf_insert(buf
, i
, -1, true);
2681 error
= !tempbuf_insert(buf
, i
, tcmh
.tch
.entry_count
+ i
, false);
2685 logf("insert error");
2690 lseek(tmpfd
, entry
.data_length
- entry
.tag_offset
[index_type
] -
2691 entry
.tag_length
[index_type
], SEEK_CUR
);
2696 /* Sort the buffer data and write it to the index file. */
2697 lseek(fd
, sizeof(struct tagcache_header
), SEEK_SET
);
2699 * We need to truncate the index file now. There can be junk left
2700 * at the end of file (however, we _should_ always follow the
2701 * entry_count and don't crash with that).
2703 ftruncate(fd
, lseek(fd
, 0, SEEK_CUR
));
2705 i
= tempbuf_sort(fd
);
2708 logf("sorted %d tags", i
);
2711 * Now update all indexes in the master lookup file.
2713 logf("updating indices...");
2714 lseek(masterfd
, sizeof(struct master_header
), SEEK_SET
);
2715 for (i
= 0; i
< tcmh
.tch
.entry_count
; i
+= idxbuf_pos
)
2718 int loc
= lseek(masterfd
, 0, SEEK_CUR
);
2720 idxbuf_pos
= MIN(tcmh
.tch
.entry_count
- i
, IDX_BUF_DEPTH
);
2722 if (ecread(masterfd
, idxbuf
, idxbuf_pos
, index_entry_ec
, tc_stat
.econ
)
2723 != (int)sizeof(struct index_entry
)*idxbuf_pos
)
2725 logf("read fail #5");
2729 lseek(masterfd
, loc
, SEEK_SET
);
2731 for (j
= 0; j
< idxbuf_pos
; j
++)
2733 if (idxbuf
[j
].flag
& FLAG_DELETED
)
2735 /* We can just ignore deleted entries. */
2736 // idxbuf[j].tag_seek[index_type] = 0;
2740 idxbuf
[j
].tag_seek
[index_type
] = tempbuf_find_location(
2741 idxbuf
[j
].tag_seek
[index_type
]/TAGFILE_ENTRY_CHUNK_LENGTH
2742 + commit_entry_count
);
2744 if (idxbuf
[j
].tag_seek
[index_type
] < 0)
2746 logf("update error: %ld/%d/%ld",
2747 idxbuf
[j
].flag
, i
+j
, tcmh
.tch
.entry_count
);
2755 /* Write back the updated index. */
2756 if (ecwrite(masterfd
, idxbuf
, idxbuf_pos
,
2757 index_entry_ec
, tc_stat
.econ
) !=
2758 (int)sizeof(struct index_entry
)*idxbuf_pos
)
2769 * Walk through the temporary file containing the new tags.
2771 // build_normal_index(h, tmpfd, masterfd, idx);
2772 logf("updating new indices...");
2773 lseek(masterfd
, masterfd_pos
, SEEK_SET
);
2774 lseek(tmpfd
, sizeof(struct tagcache_header
), SEEK_SET
);
2775 lseek(fd
, 0, SEEK_END
);
2776 for (i
= 0; i
< h
->entry_count
; i
+= idxbuf_pos
)
2780 idxbuf_pos
= MIN(h
->entry_count
- i
, IDX_BUF_DEPTH
);
2783 memset(idxbuf
, 0, sizeof(struct index_entry
)*IDX_BUF_DEPTH
);
2787 int loc
= lseek(masterfd
, 0, SEEK_CUR
);
2789 if (ecread(masterfd
, idxbuf
, idxbuf_pos
, index_entry_ec
, tc_stat
.econ
)
2790 != (int)sizeof(struct index_entry
)*idxbuf_pos
)
2792 logf("read fail #6");
2796 lseek(masterfd
, loc
, SEEK_SET
);
2799 /* Read entry headers. */
2800 for (j
= 0; j
< idxbuf_pos
; j
++)
2802 if (!TAGCACHE_IS_SORTED(index_type
))
2804 struct temp_file_entry entry
;
2805 struct tagfile_entry fe
;
2807 if (read(tmpfd
, &entry
, sizeof(struct temp_file_entry
)) !=
2808 sizeof(struct temp_file_entry
))
2810 logf("read fail #7");
2816 if (entry
.tag_length
[index_type
] >= (int)sizeof(buf
))
2818 logf("too long entry!");
2819 logf("length=%d", entry
.tag_length
[index_type
]);
2820 logf("pos=0x%02lx", lseek(tmpfd
, 0, SEEK_CUR
));
2825 lseek(tmpfd
, entry
.tag_offset
[index_type
], SEEK_CUR
);
2826 if (read(tmpfd
, buf
, entry
.tag_length
[index_type
]) !=
2827 entry
.tag_length
[index_type
])
2829 logf("read fail #8");
2830 logf("offset=0x%02lx", entry
.tag_offset
[index_type
]);
2831 logf("length=0x%02x", entry
.tag_length
[index_type
]);
2836 /* Write to index file. */
2837 idxbuf
[j
].tag_seek
[index_type
] = lseek(fd
, 0, SEEK_CUR
);
2838 fe
.tag_length
= entry
.tag_length
[index_type
];
2839 fe
.idx_id
= tcmh
.tch
.entry_count
+ i
+ j
;
2840 ecwrite(fd
, &fe
, 1, tagfile_entry_ec
, tc_stat
.econ
);
2841 write(fd
, buf
, fe
.tag_length
);
2845 lseek(tmpfd
, entry
.data_length
- entry
.tag_offset
[index_type
] -
2846 entry
.tag_length
[index_type
], SEEK_CUR
);
2850 /* Locate the correct entry from the sorted array. */
2851 idxbuf
[j
].tag_seek
[index_type
] = tempbuf_find_location(i
+ j
);
2852 if (idxbuf
[j
].tag_seek
[index_type
] < 0)
2854 logf("entry not found (%d)", j
);
2862 if (ecwrite(masterfd
, idxbuf
, idxbuf_pos
,
2863 index_entry_ec
, tc_stat
.econ
) !=
2864 (int)sizeof(struct index_entry
)*idxbuf_pos
)
2866 logf("tagcache: write fail #4");
2875 /* Finally write the header. */
2876 tch
.magic
= TAGCACHE_MAGIC
;
2877 tch
.entry_count
= tempbufidx
;
2878 tch
.datasize
= lseek(fd
, 0, SEEK_END
) - sizeof(struct tagcache_header
);
2879 lseek(fd
, 0, SEEK_SET
);
2880 ecwrite(fd
, &tch
, 1, tagcache_header_ec
, tc_stat
.econ
);
2882 if (index_type
!= tag_filename
)
2883 h
->datasize
+= tch
.datasize
;
2884 logf("s:%d/%ld/%ld", index_type
, tch
.datasize
, h
->datasize
);
2896 static bool commit(void)
2898 struct tagcache_header tch
;
2899 struct master_header tcmh
;
2903 #ifdef HAVE_DIRCACHE
2904 bool dircache_buffer_stolen
= false;
2906 bool local_allocation
= false;
2908 logf("committing tagcache");
2913 tmpfd
= open(TAGCACHE_FILE_TEMP
, O_RDONLY
);
2916 logf("nothing to commit");
2921 /* Load the header. */
2922 len
= sizeof(struct tagcache_header
);
2923 rc
= read(tmpfd
, &tch
, len
);
2925 if (tch
.magic
!= TAGCACHE_MAGIC
|| rc
!= len
)
2927 logf("incorrect tmpheader");
2929 remove(TAGCACHE_FILE_TEMP
);
2933 if (tch
.entry_count
== 0)
2935 logf("nothing to commit");
2937 remove(TAGCACHE_FILE_TEMP
);
2941 /* Fully initialize existing headers (if any) before going further. */
2942 tc_stat
.ready
= check_all_headers();
2944 #ifdef HAVE_EEPROM_SETTINGS
2945 remove(TAGCACHE_STATEFILE
);
2948 /* At first be sure to unload the ramcache! */
2949 #ifdef HAVE_TC_RAMCACHE
2950 tc_stat
.ramcache
= false;
2955 /* Try to steal every buffer we can :) */
2956 if (tempbuf_size
== 0)
2957 local_allocation
= true;
2959 #ifdef HAVE_DIRCACHE
2960 if (tempbuf_size
== 0)
2962 /* Try to steal the dircache buffer. */
2963 tempbuf
= dircache_steal_buffer(&tempbuf_size
);
2964 tempbuf_size
&= ~0x03;
2966 if (tempbuf_size
> 0)
2968 dircache_buffer_stolen
= true;
2973 #ifdef HAVE_TC_RAMCACHE
2974 if (tempbuf_size
== 0 && tc_stat
.ramcache_allocated
> 0)
2976 tempbuf
= (char *)(hdr
+ 1);
2977 tempbuf_size
= tc_stat
.ramcache_allocated
- sizeof(struct ramcache_header
) - 128;
2978 tempbuf_size
&= ~0x03;
2982 /* And finally fail if there are no buffers available. */
2983 if (tempbuf_size
== 0)
2985 logf("delaying commit until next boot");
2986 tc_stat
.commit_delayed
= true;
2992 logf("commit %ld entries...", tch
.entry_count
);
2994 /* Mark DB dirty so it will stay disabled if commit fails. */
2995 current_tcmh
.dirty
= true;
2996 update_master_header();
2998 /* Now create the index files. */
2999 tc_stat
.commit_step
= 0;
3001 tc_stat
.commit_delayed
= false;
3003 for (i
= 0; i
< TAG_COUNT
; i
++)
3007 if (TAGCACHE_IS_NUMERIC(i
))
3010 tc_stat
.commit_step
++;
3011 ret
= build_index(i
, &tch
, tmpfd
);
3015 logf("tagcache failed init");
3017 tc_stat
.commit_delayed
= true;
3019 tc_stat
.commit_step
= 0;
3025 if (!build_numeric_indices(&tch
, tmpfd
))
3027 logf("Failure to commit numeric indices");
3029 tc_stat
.commit_step
= 0;
3035 remove(TAGCACHE_FILE_TEMP
);
3037 tc_stat
.commit_step
= 0;
3039 /* Update the master index headers. */
3040 if ( (masterfd
= open_master_fd(&tcmh
, true)) < 0)
3046 tcmh
.tch
.entry_count
+= tch
.entry_count
;
3047 tcmh
.tch
.datasize
= sizeof(struct master_header
)
3048 + sizeof(struct index_entry
) * tcmh
.tch
.entry_count
3053 lseek(masterfd
, 0, SEEK_SET
);
3054 ecwrite(masterfd
, &tcmh
, 1, master_header_ec
, tc_stat
.econ
);
3057 logf("tagcache committed");
3058 tc_stat
.ready
= check_all_headers();
3059 tc_stat
.readyvalid
= true;
3061 if (local_allocation
)
3067 #ifdef HAVE_DIRCACHE
3068 /* Rebuild the dircache, if we stole the buffer. */
3069 if (dircache_buffer_stolen
)
3073 #ifdef HAVE_TC_RAMCACHE
3074 /* Reload tagcache. */
3075 if (tc_stat
.ramcache_allocated
> 0)
3076 tagcache_start_scan();
3084 static void allocate_tempbuf(void)
3086 /* Yeah, malloc would be really nice now :) */
3088 tempbuf_size
= 32*1024*1024;
3089 tempbuf
= malloc(tempbuf_size
);
3091 tempbuf
= (char *)(((long)audiobuf
& ~0x03) + 0x04);
3092 tempbuf_size
= (long)audiobufend
- (long)audiobuf
- 4;
3093 audiobuf
+= tempbuf_size
;
3097 static void free_tempbuf(void)
3099 if (tempbuf_size
== 0)
3105 audiobuf
-= tempbuf_size
;
3113 static bool modify_numeric_entry(int masterfd
, int idx_id
, int tag
, long data
)
3115 struct index_entry idx
;
3120 if (!TAGCACHE_IS_NUMERIC(tag
))
3123 if (!get_index(masterfd
, idx_id
, &idx
, false))
3126 idx
.tag_seek
[tag
] = data
;
3127 idx
.flag
|= FLAG_DIRTYNUM
;
3129 return write_index(masterfd
, idx_id
, &idx
);
3133 bool tagcache_modify_numeric_entry(struct tagcache_search
*tcs
,
3136 struct master_header myhdr
;
3138 if (tcs
->masterfd
< 0)
3140 if ( (tcs
->masterfd
= open_master_fd(&myhdr
, true)) < 0)
3144 return modify_numeric_entry(tcs
->masterfd
, tcs
->idx_id
, tag
, data
);
3148 static bool command_queue_is_full(void)
3152 next
= command_queue_widx
+ 1;
3153 if (next
>= TAGCACHE_COMMAND_QUEUE_LENGTH
)
3156 return (next
== command_queue_ridx
);
3159 static void command_queue_sync_callback(void *data
)
3162 struct master_header myhdr
;
3165 mutex_lock(&command_queue_mutex
);
3167 if ( (masterfd
= open_master_fd(&myhdr
, true)) < 0)
3170 while (command_queue_ridx
!= command_queue_widx
)
3172 struct tagcache_command_entry
*ce
= &command_queue
[command_queue_ridx
];
3174 switch (ce
->command
)
3176 case CMD_UPDATE_MASTER_HEADER
:
3179 update_master_header();
3181 /* Re-open the masterfd. */
3182 if ( (masterfd
= open_master_fd(&myhdr
, true)) < 0)
3187 case CMD_UPDATE_NUMERIC
:
3189 modify_numeric_entry(masterfd
, ce
->idx_id
, ce
->tag
, ce
->data
);
3194 if (++command_queue_ridx
>= TAGCACHE_COMMAND_QUEUE_LENGTH
)
3195 command_queue_ridx
= 0;
3200 tc_stat
.queue_length
= 0;
3201 mutex_unlock(&command_queue_mutex
);
3204 static void run_command_queue(bool force
)
3206 if (COMMAND_QUEUE_IS_EMPTY
)
3209 if (force
|| command_queue_is_full())
3210 command_queue_sync_callback(NULL
);
3212 register_storage_idle_func(command_queue_sync_callback
);
3215 static void queue_command(int cmd
, long idx_id
, int tag
, long data
)
3221 mutex_lock(&command_queue_mutex
);
3222 next
= command_queue_widx
+ 1;
3223 if (next
>= TAGCACHE_COMMAND_QUEUE_LENGTH
)
3226 /* Make sure queue is not full. */
3227 if (next
!= command_queue_ridx
)
3229 struct tagcache_command_entry
*ce
= &command_queue
[command_queue_widx
];
3232 ce
->idx_id
= idx_id
;
3236 command_queue_widx
= next
;
3238 tc_stat
.queue_length
++;
3240 mutex_unlock(&command_queue_mutex
);
3244 /* Queue is full, try again later... */
3245 mutex_unlock(&command_queue_mutex
);
3250 long tagcache_increase_serial(void)
3260 old
= current_tcmh
.serial
++;
3261 queue_command(CMD_UPDATE_MASTER_HEADER
, 0, 0, 0);
3266 void tagcache_update_numeric(int idx_id
, int tag
, long data
)
3268 queue_command(CMD_UPDATE_NUMERIC
, idx_id
, tag
, data
);
3270 #endif /* !__PCTOOL__ */
3272 long tagcache_get_serial(void)
3274 return current_tcmh
.serial
;
3277 long tagcache_get_commitid(void)
3279 return current_tcmh
.commitid
;
3282 static bool write_tag(int fd
, const char *tagstr
, const char *datastr
)
3287 snprintf(buf
, sizeof buf
, "%s=\"", tagstr
);
3288 for (i
= strlen(buf
); i
< (long)sizeof(buf
)-4; i
++)
3290 if (*datastr
== '\0')
3293 if (*datastr
== '"' || *datastr
== '\\')
3296 buf
[i
] = *(datastr
++);
3299 strcpy(&buf
[i
], "\" ");
3301 write(fd
, buf
, i
+ 2);
3308 static bool read_tag(char *dest
, long size
,
3309 const char *src
, const char *tagstr
)
3312 char current_tag
[32];
3314 while (*src
!= '\0')
3316 /* Skip all whitespace */
3324 /* Read in tag name */
3325 while (*src
!= '=' && *src
!= ' ')
3327 current_tag
[pos
] = *src
;
3331 if (*src
== '\0' || pos
>= (long)sizeof(current_tag
))
3334 current_tag
[pos
] = '\0';
3336 /* Read in tag data */
3338 /* Find the start. */
3339 while (*src
!= '"' && *src
!= '\0')
3342 if (*src
== '\0' || *(++src
) == '\0')
3345 /* Read the data. */
3346 for (pos
= 0; pos
< size
; pos
++)
3353 dest
[pos
] = *(src
+1);
3373 if (!strcasecmp(tagstr
, current_tag
))
3380 static int parse_changelog_line(int line_n
, const char *buf
, void *parameters
)
3382 struct index_entry idx
;
3383 char tag_data
[TAG_MAXLEN
+32];
3385 long masterfd
= (long)parameters
;
3386 const int import_tags
[] = { tag_playcount
, tag_rating
, tag_playtime
, tag_lastplayed
,
3394 logf("%d/%s", line_n
, buf
);
3395 if (!read_tag(tag_data
, sizeof tag_data
, buf
, "filename"))
3397 logf("filename missing");
3402 idx_id
= find_index(tag_data
);
3405 logf("entry not found");
3409 if (!get_index(masterfd
, idx_id
, &idx
, false))
3411 logf("failed to retrieve index entry");
3415 /* Stop if tag has already been modified. */
3416 if (idx
.flag
& FLAG_DIRTYNUM
)
3419 logf("import: %s", tag_data
);
3421 idx
.flag
|= FLAG_DIRTYNUM
;
3422 for (i
= 0; i
< (long)(sizeof(import_tags
)/sizeof(import_tags
[0])); i
++)
3426 if (!read_tag(tag_data
, sizeof tag_data
, buf
,
3427 tagcache_tag_to_str(import_tags
[i
])))
3432 data
= atoi(tag_data
);
3436 idx
.tag_seek
[import_tags
[i
]] = data
;
3438 if (import_tags
[i
] == tag_lastplayed
&& data
>= current_tcmh
.serial
)
3439 current_tcmh
.serial
= data
+ 1;
3440 else if (import_tags
[i
] == tag_commitid
&& data
>= current_tcmh
.commitid
)
3441 current_tcmh
.commitid
= data
+ 1;
3444 return write_index(masterfd
, idx_id
, &idx
) ? 0 : -5;
3447 bool tagcache_import_changelog(void)
3449 struct master_header myhdr
;
3450 struct tagcache_header tch
;
3461 clfd
= open(TAGCACHE_FILE_CHANGELOG
, O_RDONLY
);
3464 logf("failure to open changelog");
3468 if ( (masterfd
= open_master_fd(&myhdr
, true)) < 0)
3476 filenametag_fd
= open_tag_fd(&tch
, tag_filename
, false);
3478 fast_readline(clfd
, buf
, sizeof buf
, (long *)masterfd
,
3479 parse_changelog_line
);
3484 if (filenametag_fd
>= 0)
3486 close(filenametag_fd
);
3487 filenametag_fd
= -1;
3492 update_master_header();
3497 #endif /* !__PCTOOL__ */
3499 bool tagcache_create_changelog(struct tagcache_search
*tcs
)
3501 struct master_header myhdr
;
3502 struct index_entry idx
;
3503 char buf
[TAG_MAXLEN
+32];
3511 if (!tagcache_search(tcs
, tag_filename
))
3514 /* Initialize the changelog */
3515 clfd
= open(TAGCACHE_FILE_CHANGELOG
, O_WRONLY
| O_CREAT
| O_TRUNC
, 0666);
3518 logf("failure to open changelog");
3522 if (tcs
->masterfd
< 0)
3524 if ( (tcs
->masterfd
= open_master_fd(&myhdr
, false)) < 0)
3529 lseek(tcs
->masterfd
, 0, SEEK_SET
);
3530 ecread(tcs
->masterfd
, &myhdr
, 1, master_header_ec
, tc_stat
.econ
);
3533 write(clfd
, "## Changelog version 1\n", 23);
3535 for (i
= 0; i
< myhdr
.tch
.entry_count
; i
++)
3537 if (ecread_index_entry(tcs
->masterfd
, &idx
) != sizeof(struct index_entry
))
3539 logf("read error #9");
3540 tagcache_search_finish(tcs
);
3545 /* Skip until the entry found has been modified. */
3546 if (! (idx
.flag
& FLAG_DIRTYNUM
) )
3549 /* Skip deleted entries too. */
3550 if (idx
.flag
& FLAG_DELETED
)
3553 /* Now retrieve all tags. */
3554 for (j
= 0; j
< TAG_COUNT
; j
++)
3556 if (TAGCACHE_IS_NUMERIC(j
))
3558 snprintf(temp
, sizeof temp
, "%d", (int)idx
.tag_seek
[j
]);
3559 write_tag(clfd
, tagcache_tag_to_str(j
), temp
);
3564 tagcache_retrieve(tcs
, i
, tcs
->type
, buf
, sizeof buf
);
3565 write_tag(clfd
, tagcache_tag_to_str(j
), buf
);
3568 write(clfd
, "\n", 1);
3574 tagcache_search_finish(tcs
);
3579 static bool delete_entry(long idx_id
)
3584 struct index_entry idx
, myidx
;
3585 struct master_header myhdr
;
3586 char buf
[TAG_MAXLEN
+32];
3587 int in_use
[TAG_COUNT
];
3589 logf("delete_entry(): %ld", idx_id
);
3591 #ifdef HAVE_TC_RAMCACHE
3592 /* At first mark the entry removed from ram cache. */
3593 if (tc_stat
.ramcache
)
3594 hdr
->indices
[idx_id
].flag
|= FLAG_DELETED
;
3597 if ( (masterfd
= open_master_fd(&myhdr
, true) ) < 0)
3600 lseek(masterfd
, idx_id
* sizeof(struct index_entry
), SEEK_CUR
);
3601 if (ecread_index_entry(masterfd
, &myidx
) != sizeof(struct index_entry
))
3603 logf("delete_entry(): read error");
3607 if (myidx
.flag
& FLAG_DELETED
)
3609 logf("delete_entry(): already deleted!");
3613 myidx
.flag
|= FLAG_DELETED
;
3614 lseek(masterfd
, -sizeof(struct index_entry
), SEEK_CUR
);
3615 if (ecwrite_index_entry(masterfd
, &myidx
) != sizeof(struct index_entry
))
3617 logf("delete_entry(): write_error #1");
3621 /* Now check which tags are no longer in use (if any) */
3622 for (tag
= 0; tag
< TAG_COUNT
; tag
++)
3625 lseek(masterfd
, sizeof(struct master_header
), SEEK_SET
);
3626 for (i
= 0; i
< myhdr
.tch
.entry_count
; i
++)
3628 struct index_entry
*idxp
;
3630 #ifdef HAVE_TC_RAMCACHE
3631 /* Use RAM DB if available for greater speed */
3632 if (tc_stat
.ramcache
)
3633 idxp
= &hdr
->indices
[i
];
3637 if (ecread_index_entry(masterfd
, &idx
) != sizeof(struct index_entry
))
3639 logf("delete_entry(): read error #2");
3645 if (idxp
->flag
& FLAG_DELETED
)
3648 for (tag
= 0; tag
< TAG_COUNT
; tag
++)
3650 if (TAGCACHE_IS_NUMERIC(tag
))
3653 if (idxp
->tag_seek
[tag
] == myidx
.tag_seek
[tag
])
3658 /* Now delete all tags no longer in use. */
3659 for (tag
= 0; tag
< TAG_COUNT
; tag
++)
3661 struct tagcache_header tch
;
3662 int oldseek
= myidx
.tag_seek
[tag
];
3664 if (TAGCACHE_IS_NUMERIC(tag
))
3668 * Replace tag seek with a hash value of the field string data.
3669 * That way runtime statistics of moved or altered files can be
3672 #ifdef HAVE_TC_RAMCACHE
3673 if (tc_stat
.ramcache
&& tag
!= tag_filename
)
3675 struct tagfile_entry
*tfe
;
3676 int32_t *seek
= &hdr
->indices
[idx_id
].tag_seek
[tag
];
3678 tfe
= (struct tagfile_entry
*)&hdr
->tags
[tag
][*seek
];
3679 *seek
= crc_32(tfe
->tag_data
, strlen(tfe
->tag_data
), 0xffffffff);
3680 myidx
.tag_seek
[tag
] = *seek
;
3685 struct tagfile_entry tfe
;
3687 /* Open the index file, which contains the tag names. */
3688 if ((fd
= open_tag_fd(&tch
, tag
, true)) < 0)
3691 /* Skip the header block */
3692 lseek(fd
, myidx
.tag_seek
[tag
], SEEK_SET
);
3693 if (ecread_tagfile_entry(fd
, &tfe
) != sizeof(struct tagfile_entry
))
3695 logf("delete_entry(): read error #3");
3699 if (read(fd
, buf
, tfe
.tag_length
) != tfe
.tag_length
)
3701 logf("delete_entry(): read error #4");
3705 myidx
.tag_seek
[tag
] = crc_32(buf
, strlen(buf
), 0xffffffff);
3710 logf("in use: %d/%d", tag
, in_use
[tag
]);
3719 #ifdef HAVE_TC_RAMCACHE
3720 /* Delete from ram. */
3721 if (tc_stat
.ramcache
&& tag
!= tag_filename
)
3723 struct tagfile_entry
*tagentry
= (struct tagfile_entry
*)&hdr
->tags
[tag
][oldseek
];
3724 tagentry
->tag_data
[0] = '\0';
3728 /* Open the index file, which contains the tag names. */
3731 if ((fd
= open_tag_fd(&tch
, tag
, true)) < 0)
3735 /* Skip the header block */
3736 lseek(fd
, oldseek
+ sizeof(struct tagfile_entry
), SEEK_SET
);
3738 /* Debug, print 10 first characters of the tag
3741 logf("TAG:%s", buf);
3742 lseek(fd, -10, SEEK_CUR);
3745 /* Write first data byte in tag as \0 */
3748 /* Now tag data has been removed */
3753 /* Write index entry back into master index. */
3754 lseek(masterfd
, sizeof(struct master_header
) +
3755 (idx_id
* sizeof(struct index_entry
)), SEEK_SET
);
3756 if (ecwrite_index_entry(masterfd
, &myidx
) != sizeof(struct index_entry
))
3758 logf("delete_entry(): write_error #2");
3777 * Returns true if there is an event waiting in the queue
3778 * that requires the current operation to be aborted.
3780 static bool check_event_queue(void)
3782 struct queue_event ev
;
3784 if(!queue_peek(&tagcache_queue
, &ev
))
3791 case SYS_USB_CONNECTED
:
3799 #ifdef HAVE_TC_RAMCACHE
3800 static bool allocate_tagcache(void)
3802 struct master_header tcmh
;
3805 /* Load the header. */
3806 if ( (fd
= open_master_fd(&tcmh
, false)) < 0)
3815 * Now calculate the required cache size plus
3816 * some extra space for alignment fixes.
3818 tc_stat
.ramcache_allocated
= tcmh
.tch
.datasize
+ 128 + TAGCACHE_RESERVE
+
3819 sizeof(struct ramcache_header
) + TAG_COUNT
*sizeof(void *);
3820 hdr
= buffer_alloc(tc_stat
.ramcache_allocated
+ 128);
3821 memset(hdr
, 0, sizeof(struct ramcache_header
));
3822 memcpy(&hdr
->h
, &tcmh
, sizeof(struct master_header
));
3823 hdr
->indices
= (struct index_entry
*)(hdr
+ 1);
3824 logf("tagcache: %d bytes allocated.", tc_stat
.ramcache_allocated
);
3829 # ifdef HAVE_EEPROM_SETTINGS
3830 static bool tagcache_dumpload(void)
3832 struct statefile_header shdr
;
3837 fd
= open(TAGCACHE_STATEFILE
, O_RDONLY
);
3840 logf("no tagcache statedump");
3844 /* Check the statefile memory placement */
3845 hdr
= buffer_alloc(0);
3846 rc
= read(fd
, &shdr
, sizeof(struct statefile_header
));
3847 if (rc
!= sizeof(struct statefile_header
)
3848 /* || (long)hdr != (long)shdr.hdr */)
3850 logf("incorrect statefile");
3856 offpos
= (long)hdr
- (long)shdr
.hdr
;
3858 /* Lets allocate real memory and load it */
3859 hdr
= buffer_alloc(shdr
.tc_stat
.ramcache_allocated
);
3860 rc
= read(fd
, hdr
, shdr
.tc_stat
.ramcache_allocated
);
3863 if (rc
!= shdr
.tc_stat
.ramcache_allocated
)
3865 logf("read failure!");
3870 memcpy(&tc_stat
, &shdr
.tc_stat
, sizeof(struct tagcache_stat
));
3872 /* Now fix the pointers */
3873 hdr
->indices
= (struct index_entry
*)((long)hdr
->indices
+ offpos
);
3874 for (i
= 0; i
< TAG_COUNT
; i
++)
3875 hdr
->tags
[i
] += offpos
;
3880 static bool tagcache_dumpsave(void)
3882 struct statefile_header shdr
;
3885 if (!tc_stat
.ramcache
)
3888 fd
= open(TAGCACHE_STATEFILE
, O_WRONLY
| O_CREAT
| O_TRUNC
, 0666);
3891 logf("failed to create a statedump");
3895 /* Create the header */
3897 memcpy(&shdr
.tc_stat
, &tc_stat
, sizeof(struct tagcache_stat
));
3898 write(fd
, &shdr
, sizeof(struct statefile_header
));
3900 /* And dump the data too */
3901 write(fd
, hdr
, tc_stat
.ramcache_allocated
);
3908 static bool load_tagcache(void)
3910 struct tagcache_header
*tch
;
3911 long bytesleft
= tc_stat
.ramcache_allocated
;
3912 struct index_entry
*idx
;
3917 # ifdef HAVE_DIRCACHE
3918 while (dircache_is_initializing())
3921 dircache_set_appflag(DIRCACHE_APPFLAG_TAGCACHE
);
3924 logf("loading tagcache to ram...");
3926 fd
= open(TAGCACHE_FILE_MASTER
, O_RDONLY
);
3929 logf("tagcache open failed");
3933 if (ecread(fd
, &hdr
->h
, 1, master_header_ec
, tc_stat
.econ
)
3934 != sizeof(struct master_header
)
3935 || hdr
->h
.tch
.magic
!= TAGCACHE_MAGIC
)
3937 logf("incorrect header");
3943 /* Load the master index table. */
3944 for (i
= 0; i
< hdr
->h
.tch
.entry_count
; i
++)
3946 rc
= ecread_index_entry(fd
, idx
);
3947 if (rc
!= sizeof(struct index_entry
))
3949 logf("read error #10");
3954 bytesleft
-= sizeof(struct index_entry
);
3955 if (bytesleft
< 0 || ((long)idx
- (long)hdr
->indices
) >= tc_stat
.ramcache_allocated
)
3957 logf("too big tagcache.");
3967 /* Load the tags. */
3969 for (tag
= 0; tag
< TAG_COUNT
; tag
++)
3971 struct tagfile_entry
*fe
;
3972 char buf
[TAG_MAXLEN
+32];
3974 if (TAGCACHE_IS_NUMERIC(tag
))
3977 //p = ((void *)p+1);
3978 p
= (char *)((long)p
& ~0x03) + 0x04;
3981 /* Check the header. */
3982 tch
= (struct tagcache_header
*)p
;
3983 p
+= sizeof(struct tagcache_header
);
3985 if ( (fd
= open_tag_fd(tch
, tag
, false)) < 0)
3988 for (hdr
->entry_count
[tag
] = 0;
3989 hdr
->entry_count
[tag
] < tch
->entry_count
;
3990 hdr
->entry_count
[tag
]++)
3994 if (do_timed_yield())
3996 /* Abort if we got a critical event in queue */
3997 if (check_event_queue())
4001 fe
= (struct tagfile_entry
*)p
;
4002 pos
= lseek(fd
, 0, SEEK_CUR
);
4003 rc
= ecread_tagfile_entry(fd
, fe
);
4004 if (rc
!= sizeof(struct tagfile_entry
))
4006 /* End of lookup table. */
4007 logf("read error #11");
4012 /* We have a special handling for the filename tags. */
4013 if (tag
== tag_filename
)
4015 # ifdef HAVE_DIRCACHE
4016 const struct dircache_entry
*dc
;
4019 // FIXME: This is wrong!
4020 // idx = &hdr->indices[hdr->entry_count[i]];
4021 idx
= &hdr
->indices
[fe
->idx_id
];
4023 if (fe
->tag_length
>= (long)sizeof(buf
)-1)
4027 logf("TAG:%s", buf
);
4028 logf("too long filename");
4033 rc
= read(fd
, buf
, fe
->tag_length
);
4034 if (rc
!= fe
->tag_length
)
4036 logf("read error #12");
4041 /* Check if the entry has already been removed */
4042 if (idx
->flag
& FLAG_DELETED
)
4045 /* This flag must not be used yet. */
4046 if (idx
->flag
& FLAG_DIRCACHE
)
4048 logf("internal error!");
4053 if (idx
->tag_seek
[tag
] != pos
)
4055 logf("corrupt data structures!");
4060 # ifdef HAVE_DIRCACHE
4061 if (dircache_is_enabled())
4063 dc
= dircache_get_entry_ptr(buf
);
4066 logf("Entry no longer valid.");
4068 if (global_settings
.tagcache_autoupdate
)
4069 delete_entry(fe
->idx_id
);
4073 idx
->flag
|= FLAG_DIRCACHE
;
4074 idx
->tag_seek
[tag_filename
] = (long)dc
;
4079 /* This will be very slow unless dircache is enabled
4080 or target is flash based, but do it anyway for
4082 /* Check if entry has been removed. */
4083 if (global_settings
.tagcache_autoupdate
)
4085 if (!file_exists(buf
))
4087 logf("Entry no longer valid.");
4089 delete_entry(fe
->idx_id
);
4098 bytesleft
-= sizeof(struct tagfile_entry
) + fe
->tag_length
;
4101 logf("too big tagcache #2");
4102 logf("tl: %ld", fe
->tag_length
);
4103 logf("bl: %ld", bytesleft
);
4109 rc
= read(fd
, fe
->tag_data
, fe
->tag_length
);
4112 if (rc
!= fe
->tag_length
)
4114 logf("read error #13");
4115 logf("rc=0x%04x", rc
); // 0x431
4116 logf("len=0x%04lx", fe
->tag_length
); // 0x4000
4117 logf("pos=0x%04lx", lseek(fd
, 0, SEEK_CUR
)); // 0x433
4118 logf("tag=0x%02x", tag
); // 0x00
4126 tc_stat
.ramcache_used
= tc_stat
.ramcache_allocated
- bytesleft
;
4127 logf("tagcache loaded into ram!");
4131 #endif /* HAVE_TC_RAMCACHE */
4133 static bool check_deleted_files(void)
4136 char buf
[TAG_MAXLEN
+32];
4137 struct tagfile_entry tfe
;
4139 logf("reverse scan...");
4140 snprintf(buf
, sizeof buf
, TAGCACHE_FILE_INDEX
, tag_filename
);
4141 fd
= open(buf
, O_RDONLY
);
4145 logf("%s open fail", buf
);
4149 lseek(fd
, sizeof(struct tagcache_header
), SEEK_SET
);
4150 while (ecread_tagfile_entry(fd
, &tfe
) == sizeof(struct tagfile_entry
)
4152 && !check_event_queue()
4156 if (tfe
.tag_length
>= (long)sizeof(buf
)-1)
4158 logf("too long tag");
4163 if (read(fd
, buf
, tfe
.tag_length
) != tfe
.tag_length
)
4165 logf("read error #14");
4170 /* Check if the file has already deleted from the db. */
4174 /* Now check if the file exists. */
4175 if (!file_exists(buf
))
4177 logf("Entry no longer valid.");
4178 logf("-> %s / %ld", buf
, tfe
.tag_length
);
4179 delete_entry(tfe
.idx_id
);
4191 /* Note that this function must not be inlined, otherwise the whole point
4192 * of having the code in a separate function is lost.
4194 static void __attribute__ ((noinline
)) check_ignore(const char *dirname
,
4195 int *ignore
, int *unignore
)
4197 char newpath
[MAX_PATH
];
4199 /* check for a database.ignore file */
4200 snprintf(newpath
, MAX_PATH
, "%s/database.ignore", dirname
);
4201 *ignore
= file_exists(newpath
);
4202 /* check for a database.unignore file */
4203 snprintf(newpath
, MAX_PATH
, "%s/database.unignore", dirname
);
4204 *unignore
= file_exists(newpath
);
4207 static struct search_roots_ll
{
4209 struct search_roots_ll
* next
;
4214 * This adds a path to the search roots, possibly during traveling through
4215 * the filesystem. It only adds if the path is not inside an already existing
4218 * Returns true if it added the path to the search roots
4220 * Windows 2000 and greater supports symlinks, but they don't provide
4221 * realpath() or readlink(), and symlinks are rarely used on them so
4222 * ignore this for windows for now
4224 static bool add_search_root(const char *name
)
4228 struct search_roots_ll
*this, *prev
= NULL
;
4229 char target
[MAX_PATH
];
4230 /* Okay, realpath() is almost completely broken on android
4232 * It doesn't accept NULL for resolved_name to dynamically allocate
4233 * the resulting path; and it assumes resolved_name to be PATH_MAX
4234 * (actually MAXPATHLEN, but it's the same [as of 2.3]) long
4235 * and blindly writes to the end if it
4237 * therefore use sufficiently large static storage here
4238 * Note that PATH_MAX != MAX_PATH
4240 static char abs_target
[PATH_MAX
];
4243 len
= readlink(name
, target
, sizeof(target
));
4248 if (realpath(target
, abs_target
) == NULL
)
4251 for(this = &roots_ll
; this; prev
= this, this = this->next
)
4253 size_t root_len
= strlen(this->path
);
4254 /* check if the link target is inside of an existing search root
4255 * don't add if target is inside, we'll scan it later */
4256 if (!strncmp(this->path
, abs_target
, root_len
))
4262 size_t len
= strlen(abs_target
) + 1; /* count \0 */
4263 this = malloc(sizeof(struct search_roots_ll
) + len
);
4264 if (!this || len
> MAX_PATH
)
4266 logf("Error at adding a search root: %s", this ? "path too long":"OOM");
4271 this->path
= ((char*)this) + sizeof(struct search_roots_ll
);
4272 strcpy((char*)this->path
, abs_target
); /* ok to cast const away here */
4275 logf("Added %s to the search roots\n", abs_target
);
4282 static int free_search_roots(struct search_roots_ll
* start
)
4287 ret
+= free_search_roots(start
->next
);
4288 ret
+= sizeof(struct search_roots_ll
);
4293 #else /* native, simulator */
4294 #define add_search_root(a) do {} while(0)
4295 #define free_search_roots(a) do {} while(0)
4298 static bool check_dir(const char *dirname
, int add_files
)
4302 int success
= false;
4303 int ignore
, unignore
;
4305 dir
= opendir(dirname
);
4308 logf("tagcache: opendir(%s) failed", dirname
);
4311 /* check for a database.ignore and database.unignore */
4312 check_ignore(dirname
, &ignore
, &unignore
);
4314 /* don't do anything if both ignore and unignore are there */
4315 if (ignore
!= unignore
)
4316 add_files
= unignore
;
4318 /* Recursively scan the dir. */
4322 while (!check_event_queue())
4325 struct dirent
*entry
= readdir(dir
);
4332 if (!strcmp((char *)entry
->d_name
, ".") ||
4333 !strcmp((char *)entry
->d_name
, ".."))
4336 struct dirinfo info
= dir_get_info(dir
, entry
);
4340 len
= strlen(curpath
);
4341 /* don't add an extra / for curpath == / */
4342 if (len
<= 1) len
= 0;
4343 snprintf(&curpath
[len
], sizeof(curpath
) - len
, "/%s", entry
->d_name
);
4345 processed_dir_count
++;
4346 if (info
.attribute
& ATTR_DIRECTORY
)
4347 { /* don't follow symlinks to dirs, but try to add it as a search root
4348 * this makes able to avoid looping in recursive symlinks */
4349 if (info
.attribute
& ATTR_LINK
)
4350 add_search_root(curpath
);
4352 check_dir(curpath
, add_files
);
4356 tc_stat
.curentry
= curpath
;
4358 /* Add a new entry to the temporary db file. */
4359 add_tagcache(curpath
, (info
.wrtdate
<< 16) | info
.wrttime
4360 #if defined(HAVE_TC_RAMCACHE) && defined(HAVE_DIRCACHE)
4361 , dir
->internal_entry
4365 /* Wait until current path for debug screen is read and unset. */
4366 while (tc_stat
.syncscreen
&& tc_stat
.curentry
!= NULL
)
4369 tc_stat
.curentry
= NULL
;
4372 curpath
[len
] = '\0';
4380 void tagcache_screensync_event(void)
4382 tc_stat
.curentry
= NULL
;
4385 void tagcache_screensync_enable(bool state
)
4387 tc_stat
.syncscreen
= state
;
4390 void tagcache_build(const char *path
)
4392 struct tagcache_header header
;
4397 total_entry_count
= 0;
4398 processed_dir_count
= 0;
4400 #ifdef HAVE_DIRCACHE
4401 while (dircache_is_initializing())
4405 logf("updating tagcache");
4407 cachefd
= open(TAGCACHE_FILE_TEMP
, O_RDONLY
);
4410 logf("skipping, cache already waiting for commit");
4415 cachefd
= open(TAGCACHE_FILE_TEMP
, O_RDWR
| O_CREAT
| O_TRUNC
, 0666);
4418 logf("master file open failed: %s", TAGCACHE_FILE_TEMP
);
4422 filenametag_fd
= open_tag_fd(&header
, tag_filename
, false);
4426 logf("Scanning files...");
4427 /* Scan for new files. */
4428 memset(&header
, 0, sizeof(struct tagcache_header
));
4429 write(cachefd
, &header
, sizeof(struct tagcache_header
));
4432 roots_ll
.path
= path
;
4433 roots_ll
.next
= NULL
;
4434 struct search_roots_ll
* this;
4435 /* check_dir might add new roots */
4436 for(this = &roots_ll
; this; this = this->next
)
4438 strcpy(curpath
, this->path
);
4439 ret
= ret
&& check_dir(this->path
, true);
4442 free_search_roots(roots_ll
.next
);
4444 /* Write the header. */
4445 header
.magic
= TAGCACHE_MAGIC
;
4446 header
.datasize
= data_size
;
4447 header
.entry_count
= total_entry_count
;
4448 lseek(cachefd
, 0, SEEK_SET
);
4449 write(cachefd
, &header
, sizeof(struct tagcache_header
));
4452 if (filenametag_fd
>= 0)
4454 close(filenametag_fd
);
4455 filenametag_fd
= -1;
4465 /* Commit changes to the database. */
4471 remove(TAGCACHE_FILE_TEMP
);
4472 logf("tagcache built!");
4478 #ifdef HAVE_TC_RAMCACHE
4481 /* Import runtime statistics if we just initialized the db. */
4482 if (hdr
->h
.serial
== 0)
4483 queue_post(&tagcache_queue
, Q_IMPORT_CHANGELOG
, 0);
4490 #ifdef HAVE_TC_RAMCACHE
4491 static void load_ramcache(void)
4498 /* At first we should load the cache (if exists). */
4499 tc_stat
.ramcache
= load_tagcache();
4501 if (!tc_stat
.ramcache
)
4503 /* If loading failed, it must indicate some problem with the db
4504 * so disable it entirely to prevent further issues. */
4505 tc_stat
.ready
= false;
4512 void tagcache_unload_ramcache(void)
4514 tc_stat
.ramcache
= false;
4515 /* Just to make sure there is no statefile present. */
4516 // remove(TAGCACHE_STATEFILE);
4521 static void tagcache_thread(void)
4523 struct queue_event ev
;
4524 bool check_done
= false;
4526 /* If the previous cache build/update was interrupted, commit
4527 * the changes first in foreground. */
4533 #ifdef HAVE_TC_RAMCACHE
4534 # ifdef HAVE_EEPROM_SETTINGS
4535 if (firmware_settings
.initialized
&& firmware_settings
.disk_clean
4536 && global_settings
.tagcache_ram
)
4538 check_done
= tagcache_dumpload();
4541 remove(TAGCACHE_STATEFILE
);
4544 /* Allocate space for the tagcache if found on disk. */
4545 if (global_settings
.tagcache_ram
&& !tc_stat
.ramcache
)
4546 allocate_tagcache();
4550 tc_stat
.initialized
= true;
4552 /* Don't delay bootup with the header check but do it on background. */
4556 tc_stat
.ready
= check_all_headers();
4557 tc_stat
.readyvalid
= true;
4562 run_command_queue(false);
4564 queue_wait_w_tmo(&tagcache_queue
, &ev
, HZ
);
4568 case Q_IMPORT_CHANGELOG
:
4569 tagcache_import_changelog();
4574 remove(TAGCACHE_FILE_TEMP
);
4575 tagcache_build("/");
4579 tagcache_build("/");
4580 #ifdef HAVE_TC_RAMCACHE
4583 check_deleted_files();
4589 if (check_done
|| !tc_stat
.ready
)
4592 #ifdef HAVE_TC_RAMCACHE
4593 if (!tc_stat
.ramcache
&& global_settings
.tagcache_ram
)
4596 if (tc_stat
.ramcache
&& global_settings
.tagcache_autoupdate
)
4597 tagcache_build("/");
4601 if (global_settings
.tagcache_autoupdate
)
4603 tagcache_build("/");
4605 /* This will be very slow unless dircache is enabled
4606 or target is flash based, but do it anyway for
4608 check_deleted_files();
4611 logf("tagcache check done");
4622 #if (CONFIG_PLATFORM & PLATFORM_NATIVE)
4623 case SYS_USB_CONNECTED
:
4624 logf("USB: TagCache");
4625 usb_acknowledge(SYS_USB_CONNECTED_ACK
);
4626 usb_wait_for_disconnect(&tagcache_queue
);
4633 bool tagcache_prepare_shutdown(void)
4635 if (tagcache_get_commit_step() > 0)
4638 tagcache_stop_scan();
4639 while (read_lock
|| write_lock
)
4645 void tagcache_shutdown(void)
4647 /* Flush the command queue. */
4648 run_command_queue(true);
4650 #ifdef HAVE_EEPROM_SETTINGS
4651 if (tc_stat
.ramcache
)
4652 tagcache_dumpsave();
4656 static int get_progress(void)
4658 int total_count
= -1;
4660 #ifdef HAVE_DIRCACHE
4661 if (dircache_is_enabled())
4663 total_count
= dircache_get_entry_count();
4667 #ifdef HAVE_TC_RAMCACHE
4669 if (hdr
&& tc_stat
.ramcache
)
4670 total_count
= hdr
->h
.tch
.entry_count
;
4674 if (total_count
< 0)
4677 return processed_dir_count
* 100 / total_count
;
4680 struct tagcache_stat
* tagcache_get_stat(void)
4682 tc_stat
.progress
= get_progress();
4683 tc_stat
.processed_entries
= processed_dir_count
;
4688 void tagcache_start_scan(void)
4690 queue_post(&tagcache_queue
, Q_START_SCAN
, 0);
4693 bool tagcache_update(void)
4698 queue_post(&tagcache_queue
, Q_UPDATE
, 0);
4702 bool tagcache_rebuild()
4704 queue_post(&tagcache_queue
, Q_REBUILD
, 0);
4708 void tagcache_stop_scan(void)
4710 queue_post(&tagcache_queue
, Q_STOP_SCAN
, 0);
4713 #ifdef HAVE_TC_RAMCACHE
4714 bool tagcache_is_ramcache(void)
4716 return tc_stat
.ramcache
;
4720 #endif /* !__PCTOOL__ */
4723 void tagcache_init(void)
4725 memset(&tc_stat
, 0, sizeof(struct tagcache_stat
));
4726 memset(¤t_tcmh
, 0, sizeof(struct master_header
));
4727 filenametag_fd
= -1;
4728 write_lock
= read_lock
= 0;
4731 mutex_init(&command_queue_mutex
);
4732 queue_init(&tagcache_queue
, true);
4733 create_thread(tagcache_thread
, tagcache_stack
,
4734 sizeof(tagcache_stack
), 0, tagcache_thread_name
4735 IF_PRIO(, PRIORITY_BACKGROUND
)
4738 tc_stat
.initialized
= true;
4742 tc_stat
.ready
= check_all_headers();
4747 void tagcache_reverse_scan(void)
4749 logf("Checking for deleted files");
4750 check_deleted_files();
4754 bool tagcache_is_initialized(void)
4756 return tc_stat
.initialized
;
4758 bool tagcache_is_fully_initialized(void)
4760 return tc_stat
.readyvalid
;
4762 bool tagcache_is_usable(void)
4764 return tc_stat
.initialized
&& tc_stat
.ready
;
4766 int tagcache_get_commit_step(void)
4768 return tc_stat
.commit_step
;
4770 int tagcache_get_max_commit_step(void)
4772 return (int)(SORTED_TAGS_COUNT
)+1;