naev 0.10.4
semver.c
1/*
2 * semver.c
3 *
4 * Copyright (c) 2015-2017 Tomas Aparicio
5 * MIT licensed
6 */
7
9#include <stdio.h>
10#include <stdlib.h>
11#include <string.h>
14#include "semver.h"
15
16#define SLICE_SIZE 50
17#define DELIMITER "."
18#define PR_DELIMITER "-"
19#define MT_DELIMITER "+"
20#define NUMBERS "0123456789"
21#define ALPHA "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
22#define DELIMITERS DELIMITER PR_DELIMITER MT_DELIMITER
23#define VALID_CHARS NUMBERS ALPHA DELIMITERS
24
25static const size_t MAX_SIZE = sizeof(char) * 255;
26static const int MAX_SAFE_INT = (unsigned int) -1 >> 1;
27
33enum operators {
34 SYMBOL_GT = 0x3e,
35 SYMBOL_LT = 0x3c,
36 SYMBOL_EQ = 0x3d,
37 SYMBOL_TF = 0x7e,
38 SYMBOL_CF = 0x5e
39};
40
45/*
46 * Remove [begin:len-begin] from str by moving len data from begin+len to begin.
47 * If len is negative cut out to the end of the string.
48 */
49static int
50strcut (char *str, int begin, int len) {
51 size_t l;
52 l = strlen(str);
53
54 if((int)l < 0 || (int)l > MAX_SAFE_INT) return -1;
55
56 if (len < 0) len = l - begin + 1;
57 if (begin + len > (int)l) len = l - begin;
58 memmove(str + begin, str + begin + len, l - len + 1 - begin);
59
60 return len;
61}
62
63static int
64contains (const char c, const char *matrix, size_t len) {
65 size_t x;
66 for (x = 0; x < len; x++)
67 if ((char) matrix[x] == c) return 1;
68 return 0;
69}
70
71static int
72has_valid_chars (const char *str, const char *matrix) {
73 size_t i, len, mlen;
74 len = strlen(str);
75 mlen = strlen(matrix);
76
77 for (i = 0; i < len; i++)
78 if (contains(str[i], matrix, mlen) == 0)
79 return 0;
80
81 return 1;
82}
83
84static int
85binary_comparison (int x, int y) {
86 if (x == y) return 0;
87 if (x > y) return 1;
88 return -1;
89}
90
91static int
92parse_int (const char *s) {
93 int valid, num;
94 valid = has_valid_chars(s, NUMBERS);
95 if (valid == 0) return -1;
96
97 num = strtol(s, NULL, 10);
98 if (num > MAX_SAFE_INT) return -1;
99
100 return num;
101}
102
103/*
104 * Return a string allocated on the heap with the content from sep to end and
105 * terminate buf at sep.
106 */
107static char *
108parse_slice (char *buf, char sep) {
109 char *pr, *part;
110 int plen;
111
112 /* Find separator in buf */
113 pr = strchr(buf, sep);
114 if (pr == NULL) return NULL;
115 /* Length from separator to end of buf */
116 plen = strlen(pr);
117
118 /* Copy from buf into new string */
119 part = (char*)calloc(plen + 1, sizeof(*part));
120 if (part == NULL) return NULL;
121 memcpy(part, pr + 1, plen);
122 /* Null terminate new string */
123 part[plen] = '\0';
124
125 /* Terminate buf where separator was */
126 *pr = '\0';
127
128 return part;
129}
130
140int
141semver_parse (const char *str, semver_t *ver) {
142 int valid, res;
143 size_t len;
144 char *buf;
145 valid = semver_is_valid(str);
146 if (!valid) return -1;
147
148 len = strlen(str);
149 buf = (char*)calloc(len + 1, sizeof(*buf));
150 if (buf == NULL) return -1;
151 strcpy(buf, str);
152
153 ver->metadata = parse_slice(buf, MT_DELIMITER[0]);
154 ver->prerelease = parse_slice(buf, PR_DELIMITER[0]);
155
156 res = semver_parse_version(buf, ver);
157 free(buf);
158#if DEBUG > 0
159 //printf("[debug] semver.c %s = %d.%d.%d, %s %s\n", str, ver->major, ver->minor, ver->patch, ver->prerelease, ver->metadata);
160#endif
161 return res;
162}
163
173int
174semver_parse_version (const char *str, semver_t *ver) {
175 size_t len;
176 int index, value;
177 char *slice, *next, *endptr;
178 slice = (char *) str;
179 index = 0;
180
181 while (slice != NULL && index++ < 4) {
182 next = strchr(slice, DELIMITER[0]);
183 if (next == NULL)
184 len = strlen(slice);
185 else
186 len = next - slice;
187 if (len > SLICE_SIZE) return -1;
188
189 /* Cast to integer and store */
190 value = strtol(slice, &endptr, 10);
191 if (endptr != next && *endptr != '\0') return -1;
192
193 switch (index) {
194 case 1: ver->major = value; break;
195 case 2: ver->minor = value; break;
196 case 3: ver->patch = value; break;
197 }
198
199 /* Continue with the next slice */
200 if (next == NULL)
201 slice = NULL;
202 else
203 slice = next + 1;
204 }
205
206 return 0;
207}
208
209static int
210compare_prerelease (char *x, char *y) {
211 char *lastx, *lasty, *xptr, *yptr, *endptr;
212 int xlen, ylen, xisnum, yisnum, xnum, ynum;
213 int xn, yn, min, res;
214 if (x == NULL && y == NULL) return 0;
215 if (y == NULL && x) return -1;
216 if (x == NULL && y) return 1;
217
218 lastx = x;
219 lasty = y;
220 xlen = strlen(x);
221 ylen = strlen(y);
222
223 while (1) {
224 if ((xptr = strchr(lastx, DELIMITER[0])) == NULL)
225 xptr = x + xlen;
226 if ((yptr = strchr(lasty, DELIMITER[0])) == NULL)
227 yptr = y + ylen;
228
229 xnum = strtol(lastx, &endptr, 10);
230 xisnum = endptr == xptr ? 1 : 0;
231 ynum = strtol(lasty, &endptr, 10);
232 yisnum = endptr == yptr ? 1 : 0;
233
234 if (xisnum && !yisnum) return -1;
235 if (!xisnum && yisnum) return 1;
236
237 if (xisnum && yisnum) {
238 /* Numerical comparison */
239 if (xnum != ynum) return xnum < ynum ? -1 : 1;
240 } else {
241 /* String comparison */
242 xn = xptr - lastx;
243 yn = yptr - lasty;
244 min = xn < yn ? xn : yn;
245 if ((res = strncmp(lastx, lasty, min))) return res < 0 ? -1 : 1;
246 if (xn != yn) return xn < yn ? -1 : 1;
247 }
248
249 lastx = xptr + 1;
250 lasty = yptr + 1;
251 if (lastx == x + xlen + 1 && lasty == y + ylen + 1) break;
252 if (lastx == x + xlen + 1) return -1;
253 if (lasty == y + ylen + 1) return 1;
254 }
255
256 return 0;
257}
258
259int
260semver_compare_prerelease (semver_t x, semver_t y) {
261 return compare_prerelease(x.prerelease, y.prerelease);
262}
263
275int
276semver_compare_version (semver_t x, semver_t y) {
277 int res;
278
279 if ((res = binary_comparison(x.major, y.major)) == 0) {
280 if ((res = binary_comparison(x.minor, y.minor)) == 0) {
281 return binary_comparison(x.patch, y.patch);
282 }
283 }
284
285 return res;
286}
287
297int
298semver_compare (semver_t x, semver_t y) {
299 int res;
300
301 if ((res = semver_compare_version(x, y)) == 0) {
302 return semver_compare_prerelease(x, y);
303 }
304
305 return res;
306}
307
312int
313semver_gt (semver_t x, semver_t y) {
314 return semver_compare(x, y) == 1;
315}
316
321int
322semver_lt (semver_t x, semver_t y) {
323 return semver_compare(x, y) == -1;
324}
325
330int
331semver_eq (semver_t x, semver_t y) {
332 return semver_compare(x, y) == 0;
333}
334
339int
340semver_neq (semver_t x, semver_t y) {
341 return semver_compare(x, y) != 0;
342}
343
348int
349semver_gte (semver_t x, semver_t y) {
350 return semver_compare(x, y) >= 0;
351}
352
357int
358semver_lte (semver_t x, semver_t y) {
359 return semver_compare(x, y) <= 0;
360}
361
374int
375semver_satisfies_caret (semver_t x, semver_t y) {
376 /* Major versions must always match. */
377 if (x.major == y.major) {
378 /* If major version is 0, minor versions must match */
379 if (x.major == 0) {
380 /* If minor version is 0, patch must match */
381 if (x.minor == 0){
382 return (x.minor == y.minor) && (x.patch == y.patch);
383 }
384 /* If minor version is not 0, patch must be >= */
385 else if (x.minor == y.minor){
386 return x.patch >= y.patch;
387 }
388 else{
389 return 0;
390 }
391 }
392 else if (x.minor > y.minor){
393 return 1;
394 }
395 else if (x.minor == y.minor)
396 {
397 return x.patch >= y.patch;
398 }
399 else {
400 return 0;
401 }
402 }
403 return 0;
404}
405
418int
419semver_satisfies_patch (semver_t x, semver_t y) {
420 return x.major == y.major
421 && x.minor == y.minor;
422}
423
444int
445semver_satisfies (semver_t x, semver_t y, const char *op) {
446 int first, second;
447 /* Extract the comparison operator */
448 first = op[0];
449 second = op[1];
450
451 /* Caret operator */
452 if (first == SYMBOL_CF)
453 return semver_satisfies_caret(x, y);
454
455 /* Tilde operator */
456 if (first == SYMBOL_TF)
457 return semver_satisfies_patch(x, y);
458
459 /* Strict equality */
460 if (first == SYMBOL_EQ)
461 return semver_eq(x, y);
462
463 /* Greater than or equal comparison */
464 if (first == SYMBOL_GT) {
465 if (second == SYMBOL_EQ) {
466 return semver_gte(x, y);
467 }
468 return semver_gt(x, y);
469 }
470
471 /* Lower than or equal comparison */
472 if (first == SYMBOL_LT) {
473 if (second == SYMBOL_EQ) {
474 return semver_lte(x, y);
475 }
476 return semver_lt(x, y);
477 }
478
479 return 0;
480}
481
488void
489semver_free (semver_t *x) {
490 free(x->metadata);
491 x->metadata = NULL;
492 free(x->prerelease);
493 x->prerelease = NULL;
494}
495
500static void
501concat_num (char * str, int x, char * sep) {
502 char buf[SLICE_SIZE] = {0};
503 if (sep == NULL) sprintf(buf, "%d", x);
504 else sprintf(buf, "%s%d", sep, x);
505 strcat(str, buf);
506}
507
508static void
509concat_char (char * str, char * x, char * sep) {
510 char buf[SLICE_SIZE] = {0};
511 sprintf(buf, "%s%s", sep, x);
512 strcat(str, buf);
513}
514
519void
520semver_render (semver_t *x, char *dest) {
521 concat_num(dest, x->major, NULL);
522 concat_num(dest, x->minor, DELIMITER);
523 concat_num(dest, x->patch, DELIMITER);
524 if (x->prerelease) concat_char(dest, x->prerelease, PR_DELIMITER);
525 if (x->metadata) concat_char(dest, x->metadata, MT_DELIMITER);
526}
527
532void
533semver_bump (semver_t *x) {
534 x->major++;
535}
536
537void
538semver_bump_minor (semver_t *x) {
539 x->minor++;
540}
541
542void
543semver_bump_patch (semver_t *x) {
544 x->patch++;
545}
546
551static int
552has_valid_length (const char *s) {
553 return s != NULL && strlen(s) <= MAX_SIZE;
554}
555
565int
566semver_is_valid (const char *s) {
567 return has_valid_length(s)
568 && has_valid_chars(s, VALID_CHARS);
569}
570
580int
581semver_clean (char *s) {
582 size_t i, len, mlen;
583 int res;
584 if (has_valid_length(s) == 0) return -1;
585
586 len = strlen(s);
587 mlen = strlen(VALID_CHARS);
588
589 for (i = 0; i < len; i++) {
590 if (contains(s[i], VALID_CHARS, mlen) == 0) {
591 res = strcut(s, i, 1);
592 if(res == -1) return -1;
593 --len; --i;
594 }
595 }
596
597 return 0;
598}
599
600static int
601char_to_int (const char * str) {
602 int buf;
603 size_t i,len, mlen;
604 buf = 0;
605 len = strlen(str);
606 mlen = strlen(VALID_CHARS);
607
608 for (i = 0; i < len; i++)
609 if (contains(str[i], VALID_CHARS, mlen))
610 buf += (int) str[i];
611
612 return buf;
613}
614
620int
621semver_numeric (semver_t *x) {
622 int num;
623 char buf[SLICE_SIZE * 3];
624 memset(&buf, 0, SLICE_SIZE * 3);
625
626 if (x->major) concat_num(buf, x->major, NULL);
627 if (x->major || x->minor) concat_num(buf, x->minor, NULL);
628 if (x->major || x->minor || x->patch) concat_num(buf, x->patch, NULL);
629
630 num = parse_int(buf);
631 if(num == -1) return -1;
632
633 if (x->prerelease) num += char_to_int(x->prerelease);
634 if (x->metadata) num += char_to_int(x->metadata);
635
636 return num;
637}
static char buf[NEWS_MAX_LENGTH]
Definition: news.c:45
static const double c[]
Definition: rng.c:264