atomicio.c 2.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
  1. /* $OpenBSD: atomicio.c,v 1.11 2012/12/04 02:24:47 deraadt Exp $ */
  2. /*
  3. * Copyright (c) 2006 Damien Miller. All rights reserved.
  4. * Copyright (c) 2005 Anil Madhavapeddy. All rights reserved.
  5. * Copyright (c) 1995,1999 Theo de Raadt. All rights reserved.
  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. * 1. Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  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. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  18. * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  19. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  20. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  21. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  22. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  26. * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27. */
  28. #include <errno.h>
  29. #include <poll.h>
  30. #include <unistd.h>
  31. #include "atomicio.h"
  32. /*
  33. * ensure all of data on socket comes through. f==read || f==vwrite
  34. */
  35. size_t
  36. atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
  37. {
  38. char *s = _s;
  39. size_t pos = 0;
  40. ssize_t res;
  41. struct pollfd pfd;
  42. pfd.fd = fd;
  43. pfd.events = f == read ? POLLIN : POLLOUT;
  44. while (n > pos) {
  45. res = (f) (fd, s + pos, n - pos);
  46. switch (res) {
  47. case -1:
  48. if (errno == EINTR)
  49. continue;
  50. if ((errno == EAGAIN) || (errno == ENOBUFS)) {
  51. (void)poll(&pfd, 1, -1);
  52. continue;
  53. }
  54. return 0;
  55. case 0:
  56. errno = EPIPE;
  57. return pos;
  58. default:
  59. pos += (size_t)res;
  60. }
  61. }
  62. return (pos);
  63. }