2 * This file is part of DisOrder
3 * Copyright (C) 2005, 2006, 2007 Richard Kettlewell
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
29 #include "trackname.h"
30 #include "configuration.h"
36 const struct collection *find_track_collection(const char *track) {
38 size_t l, tl = strlen(track);
40 for(n = 0; n < config->collection.n; ++n) {
41 l = strlen(config->collection.s[n].root);
43 && !strncmp(track, config->collection.s[n].root, l)
47 if(n < config->collection.n)
48 return &config->collection.s[n];
53 const char *find_track_root(const char *track) {
54 const struct collection *c = find_track_collection(track);
57 error(0, "found track in no collection '%s'", track);
61 const char *track_rootless(const char *track) {
64 if(!(root = find_track_root(track))) return 0;
65 return track + strlen(root);
68 const char *trackname_part(const char *track,
72 const char *replaced, *rootless;
75 if(!strcmp(part, "path")) return track;
76 if(!strcmp(part, "ext")) return extension(track);
77 if((rootless = track_rootless(track))) track = rootless;
78 for(n = 0; n < config->namepart.n; ++n) {
79 if(!strcmp(config->namepart.s[n].part, part)
80 && fnmatch(config->namepart.s[n].context, context, 0) == 0) {
81 if((replaced = regsub(config->namepart.s[n].re,
83 config->namepart.s[n].replace,
84 config->namepart.s[n].reflags
93 const char *trackname_transform(const char *type,
95 const char *context) {
98 const struct transform *k;
100 for(n = 0; n < config->transform.n; ++n) {
101 k = &config->transform.t[n];
102 if(strcmp(k->type, type))
104 if(fnmatch(k->context, context, 0) != 0)
106 if((replaced = regsub(k->re, subject, k->replace, k->flags)))
112 int compare_tracks(const char *sa, const char *sb,
113 const char *da, const char *db,
114 const char *ta, const char *tb) {
117 if((c = strcmp(utf8_casefold_canon(sa, strlen(sa), 0),
118 utf8_casefold_canon(sb, strlen(sb), 0))))
120 if((c = strcmp(sa, sb))) return c;
121 if((c = strcmp(utf8_casefold_canon(da, strlen(da), 0),
122 utf8_casefold_canon(db, strlen(db), 0))))
124 if((c = strcmp(da, db))) return c;
125 return compare_path(ta, tb);
128 int compare_path_raw(const unsigned char *ap, size_t an,
129 const unsigned char *bp, size_t bn) {
130 /* Don't change this function! The database sort order depends on it */
131 while(an > 0 && bn > 0) {
137 } else if(*ap == '/') {
138 return -1; /* /a/b < /aa/ */
139 } else if(*bp == '/') {
140 return 1; /* /aa > /a/b */
145 return 1; /* /a/b > /a and /ab > /a */
147 return -1; /* /a < /ab and /a < /a/b */