1b528cefcSMark Murray /*
2*ae771770SStanislav Sedov * Copyright (c) 1997 - 2000, 2002 Kungliga Tekniska Högskolan
3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden).
4b528cefcSMark Murray * All rights reserved.
5b528cefcSMark Murray *
6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without
7b528cefcSMark Murray * modification, are permitted provided that the following conditions
8b528cefcSMark Murray * are met:
9b528cefcSMark Murray *
10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright
11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer.
12b528cefcSMark Murray *
13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright
14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the
15b528cefcSMark Murray * documentation and/or other materials provided with the distribution.
16b528cefcSMark Murray *
17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors
18b528cefcSMark Murray * may be used to endorse or promote products derived from this software
19b528cefcSMark Murray * without specific prior written permission.
20b528cefcSMark Murray *
21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31b528cefcSMark Murray * SUCH DAMAGE.
32b528cefcSMark Murray */
33b528cefcSMark Murray
34b528cefcSMark Murray #include "krb5_locl.h"
358373020dSJacques Vidrine #include "store-int.h"
36b528cefcSMark Murray
37b528cefcSMark Murray typedef struct mem_storage{
38b528cefcSMark Murray unsigned char *base;
39b528cefcSMark Murray size_t size;
40b528cefcSMark Murray unsigned char *ptr;
41b528cefcSMark Murray }mem_storage;
42b528cefcSMark Murray
43b528cefcSMark Murray static ssize_t
mem_fetch(krb5_storage * sp,void * data,size_t size)44b528cefcSMark Murray mem_fetch(krb5_storage *sp, void *data, size_t size)
45b528cefcSMark Murray {
46b528cefcSMark Murray mem_storage *s = (mem_storage*)sp->data;
47*ae771770SStanislav Sedov if(size > (size_t)(s->base + s->size - s->ptr))
48b528cefcSMark Murray size = s->base + s->size - s->ptr;
49b528cefcSMark Murray memmove(data, s->ptr, size);
50b528cefcSMark Murray sp->seek(sp, size, SEEK_CUR);
51b528cefcSMark Murray return size;
52b528cefcSMark Murray }
53b528cefcSMark Murray
54b528cefcSMark Murray static ssize_t
mem_store(krb5_storage * sp,const void * data,size_t size)555e9cd1aeSAssar Westerlund mem_store(krb5_storage *sp, const void *data, size_t size)
56b528cefcSMark Murray {
57b528cefcSMark Murray mem_storage *s = (mem_storage*)sp->data;
58*ae771770SStanislav Sedov if(size > (size_t)(s->base + s->size - s->ptr))
59b528cefcSMark Murray size = s->base + s->size - s->ptr;
60b528cefcSMark Murray memmove(s->ptr, data, size);
61b528cefcSMark Murray sp->seek(sp, size, SEEK_CUR);
62b528cefcSMark Murray return size;
63b528cefcSMark Murray }
64b528cefcSMark Murray
65c19800e8SDoug Rabson static ssize_t
mem_no_store(krb5_storage * sp,const void * data,size_t size)66c19800e8SDoug Rabson mem_no_store(krb5_storage *sp, const void *data, size_t size)
67c19800e8SDoug Rabson {
68c19800e8SDoug Rabson return -1;
69c19800e8SDoug Rabson }
70c19800e8SDoug Rabson
71b528cefcSMark Murray static off_t
mem_seek(krb5_storage * sp,off_t offset,int whence)72b528cefcSMark Murray mem_seek(krb5_storage *sp, off_t offset, int whence)
73b528cefcSMark Murray {
74b528cefcSMark Murray mem_storage *s = (mem_storage*)sp->data;
75b528cefcSMark Murray switch(whence){
76b528cefcSMark Murray case SEEK_SET:
77*ae771770SStanislav Sedov if((size_t)offset > s->size)
78b528cefcSMark Murray offset = s->size;
79b528cefcSMark Murray if(offset < 0)
80b528cefcSMark Murray offset = 0;
81b528cefcSMark Murray s->ptr = s->base + offset;
82b528cefcSMark Murray break;
83b528cefcSMark Murray case SEEK_CUR:
84b528cefcSMark Murray return sp->seek(sp, s->ptr - s->base + offset, SEEK_SET);
85b528cefcSMark Murray case SEEK_END:
86b528cefcSMark Murray return sp->seek(sp, s->size + offset, SEEK_SET);
87b528cefcSMark Murray default:
88b528cefcSMark Murray errno = EINVAL;
89b528cefcSMark Murray return -1;
90b528cefcSMark Murray }
91b528cefcSMark Murray return s->ptr - s->base;
92b528cefcSMark Murray }
93b528cefcSMark Murray
94*ae771770SStanislav Sedov static int
mem_trunc(krb5_storage * sp,off_t offset)95*ae771770SStanislav Sedov mem_trunc(krb5_storage *sp, off_t offset)
96*ae771770SStanislav Sedov {
97*ae771770SStanislav Sedov mem_storage *s = (mem_storage*)sp->data;
98*ae771770SStanislav Sedov if((size_t)offset > s->size)
99*ae771770SStanislav Sedov return ERANGE;
100*ae771770SStanislav Sedov s->size = offset;
101*ae771770SStanislav Sedov if ((s->ptr - s->base) > offset)
102*ae771770SStanislav Sedov s->ptr = s->base + offset;
103*ae771770SStanislav Sedov return 0;
104*ae771770SStanislav Sedov }
105*ae771770SStanislav Sedov
106*ae771770SStanislav Sedov static int
mem_no_trunc(krb5_storage * sp,off_t offset)107*ae771770SStanislav Sedov mem_no_trunc(krb5_storage *sp, off_t offset)
108*ae771770SStanislav Sedov {
109*ae771770SStanislav Sedov return EINVAL;
110*ae771770SStanislav Sedov }
111*ae771770SStanislav Sedov
112*ae771770SStanislav Sedov /**
113*ae771770SStanislav Sedov * Create a fixed size memory storage block
114*ae771770SStanislav Sedov *
115*ae771770SStanislav Sedov * @return A krb5_storage on success, or NULL on out of memory error.
116*ae771770SStanislav Sedov *
117*ae771770SStanislav Sedov * @ingroup krb5_storage
118*ae771770SStanislav Sedov *
119*ae771770SStanislav Sedov * @sa krb5_storage_mem()
120*ae771770SStanislav Sedov * @sa krb5_storage_from_readonly_mem()
121*ae771770SStanislav Sedov * @sa krb5_storage_from_data()
122*ae771770SStanislav Sedov * @sa krb5_storage_from_fd()
123*ae771770SStanislav Sedov */
124*ae771770SStanislav Sedov
125*ae771770SStanislav Sedov KRB5_LIB_FUNCTION krb5_storage * KRB5_LIB_CALL
krb5_storage_from_mem(void * buf,size_t len)126b528cefcSMark Murray krb5_storage_from_mem(void *buf, size_t len)
127b528cefcSMark Murray {
128b528cefcSMark Murray krb5_storage *sp = malloc(sizeof(krb5_storage));
129b528cefcSMark Murray mem_storage *s;
130b528cefcSMark Murray if(sp == NULL)
131b528cefcSMark Murray return NULL;
132b528cefcSMark Murray s = malloc(sizeof(*s));
133b528cefcSMark Murray if(s == NULL) {
134b528cefcSMark Murray free(sp);
135b528cefcSMark Murray return NULL;
136b528cefcSMark Murray }
137b528cefcSMark Murray sp->data = s;
138b528cefcSMark Murray sp->flags = 0;
1398373020dSJacques Vidrine sp->eof_code = HEIM_ERR_EOF;
140b528cefcSMark Murray s->base = buf;
141b528cefcSMark Murray s->size = len;
142b528cefcSMark Murray s->ptr = buf;
143b528cefcSMark Murray sp->fetch = mem_fetch;
144b528cefcSMark Murray sp->store = mem_store;
145b528cefcSMark Murray sp->seek = mem_seek;
146*ae771770SStanislav Sedov sp->trunc = mem_trunc;
147b528cefcSMark Murray sp->free = NULL;
148*ae771770SStanislav Sedov sp->max_alloc = UINT_MAX/8;
149b528cefcSMark Murray return sp;
150b528cefcSMark Murray }
151b528cefcSMark Murray
152*ae771770SStanislav Sedov /**
153*ae771770SStanislav Sedov * Create a fixed size memory storage block
154*ae771770SStanislav Sedov *
155*ae771770SStanislav Sedov * @return A krb5_storage on success, or NULL on out of memory error.
156*ae771770SStanislav Sedov *
157*ae771770SStanislav Sedov * @ingroup krb5_storage
158*ae771770SStanislav Sedov *
159*ae771770SStanislav Sedov * @sa krb5_storage_mem()
160*ae771770SStanislav Sedov * @sa krb5_storage_from_mem()
161*ae771770SStanislav Sedov * @sa krb5_storage_from_readonly_mem()
162*ae771770SStanislav Sedov * @sa krb5_storage_from_fd()
163*ae771770SStanislav Sedov */
164*ae771770SStanislav Sedov
165*ae771770SStanislav Sedov KRB5_LIB_FUNCTION krb5_storage * KRB5_LIB_CALL
krb5_storage_from_data(krb5_data * data)166b528cefcSMark Murray krb5_storage_from_data(krb5_data *data)
167b528cefcSMark Murray {
168b528cefcSMark Murray return krb5_storage_from_mem(data->data, data->length);
169b528cefcSMark Murray }
170c19800e8SDoug Rabson
171*ae771770SStanislav Sedov /**
172*ae771770SStanislav Sedov * Create a fixed size memory storage block that is read only
173*ae771770SStanislav Sedov *
174*ae771770SStanislav Sedov * @return A krb5_storage on success, or NULL on out of memory error.
175*ae771770SStanislav Sedov *
176*ae771770SStanislav Sedov * @ingroup krb5_storage
177*ae771770SStanislav Sedov *
178*ae771770SStanislav Sedov * @sa krb5_storage_mem()
179*ae771770SStanislav Sedov * @sa krb5_storage_from_mem()
180*ae771770SStanislav Sedov * @sa krb5_storage_from_data()
181*ae771770SStanislav Sedov * @sa krb5_storage_from_fd()
182*ae771770SStanislav Sedov */
183*ae771770SStanislav Sedov
184*ae771770SStanislav Sedov KRB5_LIB_FUNCTION krb5_storage * KRB5_LIB_CALL
krb5_storage_from_readonly_mem(const void * buf,size_t len)185c19800e8SDoug Rabson krb5_storage_from_readonly_mem(const void *buf, size_t len)
186c19800e8SDoug Rabson {
187c19800e8SDoug Rabson krb5_storage *sp = malloc(sizeof(krb5_storage));
188c19800e8SDoug Rabson mem_storage *s;
189c19800e8SDoug Rabson if(sp == NULL)
190c19800e8SDoug Rabson return NULL;
191c19800e8SDoug Rabson s = malloc(sizeof(*s));
192c19800e8SDoug Rabson if(s == NULL) {
193c19800e8SDoug Rabson free(sp);
194c19800e8SDoug Rabson return NULL;
195c19800e8SDoug Rabson }
196c19800e8SDoug Rabson sp->data = s;
197c19800e8SDoug Rabson sp->flags = 0;
198c19800e8SDoug Rabson sp->eof_code = HEIM_ERR_EOF;
199c19800e8SDoug Rabson s->base = rk_UNCONST(buf);
200c19800e8SDoug Rabson s->size = len;
201c19800e8SDoug Rabson s->ptr = rk_UNCONST(buf);
202c19800e8SDoug Rabson sp->fetch = mem_fetch;
203c19800e8SDoug Rabson sp->store = mem_no_store;
204c19800e8SDoug Rabson sp->seek = mem_seek;
205*ae771770SStanislav Sedov sp->trunc = mem_no_trunc;
206c19800e8SDoug Rabson sp->free = NULL;
207*ae771770SStanislav Sedov sp->max_alloc = UINT_MAX/8;
208c19800e8SDoug Rabson return sp;
209c19800e8SDoug Rabson }
210