|
1 /*- |
|
2 * Copyright (c) 1995, 1996, 1997, 1998, 1999 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 * © Portions Copyright (c) 2005-2007 Nokia Corporation and/or its subsidiary(-ies). All rights reserved. |
|
33 |
|
34 */ |
|
35 |
|
36 #ifndef __SYMBIAN32__ |
|
37 #ifdef HAVE_CONFIG_H |
|
38 #include <config.h> |
|
39 RCSID("$Id: writev.c,v 1.1.2.1.2.4 2006/11/23 12:00:53 sivanand Exp $"); |
|
40 #endif |
|
41 #include "roken.h" |
|
42 #endif |
|
43 |
|
44 #include <sys/types.h> |
|
45 #include <sys/uio.h> |
|
46 #include <unistd.h> |
|
47 #include <stdlib.h> |
|
48 #include <errno.h> |
|
49 #include <string.h> |
|
50 #include <sys/syslimits.h> |
|
51 #include <stdio.h> |
|
52 #include <wchar.h> |
|
53 |
|
54 |
|
55 ssize_t |
|
56 _writev(int d, const struct iovec *iov, int iovcnt) |
|
57 { |
|
58 ssize_t ret; |
|
59 size_t tot = 0; |
|
60 int VecIter; |
|
61 char *buf, *p; |
|
62 |
|
63 if(iovcnt > IOV_MAX) |
|
64 { |
|
65 errno = EINVAL ; |
|
66 return -1 ; |
|
67 } |
|
68 if(iovcnt < 0 ) |
|
69 { |
|
70 errno = EINVAL ; |
|
71 return -1 ; |
|
72 } |
|
73 |
|
74 for(VecIter = 0; VecIter < iovcnt; ++VecIter) |
|
75 { |
|
76 if(iov[VecIter].iov_base == NULL) |
|
77 { |
|
78 if(VecIter != 0 ) |
|
79 { |
|
80 break ; //Break From the for loop |
|
81 } |
|
82 errno = EFAULT ; |
|
83 return -1 ; |
|
84 } |
|
85 |
|
86 if((int)iov[VecIter].iov_len >= 0 ) |
|
87 { |
|
88 tot += iov[VecIter].iov_len; |
|
89 } |
|
90 |
|
91 else |
|
92 { |
|
93 errno = EINVAL ; |
|
94 return -1 ; |
|
95 } |
|
96 |
|
97 } |
|
98 buf = malloc(tot); |
|
99 if (tot != 0 && buf == NULL) { |
|
100 errno = ENOMEM; |
|
101 return -1; |
|
102 } |
|
103 p = buf; |
|
104 for (VecIter = 0; VecIter < iovcnt; ++VecIter) { |
|
105 |
|
106 if(iov[VecIter].iov_base == NULL) |
|
107 { |
|
108 break ; //Break from the for loop |
|
109 } |
|
110 memcpy (p, iov[VecIter].iov_base, iov[VecIter].iov_len); |
|
111 p += iov[VecIter].iov_len; |
|
112 } |
|
113 ret = write (d, buf, tot); |
|
114 free (buf); |
|
115 return ret; |
|
116 } |
|
117 |
|
118 #ifdef __SYMBIAN_COMPILE_UNUSED__ |
|
119 ssize_t |
|
120 _wwritev(int d, const struct iovec *iov, int iovcnt) |
|
121 { |
|
122 ssize_t ret; |
|
123 size_t tot = 0; |
|
124 int VecIter; |
|
125 FILE *fp ; |
|
126 |
|
127 wchar_t *buf, *p; |
|
128 |
|
129 if(iovcnt > IOV_MAX) |
|
130 { |
|
131 errno = EINVAL ; |
|
132 return -1 ; |
|
133 } |
|
134 if(iovcnt < 0 ) |
|
135 { |
|
136 errno = EINVAL ; |
|
137 return -1 ; |
|
138 } |
|
139 |
|
140 for(VecIter = 0; VecIter < iovcnt; ++VecIter) |
|
141 { |
|
142 if(iov[VecIter].iov_base == NULL) |
|
143 { |
|
144 if(VecIter != 0 ) |
|
145 { |
|
146 break ; //Break From the for loop |
|
147 } |
|
148 errno = EFAULT ; |
|
149 return -1 ; |
|
150 } |
|
151 |
|
152 if((int)iov[VecIter].iov_len >= 0 ) |
|
153 { |
|
154 tot += iov[VecIter].iov_len; |
|
155 } |
|
156 |
|
157 else |
|
158 { |
|
159 errno = EINVAL ; |
|
160 return -1 ; |
|
161 } |
|
162 |
|
163 } |
|
164 buf = (wchar_t *)malloc(tot*sizeof(wchar_t)); |
|
165 if (tot != 0 && buf == NULL) { |
|
166 errno = ENOMEM; |
|
167 return -1; |
|
168 } |
|
169 p = buf; |
|
170 for (VecIter = 0; VecIter < iovcnt; ++VecIter) |
|
171 { |
|
172 |
|
173 if(iov[VecIter].iov_base == NULL) |
|
174 { |
|
175 break ; //Break from the for loop |
|
176 } |
|
177 wmemcpy (p, iov[VecIter].iov_base, iov[VecIter].iov_len); |
|
178 p += iov[VecIter].iov_len; |
|
179 } |
|
180 fp = fdopen(d,"a+"); |
|
181 ret = fwprintf(fp,buf); |
|
182 //ret = write (d, buf, tot); |
|
183 free (buf); |
|
184 return ret; |
|
185 } |
|
186 |
|
187 #endif //__SYMBIAN_COMPILE_UNUSED__ |
|
188 |
|
189 EXPORT_C |
|
190 writev(int fd, const struct iovec *iov, int iovcnt) |
|
191 { |
|
192 return _writev(fd , iov , iovcnt) ; |
|
193 } |
|
194 |
|
195 |