while (part1 + 1 < s1 && *part1 == '0')
part1++;
- while (part2 + 1 < s1 && *part2 == '0')
+ while (part2 + 1 < s2 && *part2 == '0')
part2++;
len1 = s1 - part1;
if (pre2 == q2)
return -1;
- return solv_cmp_version_part_haiku(pre1 + 1, q1, pre2 + 1, q2);
+ cmp = solv_cmp_version_part_haiku(pre1 + 1, q1, pre2 + 1, q2);
+ return cmp == 0 ? 0 : cmp < 0 ? -1 : 1; /* must return -1, 0, or 1 */
}
#endif /* HAIKU */
-
-
-/*
+
+
+/*
* the solv_vercmp variant your system uses.
*/
int