cef77b85ee6ca5ad71206f823b2c6cadf57fa6ef
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
) {
48 error(0, "found track in no collection '%s'", track
);
51 return config
->collection
.s
[n
].root
;
54 const char *track_rootless(const char *track
) {
57 if(!(root
= find_track_root(track
))) return 0;
58 return track
+ strlen(root
);
61 const char *trackname_part(const char *track
,
65 const char *replaced
, *rootless
;
68 if(!strcmp(part
, "path")) return track
;
69 if(!strcmp(part
, "ext")) return extension(track
);
70 if((rootless
= track_rootless(track
))) track
= rootless
;
71 for(n
= 0; n
< config
->namepart
.n
; ++n
) {
72 if(!strcmp(config
->namepart
.s
[n
].part
, part
)
73 && fnmatch(config
->namepart
.s
[n
].context
, context
, 0) == 0) {
74 if((replaced
= regsub(config
->namepart
.s
[n
].re
,
76 config
->namepart
.s
[n
].replace
,
77 config
->namepart
.s
[n
].reflags
86 const char *trackname_transform(const char *type
,
88 const char *context
) {
91 const struct transform
*k
;
93 for(n
= 0; n
< config
->transform
.n
; ++n
) {
94 k
= &config
->transform
.t
[n
];
95 if(strcmp(k
->type
, type
))
97 if(fnmatch(k
->context
, context
, 0) != 0)
99 if((replaced
= regsub(k
->re
, subject
, k
->replace
, k
->flags
)))
105 int compare_tracks(const char *sa
, const char *sb
,
106 const char *da
, const char *db
,
107 const char *ta
, const char *tb
) {
110 if((c
= strcmp(casefold(sa
), casefold(sb
)))) return c
;
111 if((c
= strcmp(sa
, sb
))) return c
;
112 if((c
= strcmp(casefold(da
), casefold(db
)))) return c
;
113 if((c
= strcmp(da
, db
))) return c
;
114 return compare_path(ta
, tb
);
117 int compare_path_raw(const unsigned char *ap
, size_t an
,
118 const unsigned char *bp
, size_t bn
) {
119 while(an
> 0 && bn
> 0) {
125 } else if(*ap
== '/') {
126 return -1; /* /a/b < /aa/ */
127 } else if(*bp
== '/') {
128 return 1; /* /aa > /a/b */
133 return 1; /* /a/b > /a and /ab > /a */
135 return -1; /* /a < /ab and /a < /a/b */