2 * Copyright (c) 1997 - 2002 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include "krb5_locl.h"
35 #include "store-int.h"
38 typedef struct emem_storage
{
46 emem_fetch(krb5_storage
*sp
, void *data
, size_t size
)
48 emem_storage
*s
= (emem_storage
*)sp
->data
;
50 assert(data
!= NULL
&& s
->ptr
!= NULL
);
52 if((size_t)(s
->base
+ s
->len
- s
->ptr
) < size
)
53 size
= s
->base
+ s
->len
- s
->ptr
;
54 memmove(data
, s
->ptr
, size
);
55 sp
->seek(sp
, size
, SEEK_CUR
);
60 emem_store(krb5_storage
*sp
, const void *data
, size_t size
)
65 sp
->seek(sp
, 0, SEEK_CUR
);
69 s
= (emem_storage
*)sp
->data
;
73 if(size
> (size_t)(s
->base
+ s
->size
- s
->ptr
)){
76 off
= s
->ptr
- s
->base
;
80 base
= realloc(s
->base
, sz
);
85 s
->ptr
= (unsigned char*)base
+ off
;
88 memmove(s
->ptr
, data
, size
);
89 sp
->seek(sp
, size
, SEEK_CUR
);
94 emem_seek(krb5_storage
*sp
, off_t offset
, int whence
)
96 emem_storage
*s
= (emem_storage
*)sp
->data
;
99 if((size_t)offset
> s
->size
)
103 s
->ptr
= s
->base
+ offset
;
104 if((size_t)offset
> s
->len
)
108 sp
->seek(sp
,s
->ptr
- s
->base
+ offset
, SEEK_SET
);
111 sp
->seek(sp
, s
->len
+ offset
, SEEK_SET
);
117 return s
->ptr
- s
->base
;
121 emem_trunc(krb5_storage
*sp
, off_t offset
)
123 emem_storage
*s
= (emem_storage
*)sp
->data
;
125 * If offset is larget then current size, or current size is
126 * shrunk more then half of the current size, adjust buffer.
129 if (s
->size
> 1024) {
132 base
= realloc(s
->base
, 1024);
140 } else if ((size_t)offset
> s
->size
|| (s
->size
/ 2) > (size_t)offset
) {
143 off
= s
->ptr
- s
->base
;
144 base
= realloc(s
->base
, offset
);
147 if ((size_t)offset
> s
->size
)
148 memset((char *)base
+ s
->size
, 0, offset
- s
->size
);
151 s
->ptr
= (unsigned char *)base
+ off
;
154 if ((s
->ptr
- s
->base
) > offset
)
155 s
->ptr
= s
->base
+ offset
;
161 emem_free(krb5_storage
*sp
)
163 emem_storage
*s
= sp
->data
;
165 assert(s
->base
!= NULL
);
167 memset_s(s
->base
, s
->len
, 0, s
->len
);
172 * Create a elastic (allocating) memory storage backend. Memory is
173 * allocated on demand. Free returned krb5_storage with
174 * krb5_storage_free().
176 * @return A krb5_storage on success, or NULL on out of memory error.
178 * @ingroup krb5_storage
180 * @sa krb5_storage_from_mem()
181 * @sa krb5_storage_from_readonly_mem()
182 * @sa krb5_storage_from_fd()
183 * @sa krb5_storage_from_data()
184 * @sa krb5_storage_from_socket()
187 KRB5_LIB_FUNCTION krb5_storage
* KRB5_LIB_CALL
188 krb5_storage_emem(void)
193 sp
= malloc(sizeof(krb5_storage
));
197 s
= malloc(sizeof(*s
));
204 sp
->eof_code
= HEIM_ERR_EOF
;
206 s
->base
= calloc(1, s
->size
);
207 if (s
->base
== NULL
) {
214 sp
->fetch
= emem_fetch
;
215 sp
->store
= emem_store
;
216 sp
->seek
= emem_seek
;
217 sp
->trunc
= emem_trunc
;
219 sp
->free
= emem_free
;
220 sp
->max_alloc
= UINT32_MAX
/64;