2 * Copyright (c) 1997 - 2000, 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"
37 RCSID("$Id: store_mem.c,v 1.11 2002/04/18 14:00:44 joda Exp $");
39 typedef struct mem_storage{
46 mem_fetch(krb5_storage *sp, void *data, size_t size)
48 mem_storage *s = (mem_storage*)sp->data;
49 if(size > s->base + s->size - s->ptr)
50 size = s->base + s->size - s->ptr;
51 memmove(data, s->ptr, size);
52 sp->seek(sp, size, SEEK_CUR);
57 mem_store(krb5_storage *sp, const void *data, size_t size)
59 mem_storage *s = (mem_storage*)sp->data;
60 if(size > s->base + s->size - s->ptr)
61 size = s->base + s->size - s->ptr;
62 memmove(s->ptr, data, size);
63 sp->seek(sp, size, SEEK_CUR);
68 mem_seek(krb5_storage *sp, off_t offset, int whence)
70 mem_storage *s = (mem_storage*)sp->data;
77 s->ptr = s->base + offset;
80 return sp->seek(sp, s->ptr - s->base + offset, SEEK_SET);
82 return sp->seek(sp, s->size + offset, SEEK_SET);
87 return s->ptr - s->base;
91 krb5_storage_from_mem(void *buf, size_t len)
93 krb5_storage *sp = malloc(sizeof(krb5_storage));
97 s = malloc(sizeof(*s));
104 sp->eof_code = HEIM_ERR_EOF;
108 sp->fetch = mem_fetch;
109 sp->store = mem_store;
116 krb5_storage_from_data(krb5_data *data)
118 return krb5_storage_from_mem(data->data, data->length);