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"
42 #define MIN_BUFFER_SIZE 64
43 #define DEFAULT_BUFFER_SIZE 4096
44 #define MAX_BUFFER_SIZE 131072
46 static const char *hexdigits
="0123456789abcdef";
48 uint32_t current_phase
=0;
53 struct phase_hook
*next
;
56 static struct phase_hook
*hooks
[NR_PHASES
]={NULL
,};
58 char *safe_strdup(const char *s
, const char *message
)
63 fatal_perror(message
);
68 void *safe_malloc(size_t size
, const char *message
)
73 fatal_perror(message
);
77 void *safe_malloc_ary(size_t size
, size_t count
, const char *message
) {
78 if (count
>= INT_MAX
/size
) {
79 fatal("array allocation overflow: %s", message
);
81 return safe_malloc(size
*count
, message
);
84 /* Convert a buffer into its MP_INT representation */
85 void read_mpbin(MP_INT
*a
, uint8_t *bin
, int binsize
)
90 buff
=safe_malloc(binsize
*2 + 1,"read_mpbin");
92 for (i
=0; i
<binsize
; i
++) {
93 buff
[i
*2]=hexdigits
[(bin
[i
] & 0xf0) >> 4];
94 buff
[i
*2+1]=hexdigits
[(bin
[i
] & 0xf)];
98 mpz_set_str(a
, buff
, 16);
102 /* Convert a MP_INT into a hex string */
103 char *write_mpstring(MP_INT
*a
)
107 buff
=safe_malloc(mpz_sizeinbase(a
,16)+2,"write_mpstring");
108 mpz_get_str(buff
, 16, a
);
112 static uint8_t hexval(uint8_t c
)
141 /* Convert a MP_INT into a buffer; return length; truncate if necessary */
142 int32_t write_mpbin(MP_INT
*a
, uint8_t *buffer
, int32_t buflen
)
147 if (buflen
==0) return 0;
148 hb
=write_mpstring(a
);
153 /* The number starts with a half-byte */
154 buffer
[i
++]=hexval(hb
[j
++]);
156 for (; hb
[j
] && i
<buflen
; i
++) {
157 buffer
[i
]=(hexval(hb
[j
])<<4)|hexval(hb
[j
+1]);
164 static const char *phases
[NR_PHASES
]={
170 "PHASE_GETRESOURCES",
176 void enter_phase(uint32_t new_phase
)
178 struct phase_hook
*i
;
180 if (hooks
[new_phase
])
181 Message(M_DEBUG_PHASE
,"Running hooks for %s...\n", phases
[new_phase
]);
182 current_phase
=new_phase
;
184 for (i
=hooks
[new_phase
]; i
; i
=i
->next
)
185 i
->fn(i
->state
, new_phase
);
186 Message(M_DEBUG_PHASE
,"Now in %s\n",phases
[new_phase
]);
189 bool_t
add_hook(uint32_t phase
, hook_fn
*fn
, void *state
)
191 struct phase_hook
*h
;
193 h
=safe_malloc(sizeof(*h
),"add_hook");
196 h
->next
=hooks
[phase
];
201 bool_t
remove_hook(uint32_t phase
, hook_fn
*fn
, void *state
)
203 fatal("remove_hook: not implemented");
208 void vslilog(struct log_if
*lf
, int priority
, const char *message
, va_list ap
)
210 lf
->vlog(lf
->st
,priority
,message
,ap
);
213 void slilog(struct log_if
*lf
, int priority
, const char *message
, ...)
217 va_start(ap
,message
);
218 vslilog(lf
,priority
,message
,ap
);
224 struct buffer_if ops
;
227 void buffer_assert_free(struct buffer_if
*buffer
, cstring_t file
,
231 fprintf(stderr
,"secnet: BUF_ASSERT_FREE, %s line %d, owned by %s",
232 file
,line
,buffer
->owner
);
233 assert(!"buffer_assert_free failure");
237 void buffer_assert_used(struct buffer_if
*buffer
, cstring_t file
,
241 fprintf(stderr
,"secnet: BUF_ASSERT_USED, %s line %d, last owned by %s",
242 file
,line
,buffer
->owner
);
243 assert(!"buffer_assert_used failure");
247 void buffer_init(struct buffer_if
*buffer
, int32_t max_start_pad
)
249 buffer
->start
=buffer
->base
+max_start_pad
;
253 void *buf_append(struct buffer_if
*buf
, int32_t amount
) {
255 assert(buf
->size
<= buf
->len
- amount
);
256 p
=buf
->start
+ buf
->size
;
261 void *buf_prepend(struct buffer_if
*buf
, int32_t amount
) {
262 assert(amount
<= buf
->start
- buf
->base
);
264 return buf
->start
-=amount
;
267 void *buf_unappend(struct buffer_if
*buf
, int32_t amount
) {
268 if (buf
->size
< amount
) return 0;
269 return buf
->start
+(buf
->size
-=amount
);
272 void *buf_unprepend(struct buffer_if
*buf
, int32_t amount
) {
274 if (buf
->size
< amount
) return 0;
281 /* Append a two-byte length and the string to the buffer. Length is in
282 network byte order. */
283 void buf_append_string(struct buffer_if
*buf
, cstring_t s
)
288 /* fixme: if string is longer than 65535, result is a corrupted packet */
289 buf_append_uint16(buf
,len
);
290 memcpy(buf_append(buf
,len
),s
,len
);
293 void buffer_new(struct buffer_if
*buf
, int32_t len
)
303 buf
->base
=safe_malloc(len
,"buffer_new");
306 void buffer_readonly_view(struct buffer_if
*buf
, const void *data
, int32_t len
)
309 buf
->owner
="READONLY";
313 buf
->size
=buf
->len
=len
;
314 buf
->base
=buf
->start
=(uint8_t*)data
;
317 void buffer_readonly_clone(struct buffer_if
*out
, const struct buffer_if
*in
)
319 buffer_readonly_view(out
,in
->start
,in
->size
);
322 void buffer_copy(struct buffer_if
*dst
, const struct buffer_if
*src
)
324 if (dst
->len
< src
->len
) {
325 dst
->base
=realloc(dst
->base
,src
->len
);
326 if (!dst
->base
) fatal_perror("buffer_copy");
329 dst
->start
= dst
->base
+ (src
->start
- src
->base
);
330 dst
->size
= src
->size
;
331 memcpy(dst
->start
, src
->start
, dst
->size
);
334 static list_t
*buffer_apply(closure_t
*self
, struct cloc loc
, dict_t
*context
,
340 bool_t lockdown
=False
;
341 uint32_t len
=DEFAULT_BUFFER_SIZE
;
343 st
=safe_malloc(sizeof(*st
),"buffer_apply");
344 st
->cl
.description
="buffer";
345 st
->cl
.type
=CL_BUFFER
;
347 st
->cl
.interface
=&st
->ops
;
349 /* First argument, if present, is buffer length */
350 item
=list_elem(args
,0);
352 if (item
->type
!=t_number
) {
353 cfgfatal(st
->ops
.loc
,"buffer","first parameter must be a "
354 "number (buffer size)\n");
356 len
=item
->data
.number
;
357 if (len
<MIN_BUFFER_SIZE
) {
358 cfgfatal(st
->ops
.loc
,"buffer","ludicrously small buffer size\n");
360 if (len
>MAX_BUFFER_SIZE
) {
361 cfgfatal(st
->ops
.loc
,"buffer","ludicrously large buffer size\n");
364 /* Second argument, if present, is a dictionary */
365 item
=list_elem(args
,1);
367 if (item
->type
!=t_dict
) {
368 cfgfatal(st
->ops
.loc
,"buffer","second parameter must be a "
371 dict
=item
->data
.dict
;
372 lockdown
=dict_read_bool(dict
,"lockdown",False
,"buffer",st
->ops
.loc
,
376 buffer_new(&st
->ops
,len
);
378 /* XXX mlock the buffer if possible */
381 return new_closure(&st
->cl
);
384 int consttime_memeq(const void *s1in
, const void *s2in
, size_t n
)
386 const uint8_t *s1
=s1in
, *s2
=s2in
;
387 register volatile uint8_t accumulator
=0;
390 accumulator
|= (*s1
++ ^ *s2
++);
392 accumulator
|= accumulator
>> 4; /* constant-time */
393 accumulator
|= accumulator
>> 2; /* boolean canonicalisation */
394 accumulator
|= accumulator
>> 1;
400 void util_module(dict_t
*dict
)
402 add_closure(dict
,"sysbuffer",buffer_apply
);