5 * Various handy server-only utilities
7 * (c) 2001 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Trivial IP Encryption (TrIPE).
14 * TrIPE is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation; either version 2 of the License, or
17 * (at your option) any later version.
19 * TrIPE is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with TrIPE; if not, write to the Free Software Foundation,
26 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 /*----- Header files ------------------------------------------------------*/
33 /*----- Global variables --------------------------------------------------*/
35 octet buf_i
[PKBUFSZ
], buf_o
[PKBUFSZ
], buf_t
[PKBUFSZ
];
37 /*----- Main code ---------------------------------------------------------*/
41 * Arguments: @mp *m@ = a multiprecision integer
43 * Returns: A pointer to the integer's textual representation.
45 * Use: Converts a multiprecision integer to a string. Corrupts
49 const char *mpstr(mp
*m
)
51 if (mp_writestring(m
, (char *)buf_t
, sizeof(buf_t
), 10))
53 return ((const char *)buf_t
);
58 * Arguments: @group *g@ = a group
59 * @ge *x@ = a group element
61 * Returns: A pointer to the element's textual representation.
63 * Use: Converts a group element to a string. Corrupts
67 const char *gestr(group
*g
, ge
*x
)
69 if (group_writestring(g
, x
, (char *)buf_t
, sizeof(buf_t
)))
71 return ((const char *)buf_t
);
74 /* --- @timestr@ --- *
76 * Arguments: @time_t t@ = a time to convert
78 * Returns: A pointer to a textual representation of the time.
80 * Use: Converts a time to a textual representation. Corrupts
84 const char *timestr(time_t t
)
90 strftime((char *)buf_t
, sizeof(buf_t
), "%Y-%m-%dT%H:%M:%S", tm
);
91 return ((const char *)buf_t
);
94 /* --- @seq_reset@ --- *
96 * Arguments: @seqwin *s@ = sequence-checking window
100 * Use: Resets a sequence number window.
103 void seq_reset(seqwin
*s
) { s
->seq
= 0; s
->win
= 0; }
105 /* --- @seq_check@ --- *
107 * Arguments: @seqwin *s@ = sequence-checking window
108 * @uint32 q@ = sequence number to check
109 * @const char *service@ = service to report message from
111 * Returns: Zero on success, nonzero if the sequence number was bad.
113 * Use: Checks a sequence number against the window, updating things
117 int seq_check(seqwin
*s
, uint32 q
, const char *service
)
123 a_warn(service
, "replay", "old-sequence", A_END
);
126 if (q
>= s
->seq
+ SEQ_WINSZ
) {
127 n
= q
- (s
->seq
+ SEQ_WINSZ
- 1);
134 qbit
= 1 << (q
- s
->seq
);
136 a_warn(service
, "replay", "duplicated-sequence", A_END
);
143 /* --- @versioncmp@ --- *
145 * Arguments: @const char *va, *vb@ = two version strings
147 * Returns: Less than, equal to, or greater than zero, according to
148 * whether @va@ is less than, equal to, or greater than @vb@.
150 * Use: Compares version number strings.
152 * The algorithm is an extension of the Debian version
153 * comparison algorithm. A version number consists of three
156 * [EPOCH :] MAIN [- SUB]
158 * The MAIN part may contain colons or hyphens if there is an
159 * EPOCH or SUB, respectively. Version strings are compared
160 * componentwise: first epochs, then main parts, and finally
163 * The component comparison is done as follows. First, the
164 * initial subsequence of nondigit characters is extracted from
165 * each string, and these are compared lexicographically, using
166 * ASCII ordering, except that letters precede non-letters. If
167 * both are the same, an initial sequence of digits is extracted
168 * from the remaining parts of the version strings, and these
169 * are compared numerically (an empty sequence being considered
170 * to have the value zero). This process is repeated until we
171 * have a winner or until both strings are exhausted.
180 static int vint(const char **vv
, const char *vl
)
188 if (!isdigit((unsigned char)ch
))
191 n
= n
* 10 + (ch
- '0');
197 static const char *vchr(const char **vv
, const char *vl
)
205 if (isdigit((unsigned char)ch
))
213 #define CMP(x, y) ((x) < (y) ? -1 : +1)
215 static int vcmp(const char *va
, const char *val
,
216 const char *vb
, const char *vbl
)
223 /* --- See if we're done --- */
225 if (va
== val
&& vb
== vbl
)
228 /* --- Compare nondigit portions --- */
230 pa
= vchr(&va
, val
); pb
= vchr(&vb
, vbl
);
232 if (pa
== va
&& pb
== vb
)
238 else if (*pa
== *pb
) {
241 } else if (isalpha((unsigned char)*pa
) == isalpha((unsigned char)*pb
))
242 return (CMP(*pa
, *pb
));
243 else if (isalpha((unsigned char)*pa
))
249 /* --- Compare digit portions --- */
251 ia
= vint(&va
, val
); ib
= vint(&vb
, vbl
);
253 return (CMP(ia
, ib
));
257 static void vsplit(const char *v
, struct vinfo
*vi
)
262 if ((p
= strchr(v
, ':')) == 0)
271 if ((p
= strrchr(v
, '-')) == 0)
283 int versioncmp(const char *va
, const char *vb
)
285 struct vinfo via
, vib
;
288 vsplit(va
, &via
); vsplit(vb
, &vib
);
289 if ((rc
= vcmp(via
.e
, via
.el
, vib
.e
, vib
.el
)) != 0 ||
290 (rc
= vcmp(via
.m
, via
.ml
, vib
.m
, vib
.ml
)) != 0 ||
291 (rc
= vcmp(via
.s
, via
.sl
, vib
.s
, vib
.sl
)) != 0)
296 /*----- That's all, folks -------------------------------------------------*/