atomicio.c 2.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
  1. /* $OpenBSD: atomicio.c,v 1.17 2006/04/01 05:51:34 djm Exp $ */
  2. /*
  3. * Copied from OpenSSH/OpenBSD.
  4. *
  5. * Copyright (c) 2005 Anil Madhavapeddy. All rights reserved.
  6. * Copyright (c) 1995,1999 Theo de Raadt. All rights reserved.
  7. * All rights reserved.
  8. *
  9. * Redistribution and use in source and binary forms, with or without
  10. * modification, are permitted provided that the following conditions
  11. * are met:
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. * 2. Redistributions in binary form must reproduce the above copyright
  15. * notice, this list of conditions and the following disclaimer in the
  16. * documentation and/or other materials provided with the distribution.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  19. * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  20. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  21. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  22. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  23. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  24. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  25. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  27. * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. */
  29. #include "includes.h"
  30. #include "atomicio.h"
  31. /*
  32. * ensure all of data on socket comes through. f==read || f==vwrite
  33. */
  34. size_t
  35. atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
  36. {
  37. char *s = _s;
  38. size_t pos = 0;
  39. ssize_t res;
  40. while (n > pos) {
  41. res = (f) (fd, s + pos, n - pos);
  42. switch (res) {
  43. case -1:
  44. if (errno == EINTR || errno == EAGAIN)
  45. continue;
  46. return 0;
  47. case 0:
  48. errno = EPIPE;
  49. return pos;
  50. default:
  51. pos += (size_t)res;
  52. }
  53. }
  54. return (pos);
  55. }