diff options
author | djm <> | 2008-09-06 12:17:54 +0000 |
---|---|---|
committer | djm <> | 2008-09-06 12:17:54 +0000 |
commit | 38ce604e3cc97706b876b0525ddff0121115456d (patch) | |
tree | 7ccc28afe1789ea3dbedf72365f955d5b8e105b5 /src/lib/libcrypto/bn/bn_ctx.c | |
parent | 12867252827c8efaa8ddd1fa3b3d6e321e2bcdef (diff) | |
download | openbsd-38ce604e3cc97706b876b0525ddff0121115456d.tar.gz openbsd-38ce604e3cc97706b876b0525ddff0121115456d.tar.bz2 openbsd-38ce604e3cc97706b876b0525ddff0121115456d.zip |
resolve conflicts
Diffstat (limited to 'src/lib/libcrypto/bn/bn_ctx.c')
-rw-r--r-- | src/lib/libcrypto/bn/bn_ctx.c | 417 |
1 files changed, 358 insertions, 59 deletions
diff --git a/src/lib/libcrypto/bn/bn_ctx.c b/src/lib/libcrypto/bn/bn_ctx.c index 7daf19eb84..b3452f1a91 100644 --- a/src/lib/libcrypto/bn/bn_ctx.c +++ b/src/lib/libcrypto/bn/bn_ctx.c | |||
@@ -1,7 +1,7 @@ | |||
1 | /* crypto/bn/bn_ctx.c */ | 1 | /* crypto/bn/bn_ctx.c */ |
2 | /* Written by Ulf Moeller for the OpenSSL project. */ | 2 | /* Written by Ulf Moeller for the OpenSSL project. */ |
3 | /* ==================================================================== | 3 | /* ==================================================================== |
4 | * Copyright (c) 1998-2000 The OpenSSL Project. All rights reserved. | 4 | * Copyright (c) 1998-2004 The OpenSSL Project. All rights reserved. |
5 | * | 5 | * |
6 | * Redistribution and use in source and binary forms, with or without | 6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions | 7 | * modification, are permitted provided that the following conditions |
@@ -54,9 +54,10 @@ | |||
54 | * | 54 | * |
55 | */ | 55 | */ |
56 | 56 | ||
57 | #ifndef BN_CTX_DEBUG | 57 | #if !defined(BN_CTX_DEBUG) && !defined(BN_DEBUG) |
58 | # undef NDEBUG /* avoid conflicting definitions */ | 58 | #ifndef NDEBUG |
59 | # define NDEBUG | 59 | #define NDEBUG |
60 | #endif | ||
60 | #endif | 61 | #endif |
61 | 62 | ||
62 | #include <stdio.h> | 63 | #include <stdio.h> |
@@ -65,91 +66,389 @@ | |||
65 | #include "cryptlib.h" | 66 | #include "cryptlib.h" |
66 | #include "bn_lcl.h" | 67 | #include "bn_lcl.h" |
67 | 68 | ||
69 | /* TODO list | ||
70 | * | ||
71 | * 1. Check a bunch of "(words+1)" type hacks in various bignum functions and | ||
72 | * check they can be safely removed. | ||
73 | * - Check +1 and other ugliness in BN_from_montgomery() | ||
74 | * | ||
75 | * 2. Consider allowing a BN_new_ex() that, at least, lets you specify an | ||
76 | * appropriate 'block' size that will be honoured by bn_expand_internal() to | ||
77 | * prevent piddly little reallocations. OTOH, profiling bignum expansions in | ||
78 | * BN_CTX doesn't show this to be a big issue. | ||
79 | */ | ||
80 | |||
81 | /* How many bignums are in each "pool item"; */ | ||
82 | #define BN_CTX_POOL_SIZE 16 | ||
83 | /* The stack frame info is resizing, set a first-time expansion size; */ | ||
84 | #define BN_CTX_START_FRAMES 32 | ||
68 | 85 | ||
69 | BN_CTX *BN_CTX_new(void) | 86 | /***********/ |
87 | /* BN_POOL */ | ||
88 | /***********/ | ||
89 | |||
90 | /* A bundle of bignums that can be linked with other bundles */ | ||
91 | typedef struct bignum_pool_item | ||
92 | { | ||
93 | /* The bignum values */ | ||
94 | BIGNUM vals[BN_CTX_POOL_SIZE]; | ||
95 | /* Linked-list admin */ | ||
96 | struct bignum_pool_item *prev, *next; | ||
97 | } BN_POOL_ITEM; | ||
98 | /* A linked-list of bignums grouped in bundles */ | ||
99 | typedef struct bignum_pool | ||
100 | { | ||
101 | /* Linked-list admin */ | ||
102 | BN_POOL_ITEM *head, *current, *tail; | ||
103 | /* Stack depth and allocation size */ | ||
104 | unsigned used, size; | ||
105 | } BN_POOL; | ||
106 | static void BN_POOL_init(BN_POOL *); | ||
107 | static void BN_POOL_finish(BN_POOL *); | ||
108 | #ifndef OPENSSL_NO_DEPRECATED | ||
109 | static void BN_POOL_reset(BN_POOL *); | ||
110 | #endif | ||
111 | static BIGNUM * BN_POOL_get(BN_POOL *); | ||
112 | static void BN_POOL_release(BN_POOL *, unsigned int); | ||
113 | |||
114 | /************/ | ||
115 | /* BN_STACK */ | ||
116 | /************/ | ||
117 | |||
118 | /* A wrapper to manage the "stack frames" */ | ||
119 | typedef struct bignum_ctx_stack | ||
70 | { | 120 | { |
71 | BN_CTX *ret; | 121 | /* Array of indexes into the bignum stack */ |
122 | unsigned int *indexes; | ||
123 | /* Number of stack frames, and the size of the allocated array */ | ||
124 | unsigned int depth, size; | ||
125 | } BN_STACK; | ||
126 | static void BN_STACK_init(BN_STACK *); | ||
127 | static void BN_STACK_finish(BN_STACK *); | ||
128 | #ifndef OPENSSL_NO_DEPRECATED | ||
129 | static void BN_STACK_reset(BN_STACK *); | ||
130 | #endif | ||
131 | static int BN_STACK_push(BN_STACK *, unsigned int); | ||
132 | static unsigned int BN_STACK_pop(BN_STACK *); | ||
133 | |||
134 | /**********/ | ||
135 | /* BN_CTX */ | ||
136 | /**********/ | ||
137 | |||
138 | /* The opaque BN_CTX type */ | ||
139 | struct bignum_ctx | ||
140 | { | ||
141 | /* The bignum bundles */ | ||
142 | BN_POOL pool; | ||
143 | /* The "stack frames", if you will */ | ||
144 | BN_STACK stack; | ||
145 | /* The number of bignums currently assigned */ | ||
146 | unsigned int used; | ||
147 | /* Depth of stack overflow */ | ||
148 | int err_stack; | ||
149 | /* Block "gets" until an "end" (compatibility behaviour) */ | ||
150 | int too_many; | ||
151 | }; | ||
72 | 152 | ||
73 | ret=(BN_CTX *)OPENSSL_malloc(sizeof(BN_CTX)); | 153 | /* Enable this to find BN_CTX bugs */ |
74 | if (ret == NULL) | 154 | #ifdef BN_CTX_DEBUG |
155 | static const char *ctxdbg_cur = NULL; | ||
156 | static void ctxdbg(BN_CTX *ctx) | ||
157 | { | ||
158 | unsigned int bnidx = 0, fpidx = 0; | ||
159 | BN_POOL_ITEM *item = ctx->pool.head; | ||
160 | BN_STACK *stack = &ctx->stack; | ||
161 | fprintf(stderr,"(%08x): ", (unsigned int)ctx); | ||
162 | while(bnidx < ctx->used) | ||
75 | { | 163 | { |
76 | BNerr(BN_F_BN_CTX_NEW,ERR_R_MALLOC_FAILURE); | 164 | fprintf(stderr,"%02x ", item->vals[bnidx++ % BN_CTX_POOL_SIZE].dmax); |
77 | return(NULL); | 165 | if(!(bnidx % BN_CTX_POOL_SIZE)) |
166 | item = item->next; | ||
78 | } | 167 | } |
79 | 168 | fprintf(stderr,"\n"); | |
80 | BN_CTX_init(ret); | 169 | bnidx = 0; |
81 | ret->flags=BN_FLG_MALLOCED; | 170 | fprintf(stderr," : "); |
82 | return(ret); | 171 | while(fpidx < stack->depth) |
172 | { | ||
173 | while(bnidx++ < stack->indexes[fpidx]) | ||
174 | fprintf(stderr," "); | ||
175 | fprintf(stderr,"^^ "); | ||
176 | bnidx++; | ||
177 | fpidx++; | ||
178 | } | ||
179 | fprintf(stderr,"\n"); | ||
83 | } | 180 | } |
181 | #define CTXDBG_ENTRY(str, ctx) do { \ | ||
182 | ctxdbg_cur = (str); \ | ||
183 | fprintf(stderr,"Starting %s\n", ctxdbg_cur); \ | ||
184 | ctxdbg(ctx); \ | ||
185 | } while(0) | ||
186 | #define CTXDBG_EXIT(ctx) do { \ | ||
187 | fprintf(stderr,"Ending %s\n", ctxdbg_cur); \ | ||
188 | ctxdbg(ctx); \ | ||
189 | } while(0) | ||
190 | #define CTXDBG_RET(ctx,ret) | ||
191 | #else | ||
192 | #define CTXDBG_ENTRY(str, ctx) | ||
193 | #define CTXDBG_EXIT(ctx) | ||
194 | #define CTXDBG_RET(ctx,ret) | ||
195 | #endif | ||
84 | 196 | ||
197 | /* This function is an evil legacy and should not be used. This implementation | ||
198 | * is WYSIWYG, though I've done my best. */ | ||
199 | #ifndef OPENSSL_NO_DEPRECATED | ||
85 | void BN_CTX_init(BN_CTX *ctx) | 200 | void BN_CTX_init(BN_CTX *ctx) |
86 | { | 201 | { |
87 | #if 0 /* explicit version */ | 202 | /* Assume the caller obtained the context via BN_CTX_new() and so is |
88 | int i; | 203 | * trying to reset it for use. Nothing else makes sense, least of all |
89 | ctx->tos = 0; | 204 | * binary compatibility from a time when they could declare a static |
90 | ctx->flags = 0; | 205 | * variable. */ |
91 | ctx->depth = 0; | 206 | BN_POOL_reset(&ctx->pool); |
207 | BN_STACK_reset(&ctx->stack); | ||
208 | ctx->used = 0; | ||
209 | ctx->err_stack = 0; | ||
92 | ctx->too_many = 0; | 210 | ctx->too_many = 0; |
93 | for (i = 0; i < BN_CTX_NUM; i++) | 211 | } |
94 | BN_init(&(ctx->bn[i])); | ||
95 | #else | ||
96 | memset(ctx, 0, sizeof *ctx); | ||
97 | #endif | 212 | #endif |
213 | |||
214 | BN_CTX *BN_CTX_new(void) | ||
215 | { | ||
216 | BN_CTX *ret = OPENSSL_malloc(sizeof(BN_CTX)); | ||
217 | if(!ret) | ||
218 | { | ||
219 | BNerr(BN_F_BN_CTX_NEW,ERR_R_MALLOC_FAILURE); | ||
220 | return NULL; | ||
221 | } | ||
222 | /* Initialise the structure */ | ||
223 | BN_POOL_init(&ret->pool); | ||
224 | BN_STACK_init(&ret->stack); | ||
225 | ret->used = 0; | ||
226 | ret->err_stack = 0; | ||
227 | ret->too_many = 0; | ||
228 | return ret; | ||
98 | } | 229 | } |
99 | 230 | ||
100 | void BN_CTX_free(BN_CTX *ctx) | 231 | void BN_CTX_free(BN_CTX *ctx) |
101 | { | 232 | { |
102 | int i; | 233 | if (ctx == NULL) |
103 | 234 | return; | |
104 | if (ctx == NULL) return; | 235 | #ifdef BN_CTX_DEBUG |
105 | assert(ctx->depth == 0); | 236 | { |
106 | 237 | BN_POOL_ITEM *pool = ctx->pool.head; | |
107 | for (i=0; i < BN_CTX_NUM; i++) | 238 | fprintf(stderr,"BN_CTX_free, stack-size=%d, pool-bignums=%d\n", |
108 | BN_clear_free(&(ctx->bn[i])); | 239 | ctx->stack.size, ctx->pool.size); |
109 | if (ctx->flags & BN_FLG_MALLOCED) | 240 | fprintf(stderr,"dmaxs: "); |
110 | OPENSSL_free(ctx); | 241 | while(pool) { |
242 | unsigned loop = 0; | ||
243 | while(loop < BN_CTX_POOL_SIZE) | ||
244 | fprintf(stderr,"%02x ", pool->vals[loop++].dmax); | ||
245 | pool = pool->next; | ||
246 | } | ||
247 | fprintf(stderr,"\n"); | ||
248 | } | ||
249 | #endif | ||
250 | BN_STACK_finish(&ctx->stack); | ||
251 | BN_POOL_finish(&ctx->pool); | ||
252 | OPENSSL_free(ctx); | ||
111 | } | 253 | } |
112 | 254 | ||
113 | void BN_CTX_start(BN_CTX *ctx) | 255 | void BN_CTX_start(BN_CTX *ctx) |
114 | { | 256 | { |
115 | if (ctx->depth < BN_CTX_NUM_POS) | 257 | CTXDBG_ENTRY("BN_CTX_start", ctx); |
116 | ctx->pos[ctx->depth] = ctx->tos; | 258 | /* If we're already overflowing ... */ |
117 | ctx->depth++; | 259 | if(ctx->err_stack || ctx->too_many) |
260 | ctx->err_stack++; | ||
261 | /* (Try to) get a new frame pointer */ | ||
262 | else if(!BN_STACK_push(&ctx->stack, ctx->used)) | ||
263 | { | ||
264 | BNerr(BN_F_BN_CTX_START,BN_R_TOO_MANY_TEMPORARY_VARIABLES); | ||
265 | ctx->err_stack++; | ||
266 | } | ||
267 | CTXDBG_EXIT(ctx); | ||
118 | } | 268 | } |
119 | 269 | ||
270 | void BN_CTX_end(BN_CTX *ctx) | ||
271 | { | ||
272 | CTXDBG_ENTRY("BN_CTX_end", ctx); | ||
273 | if(ctx->err_stack) | ||
274 | ctx->err_stack--; | ||
275 | else | ||
276 | { | ||
277 | unsigned int fp = BN_STACK_pop(&ctx->stack); | ||
278 | /* Does this stack frame have anything to release? */ | ||
279 | if(fp < ctx->used) | ||
280 | BN_POOL_release(&ctx->pool, ctx->used - fp); | ||
281 | ctx->used = fp; | ||
282 | /* Unjam "too_many" in case "get" had failed */ | ||
283 | ctx->too_many = 0; | ||
284 | } | ||
285 | CTXDBG_EXIT(ctx); | ||
286 | } | ||
120 | 287 | ||
121 | BIGNUM *BN_CTX_get(BN_CTX *ctx) | 288 | BIGNUM *BN_CTX_get(BN_CTX *ctx) |
122 | { | 289 | { |
123 | /* Note: If BN_CTX_get is ever changed to allocate BIGNUMs dynamically, | 290 | BIGNUM *ret; |
124 | * make sure that if BN_CTX_get fails once it will return NULL again | 291 | CTXDBG_ENTRY("BN_CTX_get", ctx); |
125 | * until BN_CTX_end is called. (This is so that callers have to check | 292 | if(ctx->err_stack || ctx->too_many) return NULL; |
126 | * only the last return value.) | 293 | if((ret = BN_POOL_get(&ctx->pool)) == NULL) |
127 | */ | 294 | { |
128 | if (ctx->depth > BN_CTX_NUM_POS || ctx->tos >= BN_CTX_NUM) | 295 | /* Setting too_many prevents repeated "get" attempts from |
296 | * cluttering the error stack. */ | ||
297 | ctx->too_many = 1; | ||
298 | BNerr(BN_F_BN_CTX_GET,BN_R_TOO_MANY_TEMPORARY_VARIABLES); | ||
299 | return NULL; | ||
300 | } | ||
301 | /* OK, make sure the returned bignum is "zero" */ | ||
302 | BN_zero(ret); | ||
303 | ctx->used++; | ||
304 | CTXDBG_RET(ctx, ret); | ||
305 | return ret; | ||
306 | } | ||
307 | |||
308 | /************/ | ||
309 | /* BN_STACK */ | ||
310 | /************/ | ||
311 | |||
312 | static void BN_STACK_init(BN_STACK *st) | ||
313 | { | ||
314 | st->indexes = NULL; | ||
315 | st->depth = st->size = 0; | ||
316 | } | ||
317 | |||
318 | static void BN_STACK_finish(BN_STACK *st) | ||
319 | { | ||
320 | if(st->size) OPENSSL_free(st->indexes); | ||
321 | } | ||
322 | |||
323 | #ifndef OPENSSL_NO_DEPRECATED | ||
324 | static void BN_STACK_reset(BN_STACK *st) | ||
325 | { | ||
326 | st->depth = 0; | ||
327 | } | ||
328 | #endif | ||
329 | |||
330 | static int BN_STACK_push(BN_STACK *st, unsigned int idx) | ||
331 | { | ||
332 | if(st->depth == st->size) | ||
333 | /* Need to expand */ | ||
334 | { | ||
335 | unsigned int newsize = (st->size ? | ||
336 | (st->size * 3 / 2) : BN_CTX_START_FRAMES); | ||
337 | unsigned int *newitems = OPENSSL_malloc(newsize * | ||
338 | sizeof(unsigned int)); | ||
339 | if(!newitems) return 0; | ||
340 | if(st->depth) | ||
341 | memcpy(newitems, st->indexes, st->depth * | ||
342 | sizeof(unsigned int)); | ||
343 | if(st->size) OPENSSL_free(st->indexes); | ||
344 | st->indexes = newitems; | ||
345 | st->size = newsize; | ||
346 | } | ||
347 | st->indexes[(st->depth)++] = idx; | ||
348 | return 1; | ||
349 | } | ||
350 | |||
351 | static unsigned int BN_STACK_pop(BN_STACK *st) | ||
352 | { | ||
353 | return st->indexes[--(st->depth)]; | ||
354 | } | ||
355 | |||
356 | /***********/ | ||
357 | /* BN_POOL */ | ||
358 | /***********/ | ||
359 | |||
360 | static void BN_POOL_init(BN_POOL *p) | ||
361 | { | ||
362 | p->head = p->current = p->tail = NULL; | ||
363 | p->used = p->size = 0; | ||
364 | } | ||
365 | |||
366 | static void BN_POOL_finish(BN_POOL *p) | ||
367 | { | ||
368 | while(p->head) | ||
129 | { | 369 | { |
130 | if (!ctx->too_many) | 370 | unsigned int loop = 0; |
371 | BIGNUM *bn = p->head->vals; | ||
372 | while(loop++ < BN_CTX_POOL_SIZE) | ||
131 | { | 373 | { |
132 | BNerr(BN_F_BN_CTX_GET,BN_R_TOO_MANY_TEMPORARY_VARIABLES); | 374 | if(bn->d) BN_clear_free(bn); |
133 | /* disable error code until BN_CTX_end is called: */ | 375 | bn++; |
134 | ctx->too_many = 1; | ||
135 | } | 376 | } |
136 | return NULL; | 377 | p->current = p->head->next; |
378 | OPENSSL_free(p->head); | ||
379 | p->head = p->current; | ||
137 | } | 380 | } |
138 | return (&(ctx->bn[ctx->tos++])); | ||
139 | } | 381 | } |
140 | 382 | ||
141 | void BN_CTX_end(BN_CTX *ctx) | 383 | #ifndef OPENSSL_NO_DEPRECATED |
384 | static void BN_POOL_reset(BN_POOL *p) | ||
142 | { | 385 | { |
143 | if (ctx == NULL) return; | 386 | BN_POOL_ITEM *item = p->head; |
144 | assert(ctx->depth > 0); | 387 | while(item) |
145 | if (ctx->depth == 0) | 388 | { |
146 | /* should never happen, but we can tolerate it if not in | 389 | unsigned int loop = 0; |
147 | * debug mode (could be a 'goto err' in the calling function | 390 | BIGNUM *bn = item->vals; |
148 | * before BN_CTX_start was reached) */ | 391 | while(loop++ < BN_CTX_POOL_SIZE) |
149 | BN_CTX_start(ctx); | 392 | { |
393 | if(bn->d) BN_clear(bn); | ||
394 | bn++; | ||
395 | } | ||
396 | item = item->next; | ||
397 | } | ||
398 | p->current = p->head; | ||
399 | p->used = 0; | ||
400 | } | ||
401 | #endif | ||
150 | 402 | ||
151 | ctx->too_many = 0; | 403 | static BIGNUM *BN_POOL_get(BN_POOL *p) |
152 | ctx->depth--; | 404 | { |
153 | if (ctx->depth < BN_CTX_NUM_POS) | 405 | if(p->used == p->size) |
154 | ctx->tos = ctx->pos[ctx->depth]; | 406 | { |
407 | BIGNUM *bn; | ||
408 | unsigned int loop = 0; | ||
409 | BN_POOL_ITEM *item = OPENSSL_malloc(sizeof(BN_POOL_ITEM)); | ||
410 | if(!item) return NULL; | ||
411 | /* Initialise the structure */ | ||
412 | bn = item->vals; | ||
413 | while(loop++ < BN_CTX_POOL_SIZE) | ||
414 | BN_init(bn++); | ||
415 | item->prev = p->tail; | ||
416 | item->next = NULL; | ||
417 | /* Link it in */ | ||
418 | if(!p->head) | ||
419 | p->head = p->current = p->tail = item; | ||
420 | else | ||
421 | { | ||
422 | p->tail->next = item; | ||
423 | p->tail = item; | ||
424 | p->current = item; | ||
425 | } | ||
426 | p->size += BN_CTX_POOL_SIZE; | ||
427 | p->used++; | ||
428 | /* Return the first bignum from the new pool */ | ||
429 | return item->vals; | ||
430 | } | ||
431 | if(!p->used) | ||
432 | p->current = p->head; | ||
433 | else if((p->used % BN_CTX_POOL_SIZE) == 0) | ||
434 | p->current = p->current->next; | ||
435 | return p->current->vals + ((p->used++) % BN_CTX_POOL_SIZE); | ||
436 | } | ||
437 | |||
438 | static void BN_POOL_release(BN_POOL *p, unsigned int num) | ||
439 | { | ||
440 | unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE; | ||
441 | p->used -= num; | ||
442 | while(num--) | ||
443 | { | ||
444 | bn_check_top(p->current->vals + offset); | ||
445 | if(!offset) | ||
446 | { | ||
447 | offset = BN_CTX_POOL_SIZE - 1; | ||
448 | p->current = p->current->prev; | ||
449 | } | ||
450 | else | ||
451 | offset--; | ||
452 | } | ||
155 | } | 453 | } |
454 | |||