2 * Copyright (c) 2004, Swedish Institute of Computer Science.
\r
3 * All rights reserved.
\r
5 * Redistribution and use in source and binary forms, with or without
\r
6 * modification, are permitted provided that the following conditions
\r
8 * 1. Redistributions of source code must retain the above copyright
\r
9 * notice, this list of conditions and the following disclaimer.
\r
10 * 2. Redistributions in binary form must reproduce the above copyright
\r
11 * notice, this list of conditions and the following disclaimer in the
\r
12 * documentation and/or other materials provided with the distribution.
\r
13 * 3. Neither the name of the Institute nor the names of its contributors
\r
14 * may be used to endorse or promote products derived from this software
\r
15 * without specific prior written permission.
\r
17 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
\r
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
\r
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
\r
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
\r
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
\r
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
\r
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
\r
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
\r
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
\r
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
\r
29 * This file is part of the uIP TCP/IP stack
\r
31 * Author: Adam Dunkels <adam@sics.se>
\r
33 * $Id: psock.c,v 1.2 2006/06/12 08:00:30 adam Exp $
\r
43 #define STATE_NONE 0
\r
44 #define STATE_ACKED 1
\r
45 #define STATE_READ 2
\r
46 #define STATE_BLOCKED_NEWDATA 3
\r
47 #define STATE_BLOCKED_CLOSE 4
\r
48 #define STATE_BLOCKED_SEND 5
\r
49 #define STATE_DATA_SENT 6
\r
52 * Return value of the buffering functions that indicates that a
\r
53 * buffer was not filled by incoming data.
\r
56 #define BUF_NOT_FULL 0
\r
57 #define BUF_NOT_FOUND 0
\r
60 * Return value of the buffering functions that indicates that a
\r
61 * buffer was completely filled by incoming data.
\r
67 * Return value of the buffering functions that indicates that an
\r
68 * end-marker byte was found.
\r
73 /*---------------------------------------------------------------------------*/
\r
75 buf_setup(struct psock_buf *buf,
\r
76 u8_t *bufptr, u16_t bufsize)
\r
79 buf->left = bufsize;
\r
81 /*---------------------------------------------------------------------------*/
\r
83 buf_bufdata(struct psock_buf *buf, u16_t len,
\r
84 u8_t **dataptr, u16_t *datalen)
\r
87 if(*datalen < buf->left) {
\r
88 memcpy(buf->ptr, *dataptr, *datalen);
\r
89 buf->ptr += *datalen;
\r
90 buf->left -= *datalen;
\r
91 *dataptr += *datalen;
\r
93 return BUF_NOT_FULL;
\r
94 } else if(*datalen == buf->left) {
\r
95 memcpy(buf->ptr, *dataptr, *datalen);
\r
96 buf->ptr += *datalen;
\r
98 *dataptr += *datalen;
\r
102 memcpy(buf->ptr, *dataptr, buf->left);
\r
103 buf->ptr += buf->left;
\r
104 *datalen -= buf->left;
\r
105 *dataptr += buf->left;
\r
110 /*---------------------------------------------------------------------------*/
\r
112 buf_bufto(register struct psock_buf *buf, u8_t endmarker,
\r
113 register u8_t **dataptr, register u16_t *datalen)
\r
116 while(buf->left > 0 && *datalen > 0) {
\r
117 c = *buf->ptr = **dataptr;
\r
123 if(c == endmarker) {
\r
128 if(*datalen == 0) {
\r
129 return BUF_NOT_FOUND;
\r
132 while(*datalen > 0) {
\r
137 if(c == endmarker) {
\r
138 return BUF_FOUND | BUF_FULL;
\r
144 /*---------------------------------------------------------------------------*/
\r
146 send_data(register struct psock *s)
\r
148 if(s->state != STATE_DATA_SENT || uip_rexmit()) {
\r
149 if(s->sendlen > uip_mss()) {
\r
150 uip_send(s->sendptr, uip_mss());
\r
152 uip_send(s->sendptr, s->sendlen);
\r
154 s->state = STATE_DATA_SENT;
\r
159 /*---------------------------------------------------------------------------*/
\r
161 data_acked(register struct psock *s)
\r
163 if(s->state == STATE_DATA_SENT && uip_acked()) {
\r
164 if(s->sendlen > uip_mss()) {
\r
165 s->sendlen -= uip_mss();
\r
166 s->sendptr += uip_mss();
\r
168 s->sendptr += s->sendlen;
\r
171 s->state = STATE_ACKED;
\r
176 /*---------------------------------------------------------------------------*/
\r
177 PT_THREAD(psock_send(register struct psock *s, const char *buf,
\r
180 PT_BEGIN(&s->psockpt);
\r
182 /* If there is no data to send, we exit immediately. */
\r
184 PT_EXIT(&s->psockpt);
\r
187 /* Save the length of and a pointer to the data that is to be
\r
189 s->sendptr = (unsigned char*)buf;
\r
192 s->state = STATE_NONE;
\r
194 /* We loop here until all data is sent. The s->sendlen variable is
\r
195 updated by the data_sent() function. */
\r
196 while(s->sendlen > 0) {
\r
199 * The condition for this PT_WAIT_UNTIL is a little tricky: the
\r
200 * protothread will wait here until all data has been acknowledged
\r
201 * (data_acked() returns true) and until all data has been sent
\r
202 * (send_data() returns true). The two functions data_acked() and
\r
203 * send_data() must be called in succession to ensure that all
\r
204 * data is sent. Therefore the & operator is used instead of the
\r
205 * && operator, which would cause only the data_acked() function
\r
206 * to be called when it returns false.
\r
208 PT_WAIT_UNTIL(&s->psockpt, data_acked(s) & send_data(s));
\r
211 s->state = STATE_NONE;
\r
213 PT_END(&s->psockpt);
\r
215 /*---------------------------------------------------------------------------*/
\r
216 PT_THREAD(psock_generator_send(register struct psock *s,
\r
217 unsigned short (*generate)(void *), void *arg))
\r
219 PT_BEGIN(&s->psockpt);
\r
221 /* Ensure that there is a generator function to call. */
\r
222 if(generate == NULL) {
\r
223 PT_EXIT(&s->psockpt);
\r
226 /* Call the generator function to generate the data in the
\r
227 uip_appdata buffer. */
\r
228 s->sendlen = generate(arg);
\r
229 s->sendptr = uip_appdata;
\r
231 s->state = STATE_NONE;
\r
233 /* Call the generator function again if we are called to perform a
\r
238 /* Wait until all data is sent and acknowledged. */
\r
239 PT_WAIT_UNTIL(&s->psockpt, data_acked(s) & send_data(s));
\r
240 } while(s->sendlen > 0);
\r
242 s->state = STATE_NONE;
\r
244 PT_END(&s->psockpt);
\r
246 /*---------------------------------------------------------------------------*/
\r
248 psock_datalen(struct psock *psock)
\r
250 return psock->bufsize - psock->buf.left;
\r
252 /*---------------------------------------------------------------------------*/
\r
254 psock_newdata(struct psock *s)
\r
256 if(s->readlen > 0) {
\r
257 /* There is data in the uip_appdata buffer that has not yet been
\r
258 read with the PSOCK_READ functions. */
\r
260 } else if(s->state == STATE_READ) {
\r
261 /* All data in uip_appdata buffer already consumed. */
\r
262 s->state = STATE_BLOCKED_NEWDATA;
\r
264 } else if(uip_newdata()) {
\r
265 /* There is new data that has not been consumed. */
\r
268 /* There is no new data. */
\r
272 /*---------------------------------------------------------------------------*/
\r
273 PT_THREAD(psock_readto(register struct psock *psock, unsigned char c))
\r
275 PT_BEGIN(&psock->psockpt);
\r
277 buf_setup(&psock->buf, (unsigned char*)psock->bufptr, psock->bufsize);
\r
279 /* XXX: Should add buf_checkmarker() before do{} loop, if
\r
280 incoming data has been handled while waiting for a write. */
\r
283 if(psock->readlen == 0) {
\r
284 PT_WAIT_UNTIL(&psock->psockpt, psock_newdata(psock));
\r
285 psock->state = STATE_READ;
\r
286 psock->readptr = (u8_t *)uip_appdata;
\r
287 psock->readlen = uip_datalen();
\r
289 } while((buf_bufto(&psock->buf, c,
\r
291 &psock->readlen) & BUF_FOUND) == 0);
\r
293 if(psock_datalen(psock) == 0) {
\r
294 psock->state = STATE_NONE;
\r
295 PT_RESTART(&psock->psockpt);
\r
297 PT_END(&psock->psockpt);
\r
299 /*---------------------------------------------------------------------------*/
\r
300 PT_THREAD(psock_readbuf(register struct psock *psock))
\r
302 PT_BEGIN(&psock->psockpt);
\r
304 buf_setup(&psock->buf, (unsigned char * ) psock->bufptr, psock->bufsize);
\r
306 /* XXX: Should add buf_checkmarker() before do{} loop, if
\r
307 incoming data has been handled while waiting for a write. */
\r
310 if(psock->readlen == 0) {
\r
311 PT_WAIT_UNTIL(&psock->psockpt, psock_newdata(psock));
\r
312 printf("Waited for newdata\n");
\r
313 psock->state = STATE_READ;
\r
314 psock->readptr = (u8_t *)uip_appdata;
\r
315 psock->readlen = uip_datalen();
\r
317 } while(buf_bufdata(&psock->buf, psock->bufsize,
\r
319 &psock->readlen) != BUF_FULL);
\r
321 if(psock_datalen(psock) == 0) {
\r
322 psock->state = STATE_NONE;
\r
323 PT_RESTART(&psock->psockpt);
\r
325 PT_END(&psock->psockpt);
\r
327 /*---------------------------------------------------------------------------*/
\r
329 psock_init(register struct psock *psock, char *buffer, unsigned int buffersize)
\r
331 psock->state = STATE_NONE;
\r
332 psock->readlen = 0;
\r
333 psock->bufptr = buffer;
\r
334 psock->bufsize = buffersize;
\r
335 buf_setup(&psock->buf, (unsigned char*) buffer, buffersize);
\r
336 PT_INIT(&psock->pt);
\r
337 PT_INIT(&psock->psockpt);
\r
339 /*---------------------------------------------------------------------------*/
\r