Home | History | Annotate | Line # | Download | only in krb5 
      1 /*	$NetBSD: net_write.c,v 1.2 2017/01/28 21:31:49 christos Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1997, 1998 Kungliga Tekniska Hgskolan
      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 
     38 KRB5_LIB_FUNCTION krb5_ssize_t KRB5_LIB_CALL
     39 krb5_net_write (krb5_context context,
     40 		void *p_fd,
     41 		const void *buf,
     42 		size_t len)
     43 {
     44     krb5_socket_t fd = *((krb5_socket_t *)p_fd);
     45     return net_write(fd, buf, len);
     46 }
     47 
     48 KRB5_LIB_FUNCTION krb5_ssize_t KRB5_LIB_CALL
     49 krb5_net_write_block(krb5_context context,
     50 		     void *p_fd,
     51 		     const void *buf,
     52 		     size_t len,
     53 		     time_t timeout)
     54 {
     55   krb5_socket_t fd = *((krb5_socket_t *)p_fd);
     56   int ret;
     57   struct timeval tv, *tvp;
     58   const char *cbuf = (const char *)buf;
     59   size_t rem = len;
     60   ssize_t count;
     61   fd_set wfds;
     62 
     63   do {
     64       FD_ZERO(&wfds);
     65       FD_SET(fd, &wfds);
     66 
     67       if (timeout != 0) {
     68 	  tv.tv_sec = timeout;
     69 	  tv.tv_usec = 0;
     70 	  tvp = &tv;
     71       } else
     72 	  tvp = NULL;
     73 
     74       ret = select(fd + 1, NULL, &wfds, NULL, tvp);
     75       if (rk_IS_SOCKET_ERROR(ret)) {
     76 	  if (rk_SOCK_ERRNO == EINTR)
     77 	      continue;
     78 	  return -1;
     79       }
     80 
     81 #ifdef HAVE_WINSOCK
     82       if (ret == 0) {
     83 	  WSASetLastError( WSAETIMEDOUT );
     84 	  return 0;
     85       }
     86 
     87       count = send (fd, cbuf, rem, 0);
     88 
     89       if (rk_IS_SOCKET_ERROR(count)) {
     90 	  return -1;
     91       }
     92 
     93 #else
     94       if (ret == 0) {
     95 	  return 0;
     96       }
     97 
     98       if (!FD_ISSET(fd, &wfds)) {
     99 	  errno = ETIMEDOUT;
    100 	  return -1;
    101       }
    102 
    103       count = write (fd, cbuf, rem);
    104 
    105       if (count < 0) {
    106 	  if (errno == EINTR)
    107 	      continue;
    108 	  else
    109 	      return count;
    110       }
    111 
    112 #endif
    113 
    114       cbuf += count;
    115       rem -= count;
    116 
    117   } while (rem > 0);
    118 
    119   return len;
    120 }
    121