2 * This file is part of DisOrder
3 * Copyright (C) 2005, 2006 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 char *find_track_root(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) return 0;
48 return config->collection.s[n].root;
51 const char *track_rootless(const char *track) {
54 if(!(root = find_track_root(track))) return 0;
55 return track + strlen(root);
58 const char *trackname_part(const char *track,
62 const char *replaced, *rootless;
65 if(!strcmp(part, "path")) return track;
66 if(!strcmp(part, "ext")) return extension(track);
67 if((rootless = track_rootless(track))) track = rootless;
68 for(n = 0; n < config->namepart.n; ++n) {
69 if(!strcmp(config->namepart.s[n].part, part)
70 && fnmatch(config->namepart.s[n].context, context, 0) == 0) {
71 if((replaced = regsub(config->namepart.s[n].re,
73 config->namepart.s[n].replace,
74 config->namepart.s[n].reflags
83 const char *trackname_transform(const char *type,
85 const char *context) {
88 const struct transform *k;
90 for(n = 0; n < config->transform.n; ++n) {
91 k = &config->transform.t[n];
92 if(strcmp(k->type, type))
94 if(fnmatch(k->context, context, 0) != 0)
96 if((replaced = regsub(k->re, subject, k->replace, k->flags)))
102 int compare_tracks(const char *sa, const char *sb,
103 const char *da, const char *db,
104 const char *ta, const char *tb) {
107 if((c = strcmp(casefold(sa), casefold(sb)))) return c;
108 if((c = strcmp(sa, sb))) return c;
109 if((c = strcmp(casefold(da), casefold(db)))) return c;
110 if((c = strcmp(da, db))) return c;
111 return compare_path(ta, tb);
114 int compare_path_raw(const unsigned char *ap, size_t an,
115 const unsigned char *bp, size_t bn) {
116 while(an > 0 && bn > 0) {
122 } else if(*ap == '/') {
123 return -1; /* /a/b < /aa/ */
124 } else if(*bp == '/') {
125 return 1; /* /aa > /a/b */
130 return 1; /* /a/b > /a and /ab > /a */
132 return -1; /* /a < /ab and /a < /a/b */
144 /* arch-tag:xMbRRluU86PaVSSnyIR77A */