3 * - output and logging support
4 * - program lifetime support
5 * - IP address and subnet munging routines
6 * - MPI convenience functions
10 * Copyright (C) 1995--2001 Stephen Early <steve@greenend.org.uk>
12 * It is part of secnet, which is
13 * Copyright (C) 1995--2001 Stephen Early <steve@greenend.org.uk>
14 * Copyright (C) 1998 Ross Anderson, Eli Biham, Lars Knudsen
16 * This program is free software; you can redistribute it and/or modify
17 * it under the terms of the GNU General Public License as published by
18 * the Free Software Foundation; either version 2, or (at your option)
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 * GNU General Public License for more details.
26 * You should have received a copy of the GNU General Public License
27 * along with this program; if not, write to the Free Software Foundation,
28 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
40 #include "unaligned.h"
43 #define MIN_BUFFER_SIZE 64
44 #define DEFAULT_BUFFER_SIZE 4096
45 #define MAX_BUFFER_SIZE 131072
47 static const char *hexdigits="0123456789abcdef";
49 uint32_t current_phase=0;
54 struct phase_hook *next;
57 static struct phase_hook *hooks[NR_PHASES]={NULL,};
59 char *safe_strdup(const char *s, const char *message)
64 fatal_perror("%s",message);
69 void *safe_malloc(size_t size, const char *message)
74 fatal_perror("%s",message);
78 void *safe_malloc_ary(size_t size, size_t count, const char *message) {
79 if (count >= INT_MAX/size) {
80 fatal("array allocation overflow: %s", message);
82 return safe_malloc(size*count, message);
85 /* Convert a buffer into its MP_INT representation */
86 void read_mpbin(MP_INT *a, uint8_t *bin, int binsize)
91 buff=safe_malloc(binsize*2 + 1,"read_mpbin");
93 for (i=0; i<binsize; i++) {
94 buff[i*2]=hexdigits[(bin[i] & 0xf0) >> 4];
95 buff[i*2+1]=hexdigits[(bin[i] & 0xf)];
99 mpz_set_str(a, buff, 16);
103 /* Convert a MP_INT into a hex string */
104 char *write_mpstring(MP_INT *a)
108 buff=safe_malloc(mpz_sizeinbase(a,16)+2,"write_mpstring");
109 mpz_get_str(buff, 16, a);
113 static uint8_t hexval(uint8_t c)
142 /* Convert a MP_INT into a buffer; return length; truncate if necessary */
143 int32_t write_mpbin(MP_INT *a, uint8_t *buffer, int32_t buflen)
148 if (buflen==0) return 0;
149 hb=write_mpstring(a);
154 /* The number starts with a half-byte */
155 buffer[i++]=hexval(hb[j++]);
157 for (; hb[j] && i<buflen; i++) {
158 buffer[i]=(hexval(hb[j])<<4)|hexval(hb[j+1]);
165 static const char *phases[NR_PHASES]={
171 "PHASE_GETRESOURCES",
177 void enter_phase(uint32_t new_phase)
179 struct phase_hook *i;
181 if (hooks[new_phase])
182 Message(M_DEBUG_PHASE,"Running hooks for %s...\n", phases[new_phase]);
183 current_phase=new_phase;
185 for (i=hooks[new_phase]; i; i=i->next)
186 i->fn(i->state, new_phase);
187 Message(M_DEBUG_PHASE,"Now in %s\n",phases[new_phase]);
190 bool_t add_hook(uint32_t phase, hook_fn *fn, void *state)
192 struct phase_hook *h;
194 h=safe_malloc(sizeof(*h),"add_hook");
197 h->next=hooks[phase];
202 bool_t remove_hook(uint32_t phase, hook_fn *fn, void *state)
204 fatal("remove_hook: not implemented");
209 void vslilog(struct log_if *lf, int priority, const char *message, va_list ap)
211 lf->vlogfn(lf->st,priority,message,ap);
214 void slilog(struct log_if *lf, int priority, const char *message, ...)
218 va_start(ap,message);
219 vslilog(lf,priority,message,ap);
225 struct buffer_if ops;
228 void buffer_assert_free(struct buffer_if *buffer, cstring_t file,
232 fprintf(stderr,"secnet: BUF_ASSERT_FREE, %s line %d, owned by %s",
233 file,line,buffer->owner);
234 assert(!"buffer_assert_free failure");
238 void buffer_assert_used(struct buffer_if *buffer, cstring_t file,
242 fprintf(stderr,"secnet: BUF_ASSERT_USED, %s line %d, last owned by %s",
243 file,line,buffer->owner);
244 assert(!"buffer_assert_used failure");
248 void buffer_init(struct buffer_if *buffer, int32_t max_start_pad)
250 assert(max_start_pad<=buffer->len);
251 buffer->start=buffer->base+max_start_pad;
255 void *buf_append(struct buffer_if *buf, int32_t amount) {
257 assert(buf->size <= buf->len - amount);
258 p=buf->start + buf->size;
263 void *buf_prepend(struct buffer_if *buf, int32_t amount) {
264 assert(amount <= buf->start - buf->base);
266 return buf->start-=amount;
269 void *buf_unappend(struct buffer_if *buf, int32_t amount) {
270 if (buf->size < amount) return 0;
271 return buf->start+(buf->size-=amount);
274 void *buf_unprepend(struct buffer_if *buf, int32_t amount) {
276 if (buf->size < amount) return 0;
283 /* Append a two-byte length and the string to the buffer. Length is in
284 network byte order. */
285 void buf_append_string(struct buffer_if *buf, cstring_t s)
290 /* fixme: if string is longer than 65535, result is a corrupted packet */
291 buf_append_uint16(buf,len);
292 memcpy(buf_append(buf,len),s,len);
295 void buffer_new(struct buffer_if *buf, int32_t len)
305 buf->base=safe_malloc(len,"buffer_new");
308 void buffer_readonly_view(struct buffer_if *buf, const void *data, int32_t len)
311 buf->owner="READONLY";
315 buf->size=buf->len=len;
316 buf->base=buf->start=(uint8_t*)data;
319 void buffer_readonly_clone(struct buffer_if *out, const struct buffer_if *in)
321 buffer_readonly_view(out,in->start,in->size);
324 void buffer_copy(struct buffer_if *dst, const struct buffer_if *src)
326 if (dst->len < src->len) {
327 dst->base=realloc(dst->base,src->len);
328 if (!dst->base) fatal_perror("buffer_copy");
331 dst->start = dst->base + (src->start - src->base);
332 dst->size = src->size;
333 memcpy(dst->start, src->start, dst->size);
336 static list_t *buffer_apply(closure_t *self, struct cloc loc, dict_t *context,
342 bool_t lockdown=False;
343 uint32_t len=DEFAULT_BUFFER_SIZE;
345 st=safe_malloc(sizeof(*st),"buffer_apply");
346 st->cl.description="buffer";
347 st->cl.type=CL_BUFFER;
349 st->cl.interface=&st->ops;
351 /* First argument, if present, is buffer length */
352 item=list_elem(args,0);
354 if (item->type!=t_number) {
355 cfgfatal(st->ops.loc,"buffer","first parameter must be a "
356 "number (buffer size)\n");
358 len=item->data.number;
359 if (len<MIN_BUFFER_SIZE) {
360 cfgfatal(st->ops.loc,"buffer","ludicrously small buffer size\n");
362 if (len>MAX_BUFFER_SIZE) {
363 cfgfatal(st->ops.loc,"buffer","ludicrously large buffer size\n");
366 /* Second argument, if present, is a dictionary */
367 item=list_elem(args,1);
369 if (item->type!=t_dict) {
370 cfgfatal(st->ops.loc,"buffer","second parameter must be a "
373 dict=item->data.dict;
374 lockdown=dict_read_bool(dict,"lockdown",False,"buffer",st->ops.loc,
378 buffer_new(&st->ops,len);
380 /* XXX mlock the buffer if possible */
383 return new_closure(&st->cl);
386 void send_nak(const struct comm_addr *dest, uint32_t our_index,
387 uint32_t their_index, uint32_t msgtype,
388 struct buffer_if *buf, const char *logwhy)
390 buffer_init(buf,calculate_max_start_pad());
391 buf_append_uint32(buf,their_index);
392 buf_append_uint32(buf,our_index);
393 buf_append_uint32(buf,LABEL_NAK);
395 Message(M_INFO,"%s: %08"PRIx32"<-%08"PRIx32": %08"PRIx32":"
396 " %s; sending NAK\n",
397 dest->comm->addr_to_string(dest->comm->st,dest),
398 our_index, their_index, msgtype, logwhy);
399 dest->comm->sendmsg(dest->comm->st, buf, dest);
402 int consttime_memeq(const void *s1in, const void *s2in, size_t n)
404 const uint8_t *s1=s1in, *s2=s2in;
405 register volatile uint8_t accumulator=0;
408 accumulator |= (*s1++ ^ *s2++);
410 accumulator |= accumulator >> 4; /* constant-time */
411 accumulator |= accumulator >> 2; /* boolean canonicalisation */
412 accumulator |= accumulator >> 1;
418 void util_module(dict_t *dict)
420 add_closure(dict,"sysbuffer",buffer_apply);
423 void update_max_start_pad(int32_t *our_module_global, int32_t our_instance)
425 if (*our_module_global < our_instance)
426 *our_module_global=our_instance;
429 int32_t transform_max_start_pad, comm_max_start_pad;
431 int32_t calculate_max_start_pad(void)
435 transform_max_start_pad +