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"
39
typedef struct emem_storage{
47
emem_fetch(krb5_storage *sp, void *data, size_t size)
49
emem_storage *s = (emem_storage*)sp->data;
50
if(s->base + s->len - s->ptr < size)
51
size = s->base + s->len - s->ptr;
52
memmove(data, s->ptr, size);
53
sp->seek(sp, size, SEEK_CUR);
58
emem_store(krb5_storage *sp, const void *data, size_t size)
60
emem_storage *s = (emem_storage*)sp->data;
61
if(size > s->base + s->size - s->ptr){
64
off = s->ptr - s->base;
68
base = realloc(s->base, sz);
73
s->ptr = (unsigned char*)base + off;
75
memmove(s->ptr, data, size);
76
sp->seek(sp, size, SEEK_CUR);
81
emem_seek(krb5_storage *sp, off_t offset, int whence)
83
emem_storage *s = (emem_storage*)sp->data;
90
s->ptr = s->base + offset;
95
sp->seek(sp,s->ptr - s->base + offset, SEEK_SET);
98
sp->seek(sp, s->len + offset, SEEK_SET);
104
return s->ptr - s->base;
108
emem_free(krb5_storage *sp)
110
emem_storage *s = sp->data;
111
memset(s->base, 0, s->len);
115
krb5_storage * KRB5_LIB_FUNCTION
116
krb5_storage_emem(void)
121
sp = malloc(sizeof(krb5_storage));
125
s = malloc(sizeof(*s));
132
sp->eof_code = HEIM_ERR_EOF;
134
s->base = malloc(s->size);
135
if (s->base == NULL) {
142
sp->fetch = emem_fetch;
143
sp->store = emem_store;
144
sp->seek = emem_seek;
145
sp->free = emem_free;