2 * Copyright (c) 2007-2009, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
22 #if defined(DEBIAN) || defined(MULTI_SEMANTICS)
24 /* debian type version compare */
26 solv_vercmp_deb(const char *s1, const char *q1, const char *s2, const char *q2)
31 c1 = s1 < q1 ? *(const unsigned char *)s1++ : 0;
32 c2 = s2 < q2 ? *(const unsigned char *)s2++ : 0;
33 if ((c1 >= '0' && c1 <= '9') && (c2 >= '0' && c2 <= '9'))
36 c1 = s1 < q1 ? *(const unsigned char *)s1++ : 0;
38 c2 = s2 < q2 ? *(const unsigned char *)s2++ : 0;
40 while ((c1 >= '0' && c1 <= '9') && (c2 >= '0' && c2 <= '9'))
44 c1 = s1 < q1 ? *(const unsigned char *)s1++ : 0;
45 c2 = s2 < q2 ? *(const unsigned char *)s2++ : 0;
47 if (c1 >= '0' && c1 <= '9')
49 if (c2 >= '0' && c2 <= '9')
52 return r < 0 ? -1 : 1;
54 c1 = c1 == '~' ? -1 : !c1 || (c1 >= '0' && c1 <= '9') || (c1 >= 'A' && c1 <= 'Z') || (c1 >= 'a' && c1 <= 'z') ? c1 : c1 + 256;
55 c2 = c2 == '~' ? -1 : !c2 || (c2 >= '0' && c2 <= '9') || (c2 >= 'A' && c2 <= 'Z') || (c2 >= 'a' && c2 <= 'z') ? c2 : c2 + 256;
58 return r < 0 ? -1 : 1;
66 #if !defined(DEBIAN) || defined(MULTI_SEMANTICS)
68 /* rpm type version compare */
69 /* note: the code assumes that *q1 and *q2 are not alphanumeric! */
72 solv_vercmp_rpm(const char *s1, const char *q1, const char *s2, const char *q2)
79 while (s1 < q1 && !(*s1 >= '0' && *s1 <= '9') &&
80 !(*s1 >= 'a' && *s1 <= 'z') && !(*s1 >= 'A' && *s1 <= 'Z') && *s1 != '~' && *s1 != '^')
82 while (s2 < q2 && !(*s2 >= '0' && *s2 <= '9') &&
83 !(*s2 >= 'a' && *s2 <= 'z') && !(*s2 >= 'A' && *s2 <= 'Z') && *s2 != '~' && *s2 != '^')
85 if (s1 < q1 && *s1 == '~')
87 if (s2 < q2 && *s2 == '~')
95 if (s2 < q2 && *s2 == '~')
97 if (s1 < q1 && *s1 == '^')
99 if (s2 < q2 && *s2 == '^')
105 return s2 < q2 ? -1 : 1;
107 if (s2 < q2 && *s2 == '^')
108 return s1 < q1 ? 1 : -1;
109 if (s1 >= q1 || s2 >= q2)
111 if ((*s1 >= '0' && *s1 <= '9') || (*s2 >= '0' && *s2 <= '9'))
113 while (*s1 == '0' && s1[1] >= '0' && s1[1] <= '9')
115 while (*s2 == '0' && s2[1] >= '0' && s2[1] <= '9')
117 for (e1 = s1; *e1 >= '0' && *e1 <= '9'; )
119 for (e2 = s2; *e2 >= '0' && *e2 <= '9'; )
121 r = (e1 - s1) - (e2 - s2);
123 r = strncmp(s1, s2, e1 - s1);
125 return r > 0 ? 1 : -1;
129 for (e1 = s1; (*e1 >= 'a' && *e1 <= 'z') || (*e1 >= 'A' && *e1 <= 'Z'); )
131 for (e2 = s2; (*e2 >= 'a' && *e2 <= 'z') || (*e2 >= 'A' && *e2 <= 'Z'); )
133 r = (e1 - s1) - (e2 - s2);
136 r = strncmp(s1, s2, e2 - s2);
137 return r >= 0 ? 1 : -1;
141 r = strncmp(s1, s2, e1 - s1);
142 return r <= 0 ? -1 : 1;
144 r = strncmp(s1, s2, e1 - s1);
146 return r > 0 ? 1 : -1;
151 return s1 < q1 ? 1 : s2 < q2 ? -1 : 0;
155 solv_vercmp_rpm_notilde(const char *s1, const char *q1, const char *s2, const char *q2)
160 while (s1 < q1 && s2 < q2)
162 while (s1 < q1 && !(*s1 >= '0' && *s1 <= '9') &&
163 !(*s1 >= 'a' && *s1 <= 'z') && !(*s1 >= 'A' && *s1 <= 'Z'))
165 while (s2 < q2 && !(*s2 >= '0' && *s2 <= '9') &&
166 !(*s2 >= 'a' && *s2 <= 'z') && !(*s2 >= 'A' && *s2 <= 'Z'))
168 if ((*s1 >= '0' && *s1 <= '9') || (*s2 >= '0' && *s2 <= '9'))
170 while (*s1 == '0' && s1[1] >= '0' && s1[1] <= '9')
172 while (*s2 == '0' && s2[1] >= '0' && s2[1] <= '9')
174 for (e1 = s1; *e1 >= '0' && *e1 <= '9'; )
176 for (e2 = s2; *e2 >= '0' && *e2 <= '9'; )
178 r = (e1 - s1) - (e2 - s2);
180 r = strncmp(s1, s2, e1 - s1);
182 return r > 0 ? 1 : -1;
186 for (e1 = s1; (*e1 >= 'a' && *e1 <= 'z') || (*e1 >= 'A' && *e1 <= 'Z'); )
188 for (e2 = s2; (*e2 >= 'a' && *e2 <= 'z') || (*e2 >= 'A' && *e2 <= 'Z'); )
190 r = (e1 - s1) - (e2 - s2);
193 r = strncmp(s1, s2, e2 - s2);
194 return r >= 0 ? 1 : -1;
198 r = strncmp(s1, s2, e1 - s1);
199 return r <= 0 ? -1 : 1;
201 r = strncmp(s1, s2, e1 - s1);
203 return r > 0 ? 1 : -1;
208 return s1 < q1 ? 1 : s2 < q2 ? -1 : 0;
213 #if defined(HAIKU) || defined(MULTI_SEMANTICS)
216 solv_cmp_version_part_haiku(const char *s1, const char *q1, const char *s2,
219 while (s1 < q1 && s2 < q2)
222 const char *part1 = s1, *part2 = s2;
224 /* compare non-number part */
225 while (s1 < q1 && !isdigit(*s1))
227 while (s2 < q2 && !isdigit(*s2))
237 cmp = strncmp(part1, part2, len1 < len2 ? len1 : len2);
243 else if (part2 != s2)
246 /* compare number part */
250 while (s1 < q1 && isdigit(*s1))
252 while (s2 < q2 && isdigit(*s2))
255 while (part1 + 1 < s1 && *part1 == '0')
257 while (part2 + 1 < s2 && *part2 == '0')
267 cmp = strncmp(part1, part2, len1);
272 return s1 < q1 ? 1 : s2 < q2 ? -1 : 0;
276 solv_vercmp_haiku(const char *s1, const char *q1, const char *s2, const char *q2)
278 const char *pre1 = s1;
279 const char *pre2 = s2;
282 /* find pre-release separator */
283 while (pre1 != q1 && *pre1 != '~')
285 while (pre2 != q2 && *pre2 != '~')
288 /* compare main versions */
289 cmp = solv_cmp_version_part_haiku(s1, pre1, s2, pre2);
291 return cmp < 0 ? -1 : 1; /* must return -1, 0, or 1 */
293 /* main versions are equal -- compare pre-release (none is greatest) */
295 return pre2 == q2 ? 0 : 1;
299 cmp = solv_cmp_version_part_haiku(pre1 + 1, q1, pre2 + 1, q2);
300 return cmp == 0 ? 0 : cmp < 0 ? -1 : 1; /* must return -1, 0, or 1 */
307 * the solv_vercmp variant your system uses.
310 solv_vercmp(const char *s1, const char *q1, const char *s2, const char *q2)
313 return solv_vercmp_deb(s1, q1, s2, q2);
314 #elif defined(ARCHLINUX)
315 return solv_vercmp_rpm_notilde(s1, q1, s2, q2);
317 return solv_vercmp_haiku(s1, q1, s2, q2);
319 return solv_vercmp_rpm(s1, q1, s2, q2);
323 #if defined(MULTI_SEMANTICS)
324 # define solv_vercmp (*(pool->disttype == DISTTYPE_DEB ? &solv_vercmp_deb : \
325 pool->disttype == DISTTYPE_HAIKU ? solv_vercmp_haiku : \
327 #elif defined(DEBIAN)
328 # define solv_vercmp solv_vercmp_deb
329 #elif defined(ARCHLINUX)
330 # define solv_vercmp solv_vercmp_rpm_notilde
332 # define solv_vercmp solv_vercmp_haiku
334 # define solv_vercmp solv_vercmp_rpm
337 /* edition (e:v-r) compare */
339 pool_evrcmp_str(const Pool *pool, const char *evr1, const char *evr2, int mode)
349 POOL_DEBUG(DEBUG_EVRCMP, "evrcmp %s %s mode=%d\n", evr1, evr2, mode);
351 for (s1 = evr1; *s1 >= '0' && *s1 <= '9'; s1++)
353 for (s2 = evr2; *s2 >= '0' && *s2 <= '9'; s2++)
355 if (mode == EVRCMP_MATCH && (*evr1 == ':' || *evr2 == ':'))
357 /* empty epoch, skip epoch check */
366 /* compare the epoch */
367 if (s1 == evr1 || *s1 != ':')
369 if (s2 == evr2 || *s2 != ':')
373 r = solv_vercmp(evr1, s1, evr2, s2);
381 if (!pool->promoteepoch)
399 /* same epoch, now split into version/release */
400 for (s1 = evr1, r1 = 0; *s1; s1++)
403 for (s2 = evr2, r2 = 0; *s2; s2++)
407 if (mode != EVRCMP_MATCH || (evr1 != (r1 ? r1 : s1) && evr2 != (r2 ? r2 : s2)))
408 r = solv_vercmp(evr1, r1 ? r1 : s1, evr2, r2 ? r2 : s2);
412 if (mode == EVRCMP_COMPARE)
419 if (mode == EVRCMP_COMPARE_EVONLY)
421 if (mode == EVRCMP_MATCH_RELEASE)
423 /* rpm treats empty releases as missing, i.e "foo = 4-" is the same as "foo = 4" */
424 if (r1 && r1 + 1 == s1)
426 if (r2 && r2 + 1 == s2)
433 if (mode != EVRCMP_MATCH || (s1 != r1 && s2 != r2))
435 if (pool->havedistepoch)
438 for (d1 = r1; d1 < s1; d1++)
441 for (d2 = r2; d2 < s2; d2++)
444 /* XXX: promote just in one direction? */
445 r = solv_vercmp(r1, d1 ? d1 : s1, r2, d2 ? d2 : s2);
446 if (r == 0 && d1 < s1 && d2 < s2)
447 r = solv_vercmp(d1 + 1, s1, d2 + 1, s2);
450 r = solv_vercmp(r1, s1, r2, s2);
453 else if (mode == EVRCMP_MATCH_RELEASE)
464 pool_evrcmp(const Pool *pool, Id evr1id, Id evr2id, int mode)
466 const char *evr1, *evr2;
467 if (evr1id == evr2id)
469 evr1 = pool_id2str(pool, evr1id);
470 evr2 = pool_id2str(pool, evr2id);
471 return pool_evrcmp_str(pool, evr1, evr2, mode);
475 pool_evrmatch(const Pool *pool, Id evrid, const char *epoch, const char *version, const char *release)
482 evr1 = pool_id2str(pool, evrid);
483 for (s1 = evr1; *s1 >= '0' && *s1 <= '9'; s1++)
485 if (s1 != evr1 && *s1 == ':')
489 r = solv_vercmp(evr1, s1, epoch, epoch + strlen(epoch));
497 while (*epoch == '0')
502 for (s1 = evr1, r1 = 0; *s1; s1++)
507 r = solv_vercmp(evr1, r1 ? r1 : s1, version, version + strlen(version));
515 r = solv_vercmp(r1 + 1, s1, release, release + strlen(release));