]> git.saurik.com Git - apt.git/blob - apt-pkg/versionmatch.cc
increase Pkg/Grp hash table size from 2k to 64k
[apt.git] / apt-pkg / versionmatch.cc
1 // -*- mode: cpp; mode: fold -*-
2 // Description /*{{{*/
3 // $Id: versionmatch.cc,v 1.9 2003/05/19 17:58:26 doogie Exp $
4 /* ######################################################################
5
6 Version Matching
7
8 This module takes a matching string and a type and locates the version
9 record that satisfies the constraint described by the matching string.
10
11 ##################################################################### */
12 /*}}}*/
13 // Include Files /*{{{*/
14 #include<config.h>
15
16 #include <apt-pkg/versionmatch.h>
17 #include <apt-pkg/strutl.h>
18 #include <apt-pkg/error.h>
19 #include <apt-pkg/pkgcache.h>
20 #include <apt-pkg/cacheiterators.h>
21
22 #include <stddef.h>
23 #include <stdlib.h>
24 #include <string.h>
25 #include <string>
26 #include <stdio.h>
27 #include <ctype.h>
28 #include <fnmatch.h>
29 #include <regex.h>
30 /*}}}*/
31
32 using std::string;
33
34 // VersionMatch::pkgVersionMatch - Constructor /*{{{*/
35 // ---------------------------------------------------------------------
36 /* Break up the data string according to the selected type */
37 pkgVersionMatch::pkgVersionMatch(string Data,MatchType Type) : Type(Type)
38 {
39 MatchAll = false;
40 VerPrefixMatch = false;
41 RelVerPrefixMatch = false;
42
43 if (Type == None || Data.length() < 1)
44 return;
45
46 // Cut up the version representation
47 if (Type == Version)
48 {
49 if (Data.end()[-1] == '*')
50 {
51 VerPrefixMatch = true;
52 VerStr = string(Data,0,Data.length()-1);
53 }
54 else
55 VerStr = Data;
56 return;
57 }
58
59 if (Type == Release)
60 {
61 // All empty = match all
62 if (Data == "*")
63 {
64 MatchAll = true;
65 return;
66 }
67
68 // Are we a simple specification?
69 string::const_iterator I = Data.begin();
70 for (; I != Data.end() && *I != '='; ++I);
71 if (I == Data.end())
72 {
73 // Temporary
74 if (isdigit(Data[0]))
75 RelVerStr = Data;
76 else
77 RelRelease = Data;
78
79 if (RelVerStr.length() > 0 && RelVerStr.end()[-1] == '*')
80 {
81 RelVerPrefixMatch = true;
82 RelVerStr = string(RelVerStr.begin(),RelVerStr.end()-1);
83 }
84 return;
85 }
86
87 char Spec[300];
88 char *Fragments[20];
89 snprintf(Spec,sizeof(Spec),"%s",Data.c_str());
90 if (TokSplitString(',',Spec,Fragments,
91 sizeof(Fragments)/sizeof(Fragments[0])) == false)
92 {
93 Type = None;
94 return;
95 }
96
97 for (unsigned J = 0; Fragments[J] != 0; J++)
98 {
99 if (strlen(Fragments[J]) < 3)
100 continue;
101
102 if (stringcasecmp(Fragments[J],Fragments[J]+2,"v=") == 0)
103 RelVerStr = Fragments[J]+2;
104 else if (stringcasecmp(Fragments[J],Fragments[J]+2,"o=") == 0)
105 RelOrigin = Fragments[J]+2;
106 else if (stringcasecmp(Fragments[J],Fragments[J]+2,"a=") == 0)
107 RelArchive = Fragments[J]+2;
108 else if (stringcasecmp(Fragments[J],Fragments[J]+2,"n=") == 0)
109 RelCodename = Fragments[J]+2;
110 else if (stringcasecmp(Fragments[J],Fragments[J]+2,"l=") == 0)
111 RelLabel = Fragments[J]+2;
112 else if (stringcasecmp(Fragments[J],Fragments[J]+2,"c=") == 0)
113 RelComponent = Fragments[J]+2;
114 else if (stringcasecmp(Fragments[J],Fragments[J]+2,"b=") == 0)
115 RelArchitecture = Fragments[J]+2;
116 }
117
118 if (RelVerStr.end()[-1] == '*')
119 {
120 RelVerPrefixMatch = true;
121 RelVerStr = string(RelVerStr.begin(),RelVerStr.end()-1);
122 }
123 return;
124 }
125
126 if (Type == Origin)
127 {
128 if (Data[0] == '"' && Data.length() >= 2 && Data.end()[-1] == '"')
129 OrSite = Data.substr(1, Data.length() - 2);
130 else
131 OrSite = Data;
132 return;
133 }
134 }
135 /*}}}*/
136 // VersionMatch::MatchVer - Match a version string with prefixing /*{{{*/
137 // ---------------------------------------------------------------------
138 /* */
139 bool pkgVersionMatch::MatchVer(const char *A,string B,bool Prefix)
140 {
141 const char *Ab = A;
142 const char *Ae = Ab + strlen(A);
143
144 // Strings are not a compatible size.
145 if (((unsigned)(Ae - Ab) != B.length() && Prefix == false) ||
146 (unsigned)(Ae - Ab) < B.length())
147 return false;
148
149 // Match (leading?)
150 if (stringcasecmp(B,Ab,Ab + B.length()) == 0)
151 return true;
152
153 return false;
154 }
155 /*}}}*/
156 // VersionMatch::Find - Locate the best match for the select type /*{{{*/
157 // ---------------------------------------------------------------------
158 /* */
159 pkgCache::VerIterator pkgVersionMatch::Find(pkgCache::PkgIterator Pkg)
160 {
161 pkgCache::VerIterator Ver = Pkg.VersionList();
162 for (; Ver.end() == false; ++Ver)
163 {
164 if (Type == Version)
165 {
166 if (MatchVer(Ver.VerStr(),VerStr,VerPrefixMatch) == true)
167 return Ver;
168 if (ExpressionMatches(VerStr, Ver.VerStr()) == true)
169 return Ver;
170 continue;
171 }
172
173 for (pkgCache::VerFileIterator VF = Ver.FileList(); VF.end() == false; ++VF)
174 if (FileMatch(VF.File()) == true)
175 return Ver;
176 }
177
178 // This will be Ended by now.
179 return Ver;
180 }
181
182 #ifndef FNM_CASEFOLD
183 #define FNM_CASEFOLD 0
184 #endif
185
186 bool pkgVersionMatch::ExpressionMatches(const char *pattern, const char *string)
187 {
188 if (pattern[0] == '/') {
189 size_t length = strlen(pattern);
190 if (pattern[length - 1] == '/') {
191 bool res = false;
192 regex_t preg;
193 char *regex = strdup(pattern + 1);
194 regex[length - 2] = '\0';
195 if (regcomp(&preg, regex, REG_EXTENDED | REG_ICASE) != 0) {
196 _error->Warning("Invalid regular expression: %s", regex);
197 } else if (regexec(&preg, string, 0, NULL, 0) == 0) {
198 res = true;
199 }
200 free(regex);
201 regfree(&preg);
202 return res;
203 }
204 }
205 return fnmatch(pattern, string, FNM_CASEFOLD) == 0;
206 }
207 bool pkgVersionMatch::ExpressionMatches(const std::string& pattern, const char *string)
208 {
209 return ExpressionMatches(pattern.c_str(), string);
210 }
211 /*}}}*/
212 // VersionMatch::FileMatch - Match against an index file /*{{{*/
213 // ---------------------------------------------------------------------
214 /* This matcher checks against the release file and the origin location
215 to see if the constraints are met. */
216 bool pkgVersionMatch::FileMatch(pkgCache::PkgFileIterator File)
217 {
218 if (Type == Release)
219 {
220 if (MatchAll == true)
221 return true;
222
223 /* cout << RelVerStr << ',' << RelOrigin << ',' << RelArchive << ',' << RelLabel << endl;
224 cout << File.Version() << ',' << File.Origin() << ',' << File.Archive() << ',' << File.Label() << endl;*/
225
226 if (RelVerStr.empty() == true && RelOrigin.empty() == true &&
227 RelArchive.empty() == true && RelLabel.empty() == true &&
228 RelRelease.empty() == true && RelCodename.empty() == true &&
229 RelComponent.empty() == true && RelArchitecture.empty() == true)
230 return false;
231
232 if (RelVerStr.empty() == false)
233 if (File->Version == 0 ||
234 (MatchVer(File.Version(),RelVerStr,RelVerPrefixMatch) == false &&
235 ExpressionMatches(RelVerStr, File.Version()) == false))
236 return false;
237 if (RelOrigin.empty() == false)
238 if (File->Origin == 0 || !ExpressionMatches(RelOrigin,File.Origin()))
239 return false;
240 if (RelArchive.empty() == false)
241 if (File->Archive == 0 ||
242 !ExpressionMatches(RelArchive,File.Archive()))
243 return false;
244 if (RelCodename.empty() == false)
245 if (File->Codename == 0 ||
246 !ExpressionMatches(RelCodename,File.Codename()))
247 return false;
248 if (RelRelease.empty() == false)
249 if ((File->Archive == 0 ||
250 !ExpressionMatches(RelRelease,File.Archive())) &&
251 (File->Codename == 0 ||
252 !ExpressionMatches(RelRelease,File.Codename())))
253 return false;
254 if (RelLabel.empty() == false)
255 if (File->Label == 0 ||
256 !ExpressionMatches(RelLabel,File.Label()))
257 return false;
258 if (RelComponent.empty() == false)
259 if (File->Component == 0 ||
260 !ExpressionMatches(RelComponent,File.Component()))
261 return false;
262 if (RelArchitecture.empty() == false)
263 if (File->Architecture == 0 ||
264 !ExpressionMatches(RelArchitecture,File.Architecture()))
265 return false;
266 return true;
267 }
268
269 if (Type == Origin)
270 {
271 if (OrSite.empty() == false) {
272 if (File->Site == 0)
273 return false;
274 } else // so we are talking about file:// or status file
275 if (strcmp(File.Site(),"") == 0 && File->Archive != 0 && strcmp(File.Archive(),"now") == 0) // skip the status file
276 return false;
277 return (ExpressionMatches(OrSite, File.Site())); /* both strings match */
278 }
279
280 return false;
281 }
282 /*}}}*/