Debian Codegraph @

lib/krb5/store_emem.c

raw
1 /*
2 * Copyright (c) 1997 - 2002 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 *
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.
16 *
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34 #include "krb5_locl.h"
35 #include "store-int.h"
36
37 typedef struct emem_storage{
38 unsigned char *base;
39 size_t size;
40 size_t len;
41 unsigned char *ptr;
42 }emem_storage;
43
44 static ssize_t
45 emem_fetch(krb5_storage *sp, void *data, size_t size)
46 {
47 emem_storage *s = (emem_storage*)sp->data;
48 if((size_t)(s->base + s->len - s->ptr) < size)
49 size = s->base + s->len - s->ptr;
50 memmove(data, s->ptr, size);
51 sp->seek(sp, size, SEEK_CUR);
52 return size;
53 }
54
55 static ssize_t
56 emem_store(krb5_storage *sp, const void *data, size_t size)
57 {
58 emem_storage *s = (emem_storage*)sp->data;
59 if(size > (size_t)(s->base + s->size - s->ptr)){
60 void *base;
61 size_t sz, off;
62 off = s->ptr - s->base;
63 sz = off + size;
64 if (sz < 4096)
65 sz *= 2;
66 base = realloc(s->base, sz);
67 if(base == NULL)
68 return -1;
69 s->size = sz;
70 s->base = base;
71 s->ptr = (unsigned char*)base + off;
72 }
73 if (size)
74 memmove(s->ptr, data, size);
75 sp->seek(sp, size, SEEK_CUR);
76 return size;
77 }
78
79 static off_t
80 emem_seek(krb5_storage *sp, off_t offset, int whence)
81 {
82 emem_storage *s = (emem_storage*)sp->data;
83 switch(whence){
84 case SEEK_SET:
85 if((size_t)offset > s->size)
86 offset = s->size;
87 if(offset < 0)
88 offset = 0;
89 s->ptr = s->base + offset;
90 if((size_t)offset > s->len)
91 s->len = offset;
92 break;
93 case SEEK_CUR:
94 sp->seek(sp,s->ptr - s->base + offset, SEEK_SET);
95 break;
96 case SEEK_END:
97 sp->seek(sp, s->len + offset, SEEK_SET);
98 break;
99 default:
100 errno = EINVAL;
101 return -1;
102 }
103 return s->ptr - s->base;
104 }
105
106 static int
107 emem_trunc(krb5_storage *sp, off_t offset)
108 {
109 emem_storage *s = (emem_storage*)sp->data;
110 /*
111 * If offset is larget then current size, or current size is
112 * shrunk more then half of the current size, adjust buffer.
113 */
114 if (offset == 0) {
115 free(s->base);
116 s->size = 0;
117 s->base = NULL;
118 s->ptr = NULL;
119 } else if ((size_t)offset > s->size || (s->size / 2) > (size_t)offset) {
120 void *base;
121 size_t off;
122 off = s->ptr - s->base;
123 base = realloc(s->base, offset);
124 if(base == NULL)
125 return ENOMEM;
126 if ((size_t)offset > s->size)
127 memset((char *)base + s->size, 0, offset - s->size);
128 s->size = offset;
129 s->base = base;
130 s->ptr = (unsigned char *)base + off;
131 }
132 s->len = offset;
133 if ((s->ptr - s->base) > offset)
134 s->ptr = s->base + offset;
135 return 0;
136 }
137
138
139 static void
140 emem_free(krb5_storage *sp)
141 {
142 emem_storage *s = sp->data;
143 memset(s->base, 0, s->len);
144 free(s->base);
145 }
146
147 /**
148 * Create a elastic (allocating) memory storage backend. Memory is
149 * allocated on demand. Free returned krb5_storage with
150 * krb5_storage_free().
151 *
152 * @return A krb5_storage on success, or NULL on out of memory error.
153 *
154 * @ingroup krb5_storage
155 *
156 * @sa krb5_storage_from_mem()
157 * @sa krb5_storage_from_readonly_mem()
158 * @sa krb5_storage_from_fd()
159 * @sa krb5_storage_from_data()
160 * @sa krb5_storage_from_socket()
161 */
162
163 KRB5_LIB_FUNCTION krb5_storage * KRB5_LIB_CALL
164 krb5_storage_emem(void)
165 {
166 krb5_storage *sp;
167 emem_storage *s;
168
169 sp = malloc(sizeof(krb5_storage));
170 if (sp == NULL)
171 return NULL;
172
173 s = malloc(sizeof(*s));
174 if (s == NULL) {
175 free(sp);
176 return NULL;
177 }
178 sp->data = s;
179 sp->flags = 0;
180 sp->eof_code = HEIM_ERR_EOF;
181 s->size = 1024;
182 s->base = malloc(s->size);
183 if (s->base == NULL) {
184 free(sp);
185 free(s);
186 return NULL;
187 }
188 s->len = 0;
189 s->ptr = s->base;
190 sp->fetch = emem_fetch;
191 sp->store = emem_store;
192 sp->seek = emem_seek;
193 sp->trunc = emem_trunc;
194 sp->fsync = NULL;
195 sp->free = emem_free;
196 sp->max_alloc = UINT_MAX/8;
197 return sp;
198 }