1 /*	$NetBSD: store_fd.c,v 1.1.1.2 2014/04/24 12:45:51 pettai Exp $	*/
2 
3 /*
4  * Copyright (c) 1997 - 2004 Kungliga Tekniska Högskolan
5  * (Royal Institute of Technology, Stockholm, Sweden).
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  *
12  * 1. Redistributions of source code must retain the above copyright
13  *    notice, this list of conditions and the following disclaimer.
14  *
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  *
19  * 3. Neither the name of the Institute nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #include "krb5_locl.h"
37 #include "store-int.h"
38 
39 typedef struct fd_storage {
40     int fd;
41 } fd_storage;
42 
43 #define FD(S) (((fd_storage*)(S)->data)->fd)
44 
45 static ssize_t
fd_fetch(krb5_storage * sp,void * data,size_t size)46 fd_fetch(krb5_storage * sp, void *data, size_t size)
47 {
48     return net_read(FD(sp), data, size);
49 }
50 
51 static ssize_t
fd_store(krb5_storage * sp,const void * data,size_t size)52 fd_store(krb5_storage * sp, const void *data, size_t size)
53 {
54     return net_write(FD(sp), data, size);
55 }
56 
57 static off_t
fd_seek(krb5_storage * sp,off_t offset,int whence)58 fd_seek(krb5_storage * sp, off_t offset, int whence)
59 {
60     return lseek(FD(sp), offset, whence);
61 }
62 
63 static int
fd_trunc(krb5_storage * sp,off_t offset)64 fd_trunc(krb5_storage * sp, off_t offset)
65 {
66     if (ftruncate(FD(sp), offset) == -1)
67 	return errno;
68     return 0;
69 }
70 
71 static void
fd_free(krb5_storage * sp)72 fd_free(krb5_storage * sp)
73 {
74     close(FD(sp));
75 }
76 
77 /**
78  *
79  *
80  * @return A krb5_storage on success, or NULL on out of memory error.
81  *
82  * @ingroup krb5_storage
83  *
84  * @sa krb5_storage_emem()
85  * @sa krb5_storage_from_mem()
86  * @sa krb5_storage_from_readonly_mem()
87  * @sa krb5_storage_from_data()
88  */
89 
90 KRB5_LIB_FUNCTION krb5_storage * KRB5_LIB_CALL
krb5_storage_from_fd(krb5_socket_t fd_in)91 krb5_storage_from_fd(krb5_socket_t fd_in)
92 {
93     krb5_storage *sp;
94     int fd;
95 
96 #ifdef SOCKET_IS_NOT_AN_FD
97 #ifdef _MSC_VER
98     if (_get_osfhandle(fd_in) != -1) {
99 	fd = dup(fd_in);
100     } else {
101 	fd = _open_osfhandle(fd_in, 0);
102     }
103 #else
104 #error Dont know how to deal with fd that may or may not be a socket.
105 #endif
106 #else  /* SOCKET_IS_NOT_AN_FD */
107     fd = dup(fd_in);
108 #endif
109 
110     if (fd < 0)
111 	return NULL;
112 
113     sp = malloc(sizeof(krb5_storage));
114     if (sp == NULL) {
115 	close(fd);
116 	return NULL;
117     }
118 
119     sp->data = malloc(sizeof(fd_storage));
120     if (sp->data == NULL) {
121 	close(fd);
122 	free(sp);
123 	return NULL;
124     }
125     sp->flags = 0;
126     sp->eof_code = HEIM_ERR_EOF;
127     FD(sp) = fd;
128     sp->fetch = fd_fetch;
129     sp->store = fd_store;
130     sp->seek = fd_seek;
131     sp->trunc = fd_trunc;
132     sp->free = fd_free;
133     sp->max_alloc = UINT_MAX/8;
134     return sp;
135 }
136